Greatest fixed point

Greatest fixed point

In mathematics, more specifically in order theory, the greatest fixed point (gfp or GFP) of a function is the fixed point which is greater than or equal to to all other fixed points, according to some partial order.

For example, the greatest fixed point of the real function

:"f"("x") = "x"2

is "x" = 1 with the usual order on the real numbers. Fixed-point theorems can yield algorithms for locating the greatest fixed point, although least fixed points are more commonly used. Greatest and least fixed points may have desirable properties that arbitrary fixed points do not have.


Wikimedia Foundation. 2010.

Игры ⚽ Нужна курсовая?

Look at other dictionaries:

  • Fixed point (mathematics) — Not to be confused with a stationary point where f (x) = 0. A function with three fixed points In mathematics, a fixed point (sometimes shortened to fixpoint, also known as an invariant point) of a function is a point[1] that is …   Wikipedia

  • Least fixed point — In order theory, a branch of mathematics, the least fixed point (lfp or LFP) of a function is the fixed point which is less than or equal to all other fixed points, according to some partial order. For example, the least fixed point of the real… …   Wikipedia

  • point — 1. SYN: punctum. 2. A sharp end or apex. 3. A slight projection. 4. A stage or condition reached, as the boiling p. 5. To become ready to open, said of an abscess or boil the wall of which is becoming thin and about to rupture. 6. In mathematics …   Medical dictionary

  • Wikipedia:Neutral point of view — Wikipedia:Point of view redirects here. For the essay on how to describe points of view, see Wikipedia:Describing points of view. To raise issues with specific articles, see the NPOV noticeboard. For advice on applying this policy, see the NPOV… …   Wikipedia

  • Knaster–Tarski theorem — In the mathematical areas of order and lattice theory, the Knaster–Tarski theorem, named after Bronisław Knaster and Alfred Tarski, states the following:: Let L be a complete lattice and let f : L → L be an order preserving function. Then the set …   Wikipedia

  • List of mathematics articles (G) — NOTOC G G₂ G delta space G networks Gδ set G structure G test G127 G2 manifold G2 structure Gabor atom Gabor filter Gabor transform Gabor Wigner transform Gabow s algorithm Gabriel graph Gabriel s Horn Gain graph Gain group Galerkin method… …   Wikipedia

  • Bisimulation — In theoretical computer science a bisimulation is a binary relation between state transition systems, associating systems which behave in the same way in the sense that one system simulates the other and vice versa.Intuitively two systems are… …   Wikipedia

  • Initial algebra — In mathematics, an initial algebra is an initial object in the category of F algebras for a given endofunctor F . The initiality provides a general framework for induction and recursion. For instance, consider the endofunctor 1+( ) on the… …   Wikipedia

  • F-algebra — In mathematics, specifically in category theory, an F algebra for an endofunctor :F : mathbf{C}longrightarrow mathbf{C} is an object A of mathbf{C} together with a mathbf{C} morphism :alpha : FA longrightarrow A. In this sense F algebras are dual …   Wikipedia

  • Modal μ-calculus — In theoretical computer science, the modal μ calculus (also μ calculus, but this can have a more general meaning) is an extension of propositional modal logic (with many modalities) by adding a least fixpoint operator μ and a greatest fixpoint… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”