Computation of Stable Invariant Subspaces of Hamiltonian Matrices
DOI10.1137/S0895479889171352zbMATH Open0799.65044OpenAlexW2005943884MaRDI QIDQ4287910FDOQ4287910
Authors:
Publication date: 19 April 1994
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0895479889171352
Recommendations
- A new method for computing the stable invariant subspace of a real Hamiltonian matrix
- On Computing Stable Lagrangian Subspaces of Hamiltonian Matrices and Symplectic Pencils
- An efficient and stable structure preserving algorithm for computing the eigenvalues of a Hamiltonian matrix
- Publication:4504268
algorithmsnumerical examplesinvariant subspaceeigenvectorsQR algorithmHamiltonian matrixstable eigenvalues
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Orthogonalization in numerical linear algebra (65F25)
Cited In (5)
- Body loads in scaled boundary finite-element method
- Stability of structured Hamiltonian eigensolvers
- The shift-inverted \(J\)-Lanczos algorithm for the numerical solutions of large sparse algebraic Riccati equations
- Title not available (Why is that?)
- An efficient and stable structure preserving algorithm for computing the eigenvalues of a Hamiltonian matrix
Uses Software
This page was built for publication: Computation of Stable Invariant Subspaces of Hamiltonian Matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4287910)