The Accuracy of Solutions to Triangular Systems
From MaRDI portal
Publication:4733301
DOI10.1137/0726070zbMath0683.65029OpenAlexW2125212434WikidataQ56999048 ScholiaQ56999048MaRDI QIDQ4733301
Publication date: 1989
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0726070
sensitivitycondition numberrounding errorstriangular systemdiagonal scalingCholesky with pivotingQR with column pivoting
Roundoff error (65G50) Numerical computation of matrix norms, conditioning, scaling (65F35) Direct numerical methods for linear systems and matrix inversion (65F05) Conditioning of matrices (15A12)
Related Items (12)
Solution of augmented linear systems using orthogonal factorizations ⋮ Perturbation and error analyses for block downdating of a Cholesky decomposition ⋮ Stable algorithm for updating denseLUfactorization after row or column exchange and row and column addition or deletion ⋮ Perturbation and error analyses of the partitioned \textit{LU} factorization for block tridiagonal linear systems ⋮ Gaussian elimination: When is scaling beneficial! ⋮ A geometric analysis of Gaussian elimination. II ⋮ Probabilistic analyses of condition numbers ⋮ Rounding error bounds for the Clenshaw and Forsythe algorithms for the evaluation of orthogonal polynomial series ⋮ Simulating Low Precision Floating-Point Arithmetic ⋮ Compact cubic splines ⋮ Newton interpolation using \(\Re \)-Leja sequences ⋮ Scaled pivoting in Gauss and Neville elimination for totally positive systems
Uses Software
This page was built for publication: The Accuracy of Solutions to Triangular Systems
