Numerical analysis Basic notions and error analysis Concept
Backward error analysis
Summary
Backward error analysis studies a computed answer by asking for which nearby input it is the exact answer. The size of that input change is the backward error. The error of the answer, the forward error, is then bounded by about the condition number times the backward error. This splits the analysis into a property of the algorithm (small backward error, that is, numerical stability) and a property of the problem (its conditioning). It was developed and made systematic by James H. Wilkinson in his work on numerical linear algebra.
Where this leads
2 pages build on this one.
Further reading
About this page
| Tag | CMXHRNWY35 |
|---|---|
| URI | m2://CMXHRNWY35 |
| Kind | concept |
| Writing | W0 stub |
| MSC | 65G50, 65F35 |
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.