By Topic

Parallel methods for computating the matrix sign function with applications to the algebraic Riccati equation

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
$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

3 Author(s)
Hasan, M.A. ; Dept. of Electr. & Comput. Eng., Minnesota Univ., Duluth, MN, USA ; Hasan, A.A. ; Ejaz, K.B.

Several methods of solving the algebraic Riccati equation (ARE) are presented. Functional iterations with acceleration techniques am introduced. Also variations of the Newton method, the subspace iteration, and Krylov sequence are proposed for solving the ARE. The relation between the matrix sign function and the solution of the algebraic Riccati equation is stated, and several iterative schemes for the matrix sign function are described. Specifically, higher order rational functions for computing the matrix sign function of complex matrices has been developed, where parallel implementation of the matrix sign function is developed through partial fractions expansion. A QR inverse free method for computing the matrix sign function for symmetric matrices is derived. the matrix sign function is then used to solve the algebraic Riccati equation. The performance of these methods is demonstrated by several examples

Published in:

Decision and Control, 2001. Proceedings of the 40th IEEE Conference on  (Volume:5 )

Date of Conference:

2001