Sensitivity analyses for factorizations of sparse or structured matrices
From MaRDI portal
Publication:1124755
DOI10.1016/S0024-3795(98)10100-3zbMath0937.65030WikidataQ114122544 ScholiaQ114122544MaRDI QIDQ1124755
Xiao-Wen Chang, Christopher C. Paige
Publication date: 28 November 1999
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Computational methods for sparse matrices (65F50) Numerical computation of matrix norms, conditioning, scaling (65F35) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items (6)
Structured condition numbers for some matrix factorizations of structured matrices ⋮ Structured condition numbers and statistical condition estimation for the \(LDU\) factorization ⋮ Perturbations of Triangular Matrix Factorizations ⋮ On the sensitivity of the LU factorization ⋮ Stability and sensitivity of tridiagonal LU factorization without pivoting ⋮ Perturbation bounds for triangular and full rank factorizations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Perturbation bounds for the Cholesky and QR factorizations
- On the sensitivity of the LU factorization
- Rigorous Perturbation Bounds of Some Matrix Factorizations
- On the Perturbation of LU, Cholesky, and QR Factorizations
- Least Squares Estimation of Discrete Linear Dynamic Systems Using Orthogonal Transformations
- Perturbation Analyses for the QR Factorization
- Perturbation Analyses for the Cholesky Downdating Problem
- New perturbation analyses for the Cholesky factorization
This page was built for publication: Sensitivity analyses for factorizations of sparse or structured matrices