Symplectic Householder transformations for a QR-like decomposition, a geometric and algebraic approaches
DOI10.1016/J.CAM.2007.03.015zbMATH Open1142.65037OpenAlexW2021138570MaRDI QIDQ2479409FDOQ2479409
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
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
algorithmsymplectic geometryskew-Hamiltonianskew-symmetric inner productsymplectic Householder transformationssymplectic SR factorization
Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Parallel iterative methods for sparse linear systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Accuracy and Stability of Numerical Algorithms
- Matrix factorizations for symplectic QR-like methods
- Title not available (Why is that?)
- A symplectic QR like algorithm for the solution of the real algebraic Riccati equation
- Numerical linear algorithms and group theory
- Title not available (Why is that?)
- Preserving geometric properties of the exponential matrix by block Krylov subspace methods
- A symplectic method for approximating all the eigenvalues of a Hamiltonian matrix
- Structure-preserving methods for computing eigenpairs of large sparse skew-Hamiltonian/Hamiltonian pencils
- An analysis of the HR algorithm for computing the eigenvalues of a matrix
- A Schur decomposition for Hamiltonian matrices
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
- Title not available (Why is that?)
- Optimal symplectic Householder transformations for \(SR\) decomposition
- 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
Uses Software
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)