A note on the sensitivity analysis for the symplectic QR factorization
From MaRDI portal
Publication:5272417
DOI10.7153/mia-20-29zbMath1366.15010OpenAlexW2614260511MaRDI QIDQ5272417
Publication date: 29 June 2017
Published in: Mathematical Inequalities & Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7153/mia-20-29
Banach fixed point principleLyapunov majorant functionrigorous perturbation boundsymplectic QR factorization
Related Items (3)
Sensitivity analysis for the generalized Cholesky block downdating problem ⋮ Improved rigorous multiplicative perturbation bounds for the generalized Cholesky factorization and the Cholesky-like factorization ⋮ Sensitivity analysis for the block Cholesky downdating problem
This page was built for publication: A note on the sensitivity analysis for the symplectic QR factorization