Fixed-point iteration
id:
fixed-point-iteration-181-13851952
title:
Fixed-point iteration
text:
In numerical analysis, fixed-point iteration is a method of computing fixed points of a function. More specifically, given a function f defined on the real numbers with real values and given a point x 0 in the domain of f, the fixed-point iteration is x n + 1 = f, n = 0, 1, 2, … which gives rise to the sequence x 0, x 1, x 2, … of iterated function applications x 0, f, f, … which is hoped to converge to a point x fix. If f is continuous, then one can prove that the obtained x fix is a fixed poin
brand slug:
wiki
category slug:
encyclopedia
description:
Root-finding algorithm
original url:
https://en.wikipedia.org/wiki/Fixed-point_iteration
date created:
2006-10-08T00:54:07Z
date modified:
2024-09-06T13:33:23Z
main entity:
{"identifier":"Q1030759","url":"https://www.wikidata.org/entity/Q1030759"}
image:
fields total:
13
integrity:
15