Revision as of 23:05, 16 July 2024 edit McYeee (talk \| contribs) Extended confirmed users 1,050 edits Find-and-replace to introduce <math> tags ← Previous edit		Revision as of 02:04, 22 July 2024 edit undo David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,616 edits we do not need page numbers for a book whose entire topic is the topic of this article and which is cited as a general reference on the topic rather than on any specific claim Next edit →
Line 2: {{Short description\|Computing the fixed point of a function}} '''Fixed-point computation''' refers to the process of computing an exact or approximate [[Fixed point (mathematics)\|fixed point]] of a given function.<ref name=":1">{{cite book \|doi=10.1007/978-3-642-50327-6 \|title=The Computation of Fixed Points and Applications \|series=Lecture Notes in Economics and Mathematical Systems \|year=1976 \|volume=124 \|isbn=978-3-540-07685-8 ~~}}{{page needed\|date=April 2023~~}}</ref> In its most common form, the given function <math>f</math> satisfies the condition to the [[Brouwer fixed-point theorem]]: that is, <math>f</math> is continuous and maps the unit [[N-cube\|''d''-cube]] to itself. The [[Brouwer fixed-point theorem]] guarantees that <math>f</math> has a fixed point, but the proof is not constructive. Various algorithms have been devised for computing an approximate fixed point. Such algorithms are used in economics for computing a [[market equilibrium]], in [[game theory]] for computing a [[Nash equilibrium]], and in [[dynamic system]] analysis. == Definitions ==

Fixed-point computation: Difference between revisions