Abstract
This work introduces a new perturbation bound for the L factor of the LDU factorization of (row) diagonally dominant matrices computed via the column diagonal dominance pivoting strategy. This strategy yields L and U factors which are always well-conditioned and, so, the LDU factorization is guaranteed to be a rank-revealing decomposition. The new bound together with those for the D and U factors in [F. M. Dopico and P. Koev, Numer. Math., 119(2011), pp. 337-371] establish that if diagonally dominant matrices are parameterized via their diagonally dominant parts and off-diagonal entries, then tiny relative componentwise perturbations of these parameters produce tiny relative normwise variations of L and U and tiny relative entrywise variations of D when column diagonal dominance pivoting is used. These results will allow us to prove in a follow-up work that such perturbations also lead to strong perturbation bounds for many other problems involving diagonally dominant matrices.
| Original language | English |
|---|---|
| Pages (from-to) | 904-930 |
| Number of pages | 27 |
| Journal | SIAM Journal on Matrix Analysis and Applications |
| Volume | 35 |
| Issue number | 3 |
| DOIs | |
| State | Published - 2014 |
Bibliographical note
Publisher Copyright:© 2014 Society for Industrial and Applied Mathematics.
Funding
| Funders | Funder number |
|---|---|
| National Stroke Foundation | DMS-1318633 |
| National Science Foundation Arctic Social Science Program | 1318633 |
Keywords
- Accurate computations
- Column diagonal dominance pivoting
- Diagonally dominant matrices
- Diagonally dominant parts
- LDU factorization
- Rank-revealing decomposition
- Relative perturbation theory
ASJC Scopus subject areas
- Analysis
Fingerprint
Dive into the research topics of 'A new perturbation bound for the LDU factorization of diagonally do minant matrices'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver