A Jordan-Schur Algorithm for Solving Sylvester and Lyapunov Matrix Equations

Authors

DOI:

https://doi.org/10.37256/cm.3420221851

Keywords:

Sylvester equation, Lyapunov equation, Jordan-Schur form, Bartels-Stewart algorithm

Abstract

This paper presents a version of the Bartels-Stewart algorithm for solving the Sylvester and Lyapunov equations that utilizes the Jordan-Schur form of the equation matrices. The Jordan-Schur form is a type of Schur form which contains additional information about the Jordan structure of the corresponding matrix. This information can be used to solve more efficiently the Sylvester and Lyapunov equations in some cases. A two-level algorithm is implemented which allows us to find directly non-scalar blocks of the solution matrix. These blocks have sizes that are determined by the Weyr characteristics associated with the eigenvalues of the equation matrices. In the case of large elements of the Weyr characteristics associated with multiple eigenvalues, the determination of the solution blocks can be done more efficiency. Also, the blocks equations can be more appropriate in solving the Sylvester and Lyapunov equations in the case of parallel computations. Results obtained from numerical experiments confirm that the accuracy of the new algorithm is comparable with the accuracy of the Bartels-Stewart algorithm.

Downloads

Published

2022-11-03

How to Cite

1.
Petkov PH. A Jordan-Schur Algorithm for Solving Sylvester and Lyapunov Matrix Equations. Contemp. Math. [Internet]. 2022 Nov. 3 [cited 2024 Jul. 18];3(4):473-99. Available from: https://ojs.wiserpub.com/index.php/CM/article/view/1851