Jump to content

Fixed-point iteration

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Jtir (talk | contribs) at 00:54, 8 October 2006 (new article). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

In numerical analysis, fixed point iteration is a class of algorithms for solving non-linear equations numerically.