View source for Shooting method

<!--
s0849501.png
$#A+1 = 26 n = 0
$#C+1 = 26 : ~/encyclopedia/old_files/data/S084/S.0804950 Shooting method
Automatically converted into TeX, above some diagnostics.
Please remove this comment and the {{TEX|auto}} line below,
if TeX found to be correct.
-->

{{TEX|auto}}
{{TEX|done}}

A method for solving initial and boundary value problems for ordinary differential equations. It consists of introducing control variables (parameters) and subsequently determining them from the system of equations, where this choice of parameters has a decisive influence on the acceleration of the solution of the system.

Suppose, for  $  a \leq  x \leq  b $, 
one is given the differential equation

$$ \tag{1 }
y  ^  \prime   = \ 
F ( x, y)
$$

with boundary condition

$$ \tag{2 }
g ( y ( a), y ( b))  =  h,
$$

where the vector function  $  y = ( y _ {1} \dots y _ {n} )  ^ {T} $
of  $  x $
is to be determined, the vector functions  $  F = ( F _ {1} \dots F _ {n} )  ^ {T} $
and  $  g = ( g _ {1} \dots g _ {n} )  ^ {T} $
are known, and the numerical vector  $  h = ( h _ {1} \dots h _ {n} )  ^ {T} $
is given.

Suppose that the [[Cauchy problem|Cauchy problem]]

$$ \tag{3 }

\frac{\partial  Z }{\partial  x }
  = \ 
F ( x, Z),
$$

$$ \tag{4 }
Z ( a, r)  =  r,
$$

where  $  Z = ( Z _ {1} \dots Z _ {n} )  ^ {T} $
and  $  r = ( r _ {1} \dots r _ {n} )  ^ {T} $, 
has a unique solution  $  Z ( x, r) $, 
defined for  $  a \leq  x \leq  b $, 
$  r \in \mathbf R  ^ {n} $. 
Upon substituting in (2) for  $  y ( a) $
the given value  $  Z ( a, r) = r $
and for  $  y ( b) $
the calculated value  $  Z ( b, r) $, 
one obtains the equation

$$ \tag{5 }
g ( r, Z ( b, r))  =  h
$$

with respect to the parameter  $  r $.

The algorithm of the shooting method is as follows. First one finds a solution  $  r = r  ^ {*} $
of (5), and subsequently the required solution of the boundary value problem (1)–(2) as the solution of the Cauchy problem

$$ 
y  ^  \prime   =  F ( x, y),\ \ 
y ( a)  =  r  ^ {*} .
$$

This problem can be solved using numerical methods. In order to solve (5) it is usually necessary to choose some iteration method.

If some of the components of  $  y $
depend on  $  y ( a) $
alone and the others on  $  y ( b) $
alone, it is useful to make another choice of parameters (cf. [[#References|[1]]], as well as [[Non-linear boundary value problem, numerical methods|Non-linear boundary value problem, numerical methods]]). There are other versions of the shooting method (cf. [[#References|[4]]]). The shooting method is also used in solving grid boundary value problems.

====References====
<table><TR><TD valign="top">[1]</TD> <TD valign="top">  N.S. Bakhvalov,   "Numerical methods: analysis, algebra, ordinary differential equations" , MIR  (1977)  (Translated from Russian)</TD></TR><TR><TD valign="top">[2]</TD> <TD valign="top">  S.K. Godunov,   V.S. Ryaben'kii,   "The theory of difference schemes" , North-Holland  (1964)  (Translated from Russian)</TD></TR><TR><TD valign="top">[3]</TD> <TD valign="top">  V.I. Krylov,   V.V. Bobkov,   P.I. Monastyrnyi,   "Numerical methods" , '''2''' , Moscow  (1977)  (In Russian)</TD></TR><TR><TD valign="top">[4]</TD> <TD valign="top">  G. Hall (ed.)  J.M. Watt (ed.) , ''Modern numerical methods for ordinary differential equations'' , Clarendon Press  (1976)</TD></TR></table>

====Comments====

====References====
<table><TR><TD valign="top">[a1]</TD> <TD valign="top">  U.M. Ascher,   R.M.M. Mattheij,   R.D. Russell,   "Numerical solution for boundary value problems for ordinary differential equations" , Prentice-Hall  (1988)</TD></TR></table>