TheBestLinks.com
TheBestLinks.com
Fixed point (mathematics), Compilers, Cosine, Mathematics, Optimization... Print friendly version | Tell a friend
 
Navigation
Search
Toolbox

Fixed point (mathematics)

From TheBestLinks.com

See also fixed-point arithmetic.


In mathematics, a fixed point of a function is a point that is mapped to itself by the function. For example, if f is defined on the real numbers by

f(x) = x2 − 3x + 4,

then 2 is a fixed point of f, because f(2) = 2.

Not all functions have fixed points: for example, the function xx + 1 has no fixed point on the reals, since x is never equal to x+ 1 for any real number. In graphical terms, a fixed point means the point (x, f(x)) is on the line y = x, or in other words the graph of f has a point in common with that line. The example is a case where the graph and the line are a pair of parallel lines.

Table of contents

Attractive fixed points

An attractive fixed point of a function f is a fixed point x0 of f such that for any value of x in the domain that is close enough to x0, the sequence

<math>x,\ f(x),\ f(f(x)),\ f(f(f(x))), \dots<math>

converges to x0. How close is "close enough" is sometimes a subtle question.

The natural cosine function ("natural" means in radians, not degrees or other units) has exactly one fixed point, which is attractive. In this case "close enough" is not a stringent criterion at all - to demonstrate this, start with any real number and repeatedly press the cos key on a calculator. It quickly converges to about 0.73908513, the fixed point. That's where the graph of the cosine function intersects the line y = x, and this is no coincidence.

Not all fixed points are attractive: for example, x=0 is a fixed point of the function x -> x²+x, but iteration of this function for any value other than zero rapidly diverges.

Attractive fixed points are a special case of a wider mathematical concept of attractors.

Theorems guaranteeing fixed points

There are numerous theorems in different parts of mathematics that guarantee that functions, under certain circumstances, must have one or more fixed points. These are amongst the most basic qualitative results available: such fixed-point theorems that apply in generality are very valuable insights.

Applications

In compilers, fixed point computations are used for whole program analysis, which is often required to do code optimization. Fixed point is also used in finding PageRank of a webpage.

See also

fr:Point fixe

Related links


Top visited 0 of 0 links

[no links posted yet]

>> place link >>

Discussion

Last posted 0 of 0 messages

[no messages posted yet]

>> post message >>

Watch

You can add this article to your own "watchlist" and receive e-mail notification about all changes in this page.
 
   
Innovate it
This page was last modified 19:00, 23 Sep 2004.
  Content is available under GNU Free Documentation License 1.2.
Powered by MediaWiki