Perturbation bounds for triangular and full rank factorizations
From MaRDI portal
Publication:815231
DOI10.1016/j.camwa.2005.08.008zbMath1087.65023OpenAlexW2032622974WikidataQ114201612 ScholiaQ114201612MaRDI QIDQ815231
Publication date: 16 February 2006
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2005.08.008
LU factorizationperturbation boundsrank reductionLDU factorizationstriangular and full rank factorizations
Related Items
The rank reduction procedure of Egerváry ⋮ Mixed and componentwise condition numbers for matrix decompositions ⋮ Perturbation bounds for triangular and full rank factorizations
Cites Work
- Unnamed Item
- On rank-diminishing operations and their applications to the solution of linear equations
- Perturbation bounds for the Cholesky and QR factorizations
- Perturbation bounds for the \(LDL^ H\) and LU decompositions
- Perturbation bounds for triangular and full rank factorizations
- Sensitivity analyses for factorizations of sparse or structured matrices
- Rounding-error and perturbation bounds for the Cholesky and \(LDL^ T\) factorizations
- Componentwise perturbation bounds for some matrix decompositions
- On the sensitivity of the LU factorization
- Matrix factorizations and their perturbations
- Matricial norms
- Rank reduction, factorization and conjugation
- On the perturbation of LU and Cholesky factors
- On the Perturbation of LU, Cholesky, and QR Factorizations
- On the Perturbation of the Cholesky Factorization
- Perturbations of Triangular Matrix Factorizations
- A Rank–One Reduction Formula and Its Applications to Matrix Factorizations
- New perturbation analyses for the Cholesky factorization
