By Topic

Parallel solutions of very large sparse Lyapunov equations by balanced BBD decompositions

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)
A. I. Zecevic ; Dept. of Electr. Eng., Santa Clara Univ., CA, USA ; D. D. Siljak

In this paper, a method for the parallel solution of large sparse matrix equations is presented. The method is based on the balanced bordered block diagonal (BBD) decomposition which is applied in conjunction with the successive over-relaxation (SOR) iterative method to solve large Lyapunov equations in the Kronecker sum representation. A variety of experimental results will be presented, including solutions of Lyapunov equations with matrices as large as 1993×1993

Published in:

IEEE Transactions on Automatic Control  (Volume:44 ,  Issue: 3 )