[ 1 post ] 
 Exercise [03.01] 
Author Message

Joined: 27 Apr 2009, 19:54
Posts: 26
Location: Munich, Germany
Post Exercise [03.01]
Since I found the numerical computations we are asked to do here rather annoying (calculating the approximation of order n doesnt help us anything in calculating the approximation of order n+1), I looked around a bit and found a recursion formula for continued fractions significantly simplifying these computations. Consequently, in my solution I first prove this recursion formula and then apply it to the numerical computations in question.

RR_03_01.pdf [53.65 KiB]
Downloaded 160 times
27 Jul 2010, 19:16
   [ 1 post ]