The parameterized 𝑆𝑅 algorithm for symplectic (butterfly) matrices
From MaRDI portal
Publication:2723526
DOI10.1090/S0025-5718-00-01265-5zbMath0986.65032MaRDI QIDQ2723526
Publication date: 5 July 2001
Published in: Mathematics of Computation (Search for Journal in Brave)
Related Items (3)
A collection of efficient retractions for the symplectic Stiefel manifold ⋮ A Core-Chasing Symplectic QR Algorithm ⋮ Computing Symplectic Eigenpairs of Symmetric Positive-Definite Matrices via Trace Minimization and Riemannian Optimization
Cites Work
- Convergence of algorithms of decomposition type for the eigenvalue problem
- A Schur decomposition for Hamiltonian matrices
- The autonomous linear quadratic control problem. Theory and numerical solution
- Numerical linear algorithms and group theory
- \(SR\) and \(SZ\) algorithms for the symplectic (butterfly) eigenproblem
- The symplectic eigenvalue problem, the butterfly form, the SR algorithm, and the Lanczos method
- Matrix factorizations for symplectic QR-like methods
- Linear Hamiltonian difference systems: Disconjugacy and Jacobi-type conditions
- The QR Transformation A Unitary Analogue to the LR Transformation--Part 1
- Comments on "On the numerical solution of the discrete-time algebraic Riccati equation"
- A symplectic QR like algorithm for the solution of the real algebraic Riccati equation
- The Problem of Lateral Buckling of Cantilever Plates
- On some algorithms for the solution of the complete eigenvalue problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The parameterized 𝑆𝑅 algorithm for symplectic (butterfly) matrices