A Steepest-Ascent Method for Solving Optimum Programming Problems

1962 ◽  
Vol 29 (2) ◽  
pp. 247-257 ◽  
Author(s):  
A. E. Bryson ◽  
W. F. Denham

A systematic and rapid steepest-ascent numerical procedure is described for solving two-point boundary-value problems in the calculus of variations for systems governed by a set of nonlinear ordinary differential equations. Numerical examples are presented for minimum time-to-climb and maximum altitude paths for a supersonic interceptor and maximum-range paths for an orbital glider.

2016 ◽  
Vol 21 (2) ◽  
pp. 270-281
Author(s):  
Nadezhda Sveikate

Three-point boundary value problems for the second order nonlinear ordinary differential equations are considered. Existence of solutions are established by using the quasilinearization approach. As an application, the Emden-Fowler type problems with nonresonant and resonant linear parts are considered to demonstrate our results.


2014 ◽  
Vol 58 (1) ◽  
pp. 183-197 ◽  
Author(s):  
John R. Graef ◽  
Johnny Henderson ◽  
Rodrica Luca ◽  
Yu Tian

AbstractFor the third-order differential equationy′″ = ƒ(t, y, y′, y″), where, questions involving ‘uniqueness implies uniqueness’, ‘uniqueness implies existence’ and ‘optimal length subintervals of (a, b) on which solutions are unique’ are studied for a class of two-point boundary-value problems.


Sign in / Sign up

Export Citation Format

Share Document