It is convenient to write the system of differential equations in
vector form, since we can describe the equations for systems in terms of
a single vector equation. Let us set
| (10.39) |
| (10.40) |
There are two commonly used approaches to the numerical solution of BVPs. The idea of the first technique is that if all values of are known at , then the problem can be reduced to an IVP. However, can be found only by solving the problem. Therefore an iterative procedure must be used. We assume values at , which are not given as boundary conditions at and compute the solution of the resulting IVP to . The computed values of will not, in general, agree with the corresponding boundary condition at . Consequently, we need to adjust the initial values and try again. The process is repeated until the computed values at the final point agree with the boundary conditions and is referred to as shooting method. The second method is based on a finite difference approximation to on a mesh of points in the interval . This method starts with an initial guess and improves the solution iteratively and is referred to as, direct method, relaxation method or finite difference method. We have implemented both methods and found that the finite difference method is much more reliable than the shooting method. By contrast to the finite difference method, the shooting method is often very sensitive to the unknown initial values at point . First, we briefly discuss the shooting method.