On computing the symplectic \(LL^T\) factorization

DOI10.1007/s11075-022-01472-yarXiv2204.03927OpenAlexW4311033433MaRDI QIDQ6098135

Alicja Smoktunowicz, Maksymilian Bujok, Grzegorz Borowik

Publication date: 12 June 2023

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2204.03927

zbMATH Keywords

condition numberCholesky factorizationorthogonal matrixsymplectic matrix

Mathematics Subject Classification ID

Stability and convergence of numerical methods for ordinary differential equations (65L20) Existence problems for PDEs: global existence, local existence, non-existence (35A01) Numerical solution of boundary value problems involving ordinary differential equations (65L10) Error bounds for numerical methods for ordinary differential equations (65L70) Finite difference and finite volume methods for ordinary differential equations (65L12) Numerical analysis (65-XX)

Cites Work

• An SVD-like matrix decomposition and its applications
• Canonical forms for Hamiltonian and symplectic matrices and pencils
• Positivity properties of some special matrices
• On the Iwasawa decomposition of a symplectic matrix
• Computing the Iwasawa decomposition of a symplectic matrix by Cholesky factorization
• Anymatrix: an extensible MATLAB matrix collection
• Parametrization of the Matrix Symplectic Group and Applications
• Accuracy and Stability of Numerical Algorithms
• Stability of block LU factorization

This page was built for publication: On computing the symplectic \(LL^T\) factorization