Re: Recursion

*To*: mathgroup at smc.vnet.net*Subject*: [mg54958] Re: Recursion*From*: Paul Abbott <paul at physics.uwa.edu.au>*Date*: Tue, 8 Mar 2005 05:03:43 -0500 (EST)*Organization*: The University of Western Australia*References*: <d0guu7$7jn$1@smc.vnet.net>*Sender*: owner-wri-mathgroup at wolfram.com

In article <d0guu7$7jn$1 at smc.vnet.net>, Christopher Grinde <christopher.grinde at hive.no> wrote: > I am quite new to mathematica and need help to set up a recursion loop: > > > \!\(W\_0[T_] := \@\(\(\(12\ \[CurlyEpsilon]\_Si\)\/\(q\ a\)\) \(\(2\ > \(k\_B\) \ > T\)\/q\) Log[\(a\ W\_0[T]\)\/\(2\ n\_i[T]\)]\)\%3\) > > How do I make this a recursive function which i can supply a start value for > W0 and a limit for accuracy (W0[n]-W0[n+1]< some limit) There is no need to solve this recursively. If you cube both sides of the equation, you can solve directly for W0[T]. The solution involves ProductLog functions. Cheers, Paul -- Paul Abbott Phone: +61 8 6488 2734 School of Physics, M013 Fax: +61 8 6488 1014 The University of Western Australia (CRICOS Provider No 00126G) 35 Stirling Highway Crawley WA 6009 mailto:paul at physics.uwa.edu.au AUSTRALIA http://physics.uwa.edu.au/~paul