Fixed-point iteration
Summary
Fixed-point iteration computes a solution of by applying again and again to a starting point. If the resulting sequence converges and is continuous, its limit is a fixed point of . The Banach fixed point theorem guarantees convergence for a contraction on a complete metric space. Many numerical methods, such as Newton's method, are fixed-point iterations.
Further reading
About this page
| Tag | K6ZF91051B |
|---|---|
| URI | m2://K6ZF91051B |
| Kind | concept |
| Writing | W0 stub |
| MSC | 47J25, 65H05, 40A05 |
| Same as | |
| Changed | 2 November 2026 |
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.