Optimal symplectic Householder transformations for SR decomposition
DOI10.1016/J.LAA.2008.02.029zbMATH Open1198.65075OpenAlexW2087604113MaRDI QIDQ935403FDOQ935403
Authors: B. E. Eshmatov
Publication date: 6 August 2008
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2008.02.029
Recommendations
- Symplectic Householder transformations for a QR-like decomposition, a geometric and algebraic approaches
- Error analysis and computational aspects of SR factorization via optimal symplectic Householder transformations
- scientific article; zbMATH DE number 6398924
- \(SR\) and \(SZ\) algorithms for the symplectic (butterfly) eigenproblem
- Equivalence between modified symplectic Gram-Schmidt and Householder SR algorithms
algorithmnumerical experimentssymplectic transvections\(QR\) factorization\(SR\) factorizationskew-symmetric inner productstructure and symplectic orthogonality preservationstructure-preserving eigenproblemssymplectic Gram-Schmidtsymplectic Householder transformations
Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)
Cites Work
- 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?)
- Matrix factorizations for symplectic QR-like methods
- \(\mathbb G\)-reflectors: Analogues of Householder transformations in scalar product spaces
- 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
- Preserving geometric properties of the exponential matrix by block Krylov subspace methods
- Numerics of Gram-Schmidt orthogonalization
- A symplectic method for approximating all the eigenvalues of a Hamiltonian matrix
- An implicitly restarted symplectic Lanczos method for the Hamiltonian eigenvalue problem
- Title not available (Why is that?)
- An analysis of the HR algorithm for computing the eigenvalues of a matrix
- A Schur decomposition for Hamiltonian matrices
- On the Iwasawa decomposition of a symplectic matrix
- Title not available (Why is that?)
Cited In (17)
- Symplectic Householder transformations for a QR-like decomposition, a geometric and algebraic approaches
- Equivalence between modified symplectic Gram-Schmidt and Householder SR algorithms
- Error analysis and computational aspects of SR factorization via optimal symplectic Householder transformations
- On the conditioning of factors in the SR decomposition
- Optimization on the symplectic Stiefel manifold: SR decomposition-based retraction and applications
- Optimal unit triangular factorization of symplectic matrices
- Matrix factorizations for symplectic QR-like methods
- Each symplectic matrix is a product of four symplectic involutions
- Approximate unitary 3-designs from transvection Markov chains
- Title not available (Why is that?)
- A structure-preserving \(QR\) factorization for centrosymmetric real matrices
- How to efficiently select an arbitrary Clifford group element
- Each \(2n\)-by-\(2n\) complex symplectic matrix is a product of \(n+1\) commutators of \(J\)-symmetries
- 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
This page was built for publication: Optimal symplectic Householder transformations for \(SR\) decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q935403)