Algorithmintro
Fixed-point iteration
Also called Picard iteration, successive substitution.
Iterate x_{k+1}=g(x_k) for a g whose fixed points are the roots.
Iterate x_{k+1}=g(x_k) for a g whose fixed points are the roots.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag KFHFSG Edit this page History Report an error