Direct methods for matrix Sylvester and Lyapunov equations

Danny C. Sorensen and Yunkai Zhou

Journal of Applied Mathematics, 2003, vol. 2003, issue 6, 277-303

Abstract: We revisit the two standard dense methods for matrix Sylvester and Lyapunov equations: the Bartels‐Stewart method for A1X + XA2 + D = 0 and Hammarling′s method for AX + XAT + BBT = 0 with A stable. We construct three schemes for solving the unitarily reduced quasitriangular systems. We also construct a new rank‐1 updating scheme in Hammarling′s method. This new scheme is able to accommodate a B with more columns than rows as well as the usual case of a B with more rows than columns, while Hammarling′s original scheme needs to separate these two cases. We compared all of our schemes with the Matlab Sylvester and Lyapunov solver lyap.m; the results show that our schemes are much more efficient. We also compare our schemes with the Lyapunov solver sllyap in the currently possibly the most efficient control library package SLICOT; numerical results show our scheme to be competitive.

Date: 2003
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1155/S1110757X03212055

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:jnljam:v:2003:y:2003:i:6:p:277-303

Access Statistics for this article

More articles in Journal of Applied Mathematics from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().