1977
DOI: 10.1007/bf01932150
|View full text |Cite
|
Sign up to set email alerts
|

Iterative refinement implies numerical stability

Abstract: Abstract.Suppose that a method q~ computes an approximation of the exact solution of a linear system Ax=b with the relative error q, q < 1. We prove that if all computations are performed in floating point arithmetic fl and single precision, then q~ with iterative refinement is numerically stable and well-behaved whenever qHAll ItA-1LL is at most of order unity.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
50
0

Year Published

1983
1983
2022
2022

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 61 publications
(51 citation statements)
references
References 3 publications
1
50
0
Order By: Relevance
“…Corollaries 3.1 and 3.2 are standard normwise results in the literature [17], [18], [20], [22], [27]. They show that we do not lose anything by using our general analysis.…”
Section: If Uκ(a) Is Sufficiently Less Than 1 and If The Linear Systesupporting
confidence: 57%
See 1 more Smart Citation
“…Corollaries 3.1 and 3.2 are standard normwise results in the literature [17], [18], [20], [22], [27]. They show that we do not lose anything by using our general analysis.…”
Section: If Uκ(a) Is Sufficiently Less Than 1 and If The Linear Systesupporting
confidence: 57%
“…For many problems the backward error is a scaled residual norm, in which case we can use our results to bound the backward error. The idea of using iterative refinement to obtain a small backward error with a potentially unstable solution method has been investigated for linear systems by several authors, including Jankowski and Woźniakowski [18], Skeel [22], and Higham [17], and more recently for the algebraic Riccati equation by Ghavimi and Laub [11]. The idea does not seem to have been applied previously to the generalized eigenvalue problem.…”
mentioning
confidence: 99%
“…This does not appear to be due to errors in computing the single precision residual via Algorithm 2.3, but seems to indicate that in order to guarantee the success of iterative refinement in single precision a certain level of precision is required relative to the degree of instability (indeed this is implied by the results in [13]). …”
Section: 4)mentioning
confidence: 95%
“…Consider algorithms for solving a nonsingular, n × n linear system Ax = b, so m = n. There are many definitions of numerical stability in the literature, for example [5,6,9,12,16,22,36,48,57,61,70]. Definitions 1 and 2 below are taken from Bunch [17].…”
Section: Stability and Weak Stabilitymentioning
confidence: 99%
“…In practice this gives an accurate solution in a small number of iterations so long as the residual is computed accurately and the working precision is sufficient to ensure convergence. For details see [5,36,37,48,69,84].…”
Section: Iterative Refinementmentioning
confidence: 99%