A Symplectic Lanczos-Type Algorithm to Compute the Eigenvalues of Positive Definite Hamiltonian Matrices
From MaRDI portal
(Redirected from Publication:3527795)
Recommendations
- An implicitly restarted symplectic Lanczos method for the Hamiltonian eigenvalue problem
- On Hamiltonian and symplectic Lanczos processes
- An implicitly restarted symplectic Lanczos method for the symplectic eigenvalue problem
- A symplectic method for approximating all the eigenvalues of a Hamiltonian matrix
- Publication:4504268
Cited in
(15)- A symplectic method for approximating all the eigenvalues of a Hamiltonian matrix
- A note on the numerical solution of complex Hamiltonian and skew-Hamiltonian eigenvalue problems
- An implicitly restarted symplectic Lanczos method for the Hamiltonian eigenvalue problem
- A numerically stable, structure preserving method for computing the eigenvalues of real Hamiltonian or symplectic pencils
- On Hamiltonian and symplectic Lanczos processes
- A thick-restart Lanczos type method for Hermitian \(J\)-symmetric eigenvalue problems
- Structured shifts for skew-symmetric matrices
- An implicitly restarted symplectic Lanczos method for the symplectic eigenvalue problem
- scientific article; zbMATH DE number 4199466 (Why is no real title available?)
- Conservative perturbations of positive definite Hamiltonian matrices
- scientific article; zbMATH DE number 1505484 (Why is no real title available?)
- Computing symplectic eigenpairs of symmetric positive-definite matrices via trace minimization and Riemannian optimization
- A Hamiltonian Krylov-Schur-type method based on the symplectic Lanczos process
- The Hamiltonian extended Krylov subspace method
- A collection of efficient retractions for the symplectic Stiefel manifold
This page was built for publication: A Symplectic Lanczos-Type Algorithm to Compute the Eigenvalues of Positive Definite Hamiltonian Matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3527795)
