A New Perturbation Bound for the LDU Factorization of Diagonally Dominant Matrices

DOI10.1137/13093858XzbMath1306.65179OpenAlexW2061521346MaRDI QIDQ2936579

Megan Dailey, Froilán M. Dopico, Qiang Ye

Publication date: 17 December 2014

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/13093858x

zbMATH Keywords

iteration methodaccurate computationsdiagonally dominant matricesLDU factorizationrelative perturbation theorycolumn diagonal dominance pivotingdiagonally dominant partsrank-revealing decomposition

Mathematics Subject Classification ID

Factorization of matrices (15A23) Iterative numerical methods for linear systems (65F10) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (10)

Self-corrective iterations (SCI) for generalized diagonally dominant matrices ⋮ Accurate eigenvalues of some generalized sign regular matrices via relatively robust representations ⋮ On the sensitivity of generators for the QR factorization of quasiseparable matrices with total nonpositivity ⋮ Accurate inverses for computing eigenvalues of extremely ill-conditioned matrices and differential operators ⋮ Accurate computations for eigenvalues of products of Cauchy-polynomial-Vandermonde matrices ⋮ Computing singular value decompositions of parameterized matrices with total nonpositivity to high relative accuracy ⋮ Structured condition numbers and statistical condition estimation for the \(LDU\) factorization ⋮ Accurate singular values of a class of parameterized negative matrices ⋮ Improved rigorous perturbation bounds for the LU and QR factorizations ⋮ Relative Perturbation Analysis for Eigenvalues and Singular Values of Totally Nonpositive Matrices

This page was built for publication: A New Perturbation Bound for the LDU Factorization of Diagonally Dominant Matrices