Math 2.0

Numerical analysis Definition

Backward error analysis

Builds on Condition numberNorm

Definition

Let XX and YY be normed spaces with norms ∥⋅∥\norm{\cdot}, and let f ⁣:X→Yf \colon X \to Y be a problem. Let x∈Xx \in X with x≠0x \ne 0, and let y^∈Y\hat y \in Y be a computed approximation of y=f(x)y = f(x).

  1. The forward error of y^\hat y is ∥y^−y∥\norm{\hat y - y}, and its relative forward error is ∥y^−y∥/∥y∥\norm{\hat y - y}/\norm{y} when y≠0y \ne 0.
  2. The relative backward error of y^\hat y is η(y^)=inf⁡{∥Δx∥∥x∥:f(x+Δx)=y^},\eta(\hat y) = \inf \set{ \frac{\norm{\Delta x}}{\norm{x}} : f(x + \Delta x) = \hat y }, with η(y^)=∞\eta(\hat y) = \infty when no such Δx\Delta x exists.
  3. Backward error analysis of an algorithm is a bound on η(y^)\eta(\hat y) for its computed outputs y^\hat y, usually by a modest multiple of the unit roundoff.

Remarks

Example: in floating-point arithmetic the computed sum is s^=fl(a+b)=(a+b)(1+δ)\hat s = \mathrm{fl}(a + b) = (a + b)(1 + \delta) with ∣δ∣≤u\abs{\delta} \le u. It equals the exact sum of a(1+δ)a(1 + \delta) and b(1+δ)b(1 + \delta). So for the problem (a,b)↦a+b(a, b) \mapsto a + b with the max norm, the relative backward error is at most uu. Non-example: a bound on ∥y^−y∥\norm{\hat y - y} alone, with no statement about a perturbed input, is a forward error analysis. If ff is differentiable with relative condition number κ\kappa at xx, then to first order the relative forward error is at most κ η(y^)\kappa \, \eta(\hat y). Componentwise backward errors, which bound each ∣Δxi∣/∣xi∣\abs{\Delta x_i}/\abs{x_i} 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
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Condition number concept
  2. Norm concept
  3. Backward error analysis definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Error_analysis_(mathematics)
About this page
TagA2W5SNSC05
URIm2://A2W5SNSC05
Kinddefinition
WritingW0 stub
MSC65G50, 65F35
DefinesBackward error analysis
UsesCondition 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.