Get Free Shipping on orders over $89
Computing Methods in Optimization Problems : Proceedings of a Conference Held at University of California, Los Angeles January 30-31, 1964 - A. V. Balakrishnan

Computing Methods in Optimization Problems

Proceedings of a Conference Held at University of California, Los Angeles January 30-31, 1964

By: A. V. Balakrishnan (Editor), Lucien W. Neustadt (Editor)

eText | 12 May 2014 | Edition Number 1

At a Glance

eText


$89.10

or 4 interest-free payments of $22.27 with

 or 

Instant online reading in your Booktopia eTextbook Library *

Why choose an eTextbook?

Instant Access *

Purchase and read your book immediately

Read Aloud

Listen and follow along as Bookshelf reads to you

Study Tools

Built-in study tools like highlights and more

* eTextbooks are not downloadable to your eReader or an app and can be accessed via web browsers only. You must be connected to the internet and have no technical issues with your device or browser that could prevent the eTextbook from operating.
Computing Methods in Optimization Problems deals with hybrid computing methods and optimization techniques using computers. One paper discusses different numerical approaches to optimizing trajectories, including the gradient method, the second variation method, and a generalized Newton-Raphson method. The paper cites the advantages and disadvantages of each method, and compares the second variation method (a direct method) with the generalized Newton-Raphson method (an indirect method). An example problem illustrates the application of the three methods in minimizing the transfer time of a low-thrust ion rocket between the orbits of Earth and Mars. Another paper discusses an iterative process for steepest-ascent optimization of orbit transfer trajectories to minimize storage requirements such as in reduced memory space utilized in guidance computers. By eliminating state variable storage and control schedule storage, the investigator can achieve reduced memory requirements. Other papers discuss dynamic programming, invariant imbedding, quasilinearization, Hilbert space, and the computational aspects of a time-optimal control problem. The collection is suitable for computer programmers, engineers, designers of industrial processes, and researchers involved in aviation or control systems technology.
on
Desktop
Tablet
Mobile

More in Applied Mathematics