The parametrized SR algorithm for Hamiltonian matrices
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4149460
- An extended Hamiltonian algorithm for the general linear matrix equation
- Structured QR algorithms for Hamiltonian symmetric matrices
- The parameterized \(SR\) algorithm for symplectic (butterfly) matrices
- An efficient and stable structure preserving algorithm for computing the eigenvalues of a Hamiltonian matrix
- A structure preserving approximation method for Hamiltonian exponential matrices
- Lanczos type algorithms for Hamiltonian eigenvalue problems
- The Hamiltonian extended Krylov subspace method
- Symplectic algorithm for testing the Hamiltonian matrix
- A Schur decomposition for Hamiltonian matrices
Cited in
(5)- Some remarks on the complex \(J\)-symmetric eigenproblem
- A Hamiltonian Krylov-Schur-type method based on the symplectic Lanczos process
- The parameterized \(SR\) algorithm for symplectic (butterfly) matrices
- Structure preserving parallel algorithms for solving the Bethe-Salpeter eigenvalue problem
- scientific article; zbMATH DE number 205220 (Why is no real title available?)
This page was built for publication: The parametrized \(SR\) algorithm for Hamiltonian matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q836664)