Questions about fixed-point iteration, a method for calculating fixed points of functions. For combinators used to encode recursion, use [fixpoint-combinators] instead. For fixed-point arithmetic, use [fixed-point] instead. For the fixedpoint engine of Z3, use [z3-fixedpoint] instead.
A fixed point of a function f(x) is a value c such that f(c) = c. In words, a function takes its fixed points to themselves. Fixed points can be computed by an iterative algorithm. Various numerical analysis problems can be expressed in terms of obtaining fixed points, one example being Newton's method for obtaining roots of an equation (see the newtons-method tag).
