Mathematica 9 is now available
Services & Resources / Wolfram Forums
-----
 /
MathGroup Archive
2000
*January
*February
*March
*April
*May
*June
*July
*August
*September
*October
*November
*December
*Archive Index
*Ask about this page
*Print this page
*Give us feedback
*Sign up for the Wolfram Insider

MathGroup Archive 2000

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

Search the Archive

FixedPoint vs. FixedPointList

  • To: mathgroup at smc.vnet.net
  • Subject: [mg24384] FixedPoint vs. FixedPointList
  • From: Otto Linsuain <linsuain+ at andrew.cmu.edu>
  • Date: Wed, 12 Jul 2000 23:13:24 -0400 (EDT)
  • Sender: owner-wri-mathgroup at wolfram.com

 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: A strange bug in Solve
  • Next by Date: fade to mauve
  • Previous by thread: List of symbols
  • Next by thread: RE: FixedPoint vs. FixedPointList