By Topic

Efficient matrix-valued algorithms for solving stiff Riccati differential equations

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $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)
C. H. Choi ; Dept. of Electr. Eng., Univ. of South Alabama, Mobile, AL, USA ; A. J. Laub

In the time-varying case, a classical approach which has been widely used to compute the solution of the Riccati matrix equation of, for example, size n×n, is to unroll the matrices into vectors and integrate the resulting system of n2 vector differential equations directly. If the system of vectorized differential equations is stiff, the cost (computation time and storage requirements) of applying the popular backward differentiation formulas (BDFs) to the stiff equations will be very high for large n because a linear system of algebraic equations of size n2×n2 must be solved at each time step. New matrix-valued algorithms based on a matrix generalization of the BDFs are proposed for solving stiff Riccatti differential equations. The amount of work required to compute the solution per time step is only O(n3) flops by using the matrix-valued algorithms, whereas the classical approach requires O(n6) flops per time step

Published in:

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