View source for Travelling-wave method

A direct method for the numerical solution of problems in the calculus of variations (cf. [[Variational calculus|Variational calculus]]). It is used for solving problems of [[Optimal control|optimal control]] of small dimensions, but with constraints on the phase coordinates and control functions. After discretization of the functional and the system of differential equations, the original problem is reduced to the minimization of a functional:

<table class="eq" style="width:100%;"> <tr><td valign="top" style="width:94%;text-align:center;"><img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/t/t094/t094050/t0940501.png" /></td> <td valign="top" style="width:5%;text-align:right;">(1)</td></tr></table>

<table class="eq" style="width:100%;"> <tr><td valign="top" style="width:94%;text-align:center;"><img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/t/t094/t094050/t0940502.png" /></td> <td valign="top" style="width:5%;text-align:right;">(2)</td></tr></table>

<table class="eq" style="width:100%;"> <tr><td valign="top" style="width:94%;text-align:center;"><img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/t/t094/t094050/t0940503.png" /></td> </tr></table>

<table class="eq" style="width:100%;"> <tr><td valign="top" style="width:94%;text-align:center;"><img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/t/t094/t094050/t0940504.png" /></td> <td valign="top" style="width:5%;text-align:right;">(3)</td></tr></table>

Here <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/t/t094/t094050/t0940505.png" />, <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/t/t094/t094050/t0940506.png" /> are vectors of the phase coordinates and the controls, respectively, at the node <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/t/t094/t094050/t0940507.png" /> (with respective dimensions <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/t/t094/t094050/t0940508.png" /> and <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/t/t094/t094050/t0940509.png" />), <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/t/t094/t094050/t09405010.png" /> being considered as constant on each interval <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/t/t094/t094050/t09405011.png" />, <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/t/t094/t094050/t09405012.png" /> are given domains of an <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/t/t094/t094050/t09405013.png" />-dimensional space (<img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/t/t094/t094050/t09405014.png" /> and <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/t/t094/t094050/t09405015.png" /> describe the boundary conditions), and <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/t/t094/t094050/t09405016.png" /> is the subdivision step of the initial interval <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/t/t094/t094050/t09405017.png" />.

The travelling-wave method is used in the case <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/t/t094/t094050/t09405018.png" />, which is typical of practical problems, and for which the use of other methods based on the variation of spatial states (cf. [[Travelling-tube method|Travelling-tube method]]; [[Local variations, method of|Local variations, method of]]) is difficult because of the labour involved in determining the control function.

The given initial approximation <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/t/t094/t094050/t09405019.png" />, which satisfies (2) and (3), is improved in the sense of criterion (1) on each segment between <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/t/t094/t094050/t09405020.png" /> and <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/t/t094/t094050/t09405021.png" /> (<img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/t/t094/t094050/t09405022.png" />, <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/t/t094/t094050/t09405023.png" /> are given), and this segment is gradually shifted by one node each time from the beginning of the trajectory to its end and back again (hence the name  "travelling wave" ).

One obtains, for each wave, a non-linear programming problem: The minimization of

<table class="eq" style="width:100%;"> <tr><td valign="top" style="width:94%;text-align:center;"><img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/t/t094/t094050/t09405024.png" /></td> <td valign="top" style="width:5%;text-align:right;">(4)</td></tr></table>

with <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/t/t094/t094050/t09405025.png" /> constraints of the type (2) and under the conditions (3). In the practical realization of the travelling-wave method no attempt is made to solve problem (4); instead, the increments <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/t/t094/t094050/t09405026.png" /> are given to each one of the <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/t/t094/t094050/t09405027.png" /> free parameters and, if <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/t/t094/t094050/t09405028.png" /> (in equation (4)) decreases and the conditions (3) are fulfilled, a new trajectory is obtained. If the trajectory remains unchanged during a complete period of the wave, <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/t/t094/t094050/t09405029.png" /> is replaced by a fraction of it.

If <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/t/t094/t094050/t09405030.png" />, the travelling-wave method becomes identical with the method of local variations.

====References====
<table><TR><TD valign="top">[1]</TD> <TD valign="top">  N.N. Moiseev,   "Elements of the theory of optimal systems" , Moscow  (1975)  (In Russian)</TD></TR><TR><TD valign="top">[2]</TD> <TD valign="top">  I.A. Vatel,   A.F. Kononenko,   "A numerical scheme for solving optimal control problems"  ''USSR Comput. Math. Math. Phys.'' , '''10''' :  1  (1970)  pp. 85–94  ''Zh. Vychisl. Mat. i Mat. Fiz.'' , '''10''' :  1  (1970)  pp. 67–73</TD></TR><TR><TD valign="top">[3]</TD> <TD valign="top">  I.A. Vatel',   A.F. Kononenko,   ''Algoritm. i Program. (Informatsion. Byull.)'' :  2  (1972)  pp. 7</TD></TR></table>

'