Improved Error Bounds for Underdetermined System Solvers

DOI10.1137/0614001MaRDI QIDQ4033810zbMATH OpenOpenAlexWikidataFDO

Authors Nicholas J. Higham, James Demmel

Publication date 16 May 1993

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

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

zbMATH Keywords

\(QR\) factorizationbackward errorcomponentwise error boundscondition numberiterative refinementminimum norm solutionrounding error analysisrow scalingseminormal equationsunderdetermined system

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Orthogonalization in numerical linear algebra (65F25) Roundoff error (65G50)

Recommendations

• Fast enclosure for solutions in underdetermined systems
• Improved componentwise verified error bounds for least squares problems and underdetermined linear systems
• Verified bounds for least squares problems and underdetermined linear systems
• Methods for solving underdetermined systems.
• Sharp 2-norm error bounds for LSQR and the conjugate gradient method

Cited in

(19)

• A new error-control for initial value solvers
• Iterative refinement enhances the stability of \(QR\) factorization methods for solving linear equations
• Improved error bounds for freezing solutions of linear boundary value problems
• Perturbation bound of singular linear systems
• Error estimates and Lipschitz constants for best approximation in continuous function spaces
• Enclosing Moore-Penrose inverses
• Improved componentwise verified error bounds for least squares problems and underdetermined linear systems
• Cancellable biometrics and annotations on biohash
• On perturbation bounds of Kronecker product linear systems and their level-2 condition numbers
• Tikhonov regularization and randomized GSVD
• Convergence of Rump's method for computing the Moore-Penrose inverse.
• On mixed and componentwise condition numbers for Moore–Penrose inverse and linear least squares problems
• Simple varieties for limited precision points
• On the estimation of numerical error bounds in linear algebra based on discrete stochastic arithmetic
• A novel partitioning method for accelerating the block Cimmino algorithm
• LNLQ: an iterative method for least-norm problems with an error minimization property
• Enhancing Block Cimmino for Sparse Linear Systems with Dense Columns via Schur Complement
• Fast enclosure for solutions in underdetermined systems
• Stable border bases for ideals of points

This page was built for publication: Improved Error Bounds for Underdetermined System Solvers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4033810)