Refined rigorous perturbation bounds for the SR decomposition
DOI10.1007/S11766-021-4086-XzbMATH Open1499.65140OpenAlexW4200190920MaRDI QIDQ2076709FDOQ2076709
Authors: Mahvish Samar, Aamir Farooq 
Publication date: 22 February 2022
Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11766-021-4086-x
Recommendations
- Refined perturbation bounds for the \(HR\) decomposition
- Perturbation Bounds for the Generalized Schur Decomposition
- Multiplicative perturbation bounds for the \(SR\) factorization
- Perturbation Bounds for the Polar Decomposition
- Multiplicative perturbation bounds for spectral and singular value decompositions
- Componentwise perturbation bounds for some matrix decompositions
- Perturbation bounds on the polar decomposition
- A perturbation bound for the generalized polar decomposition
- New perturbation bounds for factor R of the SR factorization
- Rigorous Perturbation Bounds of Some Matrix Factorizations
Banach fixed point theoremSR decompositionrigorous perturbation boundmixed and componentwise condition numbersLyapunov majorant function
Factorization of matrices (15A23) Numerical computation of matrix norms, conditioning, scaling (65F35)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Accuracy and Stability of Numerical Algorithms
- The autonomous linear quadratic control problem. Theory and numerical solution
- Matrix Riccati equations in control and systems theory
- Matrix factorizations and their perturbations
- Condition numbers of algebraic Riccati equations in the Frobenius norm
- On the sensitivity of the SR decomposition
- Matrix factorizations for symplectic QR-like methods
- Rounding error and perturbation bounds for the symplectic QR factorization
- On theoretical and numerical aspects of symplectic Gram-Schmidt-like algorithms
- Sensitivity analysis for the \(SR\) decomposition
- On mixed and componentwise condition numbers for Moore–Penrose inverse and linear least squares problems
- A symplectic QR like algorithm for the solution of the real algebraic Riccati equation
- On condition numbers for the canonical generalized polar decompostion of real matrices
- Block Kronecker products and the vecb operator
- A symplectic method for approximating all the eigenvalues of a Hamiltonian matrix
- Symplectic Householder transformations for a QR-like decomposition, a geometric and algebraic approaches
- Optimal symplectic Householder transformations for \(SR\) decomposition
- Perturbation theory for matrix equations
- A Schur decomposition for Hamiltonian matrices
- Self-similar flows
- Error analysis and computational aspects of SR factorization via optimal symplectic Householder transformations
- New rigorous perturbation bounds for the Cholesky-like factorization of skew-symmetric matrix
- Structured condition numbers and statistical condition estimation for the \(LDU\) factorization
- Sensitivity analysis for the generalized Cholesky factorization
Cited In (5)
Uses Software
This page was built for publication: Refined rigorous perturbation bounds for the SR decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2076709)
