Backward error analysis
Builds on Condition numberNorm
Definition
Let and be normed spaces with norms , and let be a problem. Let with , and let be a computed approximation of .
- The forward error of is , and its relative forward error is when .
- The relative backward error of is with when no such exists.
- Backward error analysis of an algorithm is a bound on for its computed outputs , usually by a modest multiple of the unit roundoff.
Remarks
Example: in floating-point arithmetic the computed sum is with . It equals the exact sum of and . So for the problem with the max norm, the relative backward error is at most . Non-example: a bound on alone, with no statement about a perturbed input, is a forward error analysis. If is differentiable with relative condition number at , then to first order the relative forward error is at most . Componentwise backward errors, which bound each separately, are also common.
Reading path
To understand this page from the ground up, read these 3 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Condition number concept
- Norm concept
- Backward error analysis definition
Further reading
About this page
| Tag | A2W5SNSC05 |
|---|---|
| URI | m2://A2W5SNSC05 |
| Kind | definition |
| Writing | W0 stub |
| MSC | 65G50, 65F35 |
| Defines | Backward error analysis |
| Uses | Condition number, Norm |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.