A block \(J\)-Lanczos method for Hamiltonian matrices
DOI10.1553/etna_vol52s26zbMath1431.65040OpenAlexW3003402569MaRDI QIDQ2303344
Said Agoujil, Atika Archid, Abdeslem Hafid Bentbib
Publication date: 3 March 2020
Published in: ETNA. Electronic Transactions on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: http://etna.mcs.kent.edu/volumes/2011-2020/vol52/abstract.php?vol=52&pages=26-42
Hamiltonian matrixsymplectic matrixskew-Hamiltonian matrixsymplectic reflectorblock \(J\)-Hessenberg formblock \(J\)-Lanczos methodblock \(J\)-tridiagonal form
Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)
Related Items (2)
Cites Work
- Unnamed Item
- Preserving geometric properties of the exponential matrix by block Krylov subspace methods
- Algebraic properties of the block GMRES and block Arnoldi methods
- The symplectic eigenvalue problem, the butterfly form, the SR algorithm, and the Lanczos method
- A Krylov projection method for systems of ODEs
- The shift-inverted \(J\)-Lanczos algorithm for the numerical solutions of large sparse algebraic Riccati equations
- An implicitly restarted symplectic Lanczos method for the Hamiltonian eigenvalue problem
- Krylov integrators for Hamiltonian systems
- Methods for the approximation of the matrix exponential in a Lie-algebraic setting
- Analysis of Some Krylov Subspace Approximations to the Matrix Exponential Operator
- On Krylov Subspace Approximations to the Matrix Exponential Operator
- A symplectic QR like algorithm for the solution of the real algebraic Riccati equation
- Computation of the Exponential of Large Sparse Skew-Symmetric Matrices
- Computing Lyapunov exponents on a Stiefel manifold
This page was built for publication: A block \(J\)-Lanczos method for Hamiltonian matrices