On the Existence and Computation of LU-Factorizations with Small Pivots

DOI10.2307/2007600zbMath0574.65018OpenAlexW190616055WikidataQ57397479 ScholiaQ57397479MaRDI QIDQ3692695

Tony F. Chan

Publication date: 1984

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2007600

zbMATH Keywords

Gaussian eliminationLU-factorizationpivoting strategysingular matrixsmall pivots

Mathematics Subject Classification ID

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

Related Items (9)

Strong rank revealing LU factorizations ⋮ Improved bound for rank revealing LU factorizations ⋮ Adaptive continuation algorithms with application to combustion problems ⋮ Block elimination with one refinement solves bordered linear systems accurately ⋮ Structural instability analyses based on generalised path-following ⋮ Rank revealing \(LU\) factorizations ⋮ Rang revealing QR factorizations ⋮ On the existence and computation of rank-revealing LU factorizations ⋮ On the condition of nearly singular matrices under rank-1 perturbations

This page was built for publication: On the Existence and Computation of LU-Factorizations with Small Pivots