Symplectic Householder transformations for a QR-like decomposition, a geometric and algebraic approaches

DOI10.1016/J.CAM.2007.03.015MaRDI QIDQ2479409zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 26 March 2008

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

Full work available at URL https://doi.org/10.1016/j.cam.2007.03.015

zbMATH Keywords

algorithmsymplectic geometryskew-Hamiltonianskew-symmetric inner productsymplectic Householder transformationssymplectic SR factorization

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Recommendations

• Optimal symplectic Householder transformations for \(SR\) decomposition
• scientific article; zbMATH DE number 6398924
• Equivalence between modified symplectic Gram-Schmidt and Householder SR algorithms
• Matrix factorizations for symplectic QR-like methods
• Error analysis and computational aspects of SR factorization via optimal symplectic Householder transformations

Cites work

• scientific article; zbMATH DE number 3125713 (Why is no real title available?)
• scientific article; zbMATH DE number 4215266 (Why is no real title available?)
• scientific article; zbMATH DE number 192975 (Why is no real title available?)
• scientific article; zbMATH DE number 3435336 (Why is no real title available?)
• scientific article; zbMATH DE number 802915 (Why is no real title available?)
• scientific article; zbMATH DE number 961607 (Why is no real title available?)
• A Schur decomposition for Hamiltonian matrices
• A symplectic QR like algorithm for the solution of the real algebraic Riccati equation
• A symplectic method for approximating all the eigenvalues of a Hamiltonian matrix
• Accuracy and Stability of Numerical Algorithms
• An analysis of the HR algorithm for computing the eigenvalues of a matrix
• Matrix factorizations for symplectic QR-like methods
• Numerical linear algorithms and group theory
• Parallel iterative methods for sparse linear systems
• Preserving geometric properties of the exponential matrix by block Krylov subspace methods
• Structure-preserving methods for computing eigenpairs of large sparse skew-Hamiltonian/Hamiltonian pencils

Cited in

(12)

• Equivalence between modified symplectic Gram-Schmidt and Householder SR algorithms
• Error analysis and computational aspects of SR factorization via optimal symplectic Householder transformations
• Block algorithms for orthogonal symplectic factorizations
• Each symplectic matrix is a product of four symplectic involutions
• Optimal symplectic Householder transformations for \(SR\) decomposition
• scientific article; zbMATH DE number 6398924 (Why is no real title available?)
• A structure-preserving \(QR\) factorization for centrosymmetric real matrices
• Perturbation analysis for the symplectic QR factorization
• The \(J\)-Householder matrices
• Refined rigorous perturbation bounds for the SR decomposition
• An upper \(J\)-Hessenberg reduction of a matrix through symplectic Householder transformations
• A treatment of breakdowns and near breakdowns in a reduction of a matrix to upper \(J\)-Hessenberg form and related topics

Describes a project that uses

Uses Software

• mctoolbox

This page was built for publication: Symplectic Householder transformations for a QR-like decomposition, a geometric and algebraic approaches

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2479409)