IDEAS home Printed from https://ideas.repec.org/a/hin/jnljam/245057.html
   My bibliography  Save this article

Direct methods for matrix Sylvester and Lyapunov equations

Author

Listed:
  • Danny C. Sorensen
  • Yunkai Zhou

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.

Suggested Citation

  • Danny C. Sorensen & Yunkai Zhou, 2003. "Direct methods for matrix Sylvester and Lyapunov equations," Journal of Applied Mathematics, Hindawi, vol. 2003, pages 1-27, January.
    • Handle: RePEc:hin:jnljam:245057
    DOI: 10.1155/S1110757X03212055
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/JAM/2003/245057.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/JAM/2003/245057.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/S1110757X03212055?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Binhuan Wang & Lanqiu Yao & Jiyuan Hu & Huilin Li, 2023. "A New Algorithm for Convex Biclustering and Its Extension to the Compositional Data," Statistics in Biosciences, Springer;International Chinese Statistical Association, vol. 15(1), pages 193-216, April.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:jnljam:245057. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.