Optimal symplectic Householder transformations for SR decomposition
From MaRDI portal
(Redirected from Optimal symplectic Householder transformations for SR decomposition)
Optimal symplectic Householder transformations for \(SR\) decomposition
Optimal symplectic Householder transformations for \(SR\) decomposition
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
Cites work
- \(\mathbb G\)-reflectors: Analogues of Householder transformations in scalar product spaces
- A Schur decomposition for Hamiltonian matrices
- A symplectic method for approximating all the eigenvalues of a Hamiltonian matrix
- A symplectic QR like algorithm for the solution of the real algebraic Riccati equation
- An analysis of the HR algorithm for computing the eigenvalues of a matrix
- An implicitly restarted symplectic Lanczos method for the Hamiltonian eigenvalue problem
- scientific article; zbMATH DE number 2186301 (Why is no real title available?)
- 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 3686657 (Why is no real title available?)
- scientific article; zbMATH DE number 1049347 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Matrix factorizations for symplectic QR-like methods
- Numerical linear algorithms and group theory
- Numerics of Gram-Schmidt orthogonalization
- On the Iwasawa decomposition of a symplectic matrix
- Parallel iterative methods for sparse linear systems
- Preserving geometric properties of the exponential matrix by block Krylov subspace methods
Cited in
(17)- Matrix factorizations for symplectic QR-like methods
- Refined rigorous perturbation bounds for the SR decomposition
- Optimal unit triangular factorization of symplectic matrices
- Approximate unitary 3-designs from transvection Markov chains
- 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
- Equivalence between modified symplectic Gram-Schmidt and Householder SR algorithms
- Symplectic Householder transformations for a QR-like decomposition, a geometric and algebraic approaches
- On the conditioning of factors in the SR decomposition
- How to efficiently select an arbitrary Clifford group element
- Each symplectic matrix is a product of four symplectic involutions
- A structure-preserving \(QR\) factorization for centrosymmetric real matrices
- Each 2n-by-2n complex symplectic matrix is a product of n+1 commutators of J-symmetries
- scientific article; zbMATH DE number 6398924 (Why is no real title available?)
- Optimization on the symplectic Stiefel manifold: SR decomposition-based retraction and applications
- The \(J\)-Householder matrices
- Error analysis and computational aspects of SR factorization via optimal symplectic Householder transformations
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)