Structured QR algorithms for Hamiltonian symmetric matrices
From MaRDI portal
Recommendations
- Hamilton and Jacobi come full circle: Jacobi algorithms for structured Hamiltonian eigenproblems
- An efficient and stable structure preserving algorithm for computing the eigenvalues of a Hamiltonian matrix
- scientific article; zbMATH DE number 4037035
- On Hamiltonian and symplectic Lanczos processes
- Structured Eigenvalue Problems
Cited in
(14)- Implicit QR algorithms for palindromic and even eigenvalue problems
- An efficient and stable structure preserving algorithm for computing the eigenvalues of a Hamiltonian matrix
- An extended Hamiltonian QR algorithm
- The structure of alternating-Hamiltonian matrices
- A structure-preserving algorithm for the linear lossless dissipative Hamiltonian eigenvalue problem
- Structures preserved by the QR-algorithm
- Numerical methods and software for general and structured eigenvalue problems.
- A Chart of Numerical Methods for Structured Eigenvalue Problems
- QR-Like Algorithms for Symmetric Arrow Matrices
- Bidirectional Chasing Algorithms for the Eigenvalue Problem
- Structure preserving algorithms for perplectic eigenproblems
- Matrix shapes invariant under the symmetric QR algorithm
- A core-chasing symplectic QR algorithm
- The parametrized SR algorithm for Hamiltonian matrices
This page was built for publication: Structured QR algorithms for Hamiltonian symmetric matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3091580)