By Topic

A Jacobi-like method for solving algebraic Riccati equations on parallel computers

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

2 Author(s)
Bunse-Gerstner, A. ; Fachbereich Math. und Inf., Bremen Univ., Germany ; Fassbender, H.

An algorithm to solve continuous-time algebraic Riccati equations through the Hamiltonian Schur form is developed. It is an adaption for Hamiltonian matrices of an asymmetric Jacobi method of Eberlein (1987). It uses unitary symplectic similarity transformations and preserves the Hamiltonian structure of the matrix. Each iteration step needs only local information about the current matrix, thus admitting efficient parallel implementations on certain parallel architectures. Convergence performance of the algorithm is compared with the Hamiltonian-Jacobi algorithm of Byers (1990). The numerical experiments suggest that the method presented here converges considerably faster for non-Hermitian Hamiltonian matrices than Byers' Hamiltonian-Jacobi algorithm. Besides that, numerical experiments suggest that for the method presented here, the number of iterations needed for convergence can be predicted by a simple function of the matrix size

Published in:

Automatic Control, IEEE Transactions on  (Volume:42 ,  Issue: 8 )