Direct methods for matrix Sylvester and Lyapunov equations

Danny C. Sorensen and Yunkai Zhou

Journal of Applied Mathematics, 2003, vol. 2003, 1-27

Abstract:

We revisit the two standard dense methods for matrix Sylvester and Lyapunov equations: the Bartels-Stewart method for A 1 X + X A 2 + D = 0 and Hammarling's method for A X + X A T + B B T = 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: View citations in EconPapers (1)

Downloads: (external link)
http://downloads.hindawi.com/journals/JAM/2003/245057.pdf (application/pdf)
http://downloads.hindawi.com/journals/JAM/2003/245057.xml (text/xml)

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:hin:jnljam:245057

DOI: 10.1155/S1110757X03212055

Access Statistics for this article

More articles in Journal of Applied Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().