A treatment of breakdowns and near breakdowns in a reduction of a matrix to upper \(J\)-Hessenberg form and related topics

DOI10.1016/j.cam.2019.03.011zbMath1503.65077arXiv1710.08224OpenAlexW2963242680MaRDI QIDQ2312666

Haithem Ben Kahla, Ahmed Salam

Publication date: 17 July 2019

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1710.08224

zbMATH Keywords

symplectic Householder transformations\(SR\) decompositionupper \(J\)-Hessenberg form\(SR\)-algorithmbreakdowns and near-breakdowns

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal symplectic Householder transformations for \(SR\) decomposition
• Error analysis and computational aspects of SR factorization via optimal symplectic Householder transformations
• A Schur decomposition for Hamiltonian matrices
• A symplectic method for approximating all the eigenvalues of a Hamiltonian matrix
• Numerical linear algorithms and group theory
• On some algebraic problems in connection with general eigenvalue algorithms
• Matrix factorizations for symplectic QR-like methods
• An upper \(J\)-Hessenberg reduction of a matrix through symplectic Householder transformations
• Symplectic Householder transformations for a QR-like decomposition, a geometric and algebraic approaches
• A symplectic QR like algorithm for the solution of the real algebraic Riccati equation
• The Matrix Eigenvalue Problem