IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-319-15260-8_1.html
   My bibliography  Save this book chapter

Breaking Van Loan’s Curse: A Quest forStructure-Preserving Algorithms for Dense Structured Eigenvalue Problems

In: Numerical Algebra, Matrix Theory, Differential-Algebraic Equations and Control Theory

Author

Listed:
  • Angelika Bunse-Gerstner

    (Universität Bremen, Fachbereich Mathematik/Informatik, Zentrum für Technomathematik)

  • Heike Faßbender

    (Technische Universität Braunschweig, Institut Computational Mathematics, AG Numerik)

Abstract

In 1981 Paige and Van Loan (Linear Algebra Appl 41:11–32, 1981) posed the open question to derive an $$\mathcal{O}(n^{3})$$ numerically strongly backwards stable method to compute the real Hamiltonian Schur form of a Hamiltonian matrix. This problem is known as Van Loan’s curse. This chapter summarizes Volker Mehrmann’s work on dense structured eigenvalue problems, in particular, on Hamiltonian and symplectic eigenproblems. In the course of about 35 years working on and off on these problems the curse has been lifted by him and his co-workers. In particular, his work on SR methods and on URV-based methods for dense Hamiltonian and symplectic matrices and matrix pencils is reviewed. Moreover, his work on structure-preserving methods for other structured eigenproblems is discussed.

Suggested Citation

  • Angelika Bunse-Gerstner & Heike Faßbender, 2015. "Breaking Van Loan’s Curse: A Quest forStructure-Preserving Algorithms for Dense Structured Eigenvalue Problems," Springer Books, in: Peter Benner & Matthias Bollhöfer & Daniel Kressner & Christian Mehl & Tatjana Stykel (ed.), Numerical Algebra, Matrix Theory, Differential-Algebraic Equations and Control Theory, edition 127, chapter 0, pages 3-23, Springer.
    • Handle: RePEc:spr:sprchp:978-3-319-15260-8_1
    DOI: 10.1007/978-3-319-15260-8_1
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:spr:sprchp:978-3-319-15260-8_1. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.