Condition-sensitive computation of approximate fixed points (Q1311391)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Condition-sensitive computation of approximate fixed points |
scientific article; zbMATH DE number 484759
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Condition-sensitive computation of approximate fixed points |
scientific article; zbMATH DE number 484759 |
Statements
Condition-sensitive computation of approximate fixed points (English)
0 references
23 January 1994
0 references
Let \(f\) be a map from a cube in \(n\)-space into itself. Given \(p\), a point with \(\| f(x) - x\| \leq 2^{-p}\) is to be determined. Two algorithms are presented and their complexity is discussed. The first algorithm requires the evaluation of \(f\) on the points of a grid with meshsize \(h\).
0 references
fixed points
0 references
algorithms
0 references
complexity
0 references
