In 1981 Paige and Van Loan (Linear Algebra Appl 41:11–32, 1981) posed the open question to derive an O(n3) 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.
CITATION STYLE
Bunse-Gerstner, A., & Faßbender, H. (2015). Breaking van loan’s curse: A quest for structure-preserving algorithms for dense structured eigenvalue problems. In Numerical Algebra, Matrix Theory, Differential-Algebraic Equations and Control Theory: Festschrift in Honor of Volker Mehrmann (pp. 3–23). Springer International Publishing. https://doi.org/10.1007/978-3-319-15260-8_1
Mendeley helps you to discover research relevant for your work.