| contributor author | A. E. Bryson | |
| contributor author | W. F. Denham | |
| date accessioned | 2017-05-08T22:59:56Z | |
| date available | 2017-05-08T22:59:56Z | |
| date copyright | June, 1962 | |
| date issued | 1962 | |
| identifier issn | 0021-8936 | |
| identifier other | JAMCAV-25666#247_1.pdf | |
| identifier uri | http://yetl.yabesh.ir/yetl/handle/yetl/88202 | |
| description abstract | 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. | |
| publisher | The American Society of Mechanical Engineers (ASME) | |
| title | A Steepest-Ascent Method for Solving Optimum Programming Problems | |
| type | Journal Paper | |
| journal volume | 29 | |
| journal issue | 2 | |
| journal title | Journal of Applied Mechanics | |
| identifier doi | 10.1115/1.3640537 | |
| journal fristpage | 247 | |
| journal lastpage | 257 | |
| identifier eissn | 1528-9036 | |
| keywords | Differential equations | |
| keywords | Boundary-value problems AND Computer programming | |
| tree | Journal of Applied Mechanics:;1962:;volume( 029 ):;issue: 002 | |
| contenttype | Fulltext | |
