MathGroup Archive 2005

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

Search the Archive

Re: Recursion

  • To: mathgroup at
  • Subject: [mg54958] Re: Recursion
  • From: Paul Abbott <paul at>
  • Date: Tue, 8 Mar 2005 05:03:43 -0500 (EST)
  • Organization: The University of Western Australia
  • References: <d0guu7$7jn$>
  • Sender: owner-wri-mathgroup at

In article <d0guu7$7jn$1 at>,
 Christopher Grinde <christopher.grinde at> 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.


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 

  • Prev by Date: Generating PDF figures with correct fonts in Mac OS X
  • Next by Date: Re: help browser cells inactive?
  • Previous by thread: Re: Recursion
  • Next by thread: Outputing a tabular function