CoChat

Improved Error Bounds for Underdetermined System Solvers

Demmel, James W., Higham, Nicholas J. · 1993 · SIAM Journal on Matrix Analysis and Applications
Cited by 50

The DOI matches its Crossref record.

Abstract

The minimal 2-norm solution to an underdetermined system $Ax = b$ of full rank can be computed using a QR factorization of $A^T $ in two different ways. One method requires storage and reuse of the orthogonal matrix Q, while the method of seminormal equations does not. Existing error analyses show that both methods produce computed solutions whose normwise relative error is bounded to first order by $c\kappa_2 ( A )u$, where c is a constant depending on the dimensions of A, $\kappa_2 ( A ) = \| A^ + \|_2 \| A \|_2 $ is the 2-norm condition number, and u is the unit roundoff. It is shown that these error bounds can be strengthened by replacing $\kappa_2(A)$ by the potentially much smaller quantity ${\operatorname{cond}}_2 ( A ) = \| \,| A^ + | \cdot | A |\, \|_2 $, which is invariant under row scaling of A. It is also shown that ${\operatorname{cond}}_2 ( A )$ reflects the sensitivity of the minimum norm solution x to row-wise relative perturbations in the data A and b. For square linear systems $Ax = b$ row equilibration is shown to endow solution methods based on LU or QR factorization of A with relative error bounds proportional to ${\operatorname{cond}}_\infty ( A )$, just as when a QR factorization of $A^T $ is used. The advantages of using fixed precision iterative refinement in this context instead of row equilibration are explained.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1137/0614001

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cited by

See all 50

Metadata

Authors
Demmel, J. W., & Higham, N. J.
Venue
SIAM Journal on Matrix Analysis and Applications
Published
1993-01
Volume
14
Issue
1
Pages
1-14
ISSN
  • 0895-4798 (ISSN-L)
  • 1095-7162
OpenAlex
W2066008381
Cited by
50
References
0
FWCI
1.51
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Improved Error Bounds for Underdetermined System Solvers. https://app.cochat.ai/papers/10.1137/0614001
The paper
Demmel, J. W., & Higham, N. J. (1993). Improved Error Bounds for Underdetermined System Solvers. SIAM Journal on Matrix Analysis and Applications. https://doi.org/10.1137/0614001

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.