By Topic

On the rate of convergence of the quasi-linearization method

Sign In

Full text access may be available.

To access full text, please use your member or institutional sign in.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Kalaba, R. ; University of Southern California, Los Angeles, CA, USA ; Spingarn, K.

It is well known that the method of quasi-linearization is quadratically convergent for nonlinear two-point boundary value and system identification problems. In order to avoid the storage of successive approximations, it is sometimes convenient to integrate the original differential equations instead of storing the solution of the linearized equations. This reduces the rate of convergence, but it is generally not known by how much. It is shown that even for the simplist problem, the penalty in increased computing time can be dramatic.

Published in:

Automatic Control, IEEE Transactions on  (Volume:28 ,  Issue: 7 )