MathGroup Archive 2000

[Date Index] [Thread Index] [Author Index]

Search the Archive

Re: FixedPoint vs. FixedPointList

  • To: mathgroup at
  • Subject: [mg24431] Re: [mg24384] FixedPoint vs. FixedPointList
  • From: Andrzej Kozlowski <andrzej at>
  • Date: Tue, 18 Jul 2000 00:58:29 -0400 (EDT)
  • Sender: owner-wri-mathgroup at

Here is one (very standard) way illustrated with the well known example of
the function whose FixedPoint gives an approximate value of Sqrt[2]:

sq[x_] := (x + 2/x)/2

index = 0

FixedPoint[(index++; sq[#]) &, 1.]



Andrzej Kozlowski
Toyama International University, JAPAN

For Mathematica related links and resources try:

on 7/13/00 12:13 PM, Otto Linsuain at linsuain+ at wrote:

> Hi all. I need to know the fixed point of a function (to a certain
> accuracy) starting from a certain value of the arguement, say:
> x = FixedPoint[ f, x, SameTest -> ( #2-#1 < somesmallnumber &) ]
> I do not care about the intermediate results, but I would like to know
> how many iterations it takes for the process to converge. FixedPointList
> will do, for example:
> {n,x}={Length[#],Last[#]}& @ FixedPointList[....]
> However I believe this would cause problems. The reason is that x is
> really a very long list (FixedPoint works for lists too), and it could
> take many iterations for this to settle. Mathematica, I believe, stores
> only a maximum of two values at any given moment when executing
> FixedPoint, but it stores all intermediate values for FixedPointList,
> and most certainly would run out of memory.
> Could any think of how to trick Mathematica to count the iteration
> without trying to store all the results?
> Any suggestions would be greatly appreciated. Otto Linsuain.

  • Prev by Date: Re: Integrate[(1 - Exp[-kel*t]), {t, 0, Infinity]?=-1/kel
  • Next by Date: Re: List of patterns for which a function is defined?
  • Previous by thread: Re: FixedPoint vs. FixedPointList
  • Next by thread: Re: FixedPoint vs. FixedPointList