2
$\begingroup$

I wish to compute

$$ \frac{1}{1 + \frac{1^3}{1 + \frac{2^3}{1 + \frac{3^3}{1+\cdots} } } } $$ to high accuracy. To start, I tried computing $$ \frac{1}{1 + \frac{1^2}{1 + \frac{2^2}{1 + \frac{3^2}{1+\cdots} } } } $$ whose limit ($\ln(2)$) was known to Euler. Using the modified Lentz's method, I found that increasing the number of partial numerators used in the calculation by an order of gave me roughly one additional decimal digits, so (for example) computing this to an accuracy of 100 digits is completely intractable.

Is there a method to accelerate the convergence of these slowly convergent continued fractions?

$\endgroup$
  • $\begingroup$ Compensated addition might help. $\endgroup$ – Richard Jul 9 at 12:35
  • $\begingroup$ I would start with the techniques listed in the DLMF (dlmf.nist.gov/3.9), especially the ones implemented in mpmath.org/doc/current/calculus/sums_limits.html, but there isn't a guarantee that any of them will work. $\endgroup$ – Kirill Jul 9 at 13:35
  • 1
    $\begingroup$ @Richard: I'm using MPFR; but I think your suggestion would indeed be helpful at lower precisions. $\endgroup$ – user14717 Jul 9 at 16:49
  • $\begingroup$ Lentz-Thompson-Barnett converts the CF into a product, so @Richard's suggestion is not immediately applicable. Using Steed's method might work with that proposal, but be careful. $\endgroup$ – J. M. Jul 10 at 4:50
0
$\begingroup$

According to Theorem 4.7 in the 2016 Continued Fractions course notes by Gautam Gopal Krishnan, a continued fraction $a_0 + \frac{1}{a_1+}\frac{1}{a_2+}\ldots$ can be rewritten as a series:

$$a_0 + \sum_{n=1}^\infty \frac{(-1)^{n-1}}{q_n q_{n-1}}$$

where $q_n$ is given by Theorem 2.4 in the same notes as

\begin{eqnarray*} q_0 & = & 1 \\ q_1 & = & a_1 \\ q_n & = & a_n q_{n-1} + q_{n-2} \end{eqnarray*}

Maybe the series has better convergence properties in your case?

Disclaimer: I have not verified the theorem, so you should test it numerically to be sure! If I understand the notation by Krishnan correctly, the continued fratcion and the series are always identical if truncated at the same position $n$ (the theorem is stated only for finite continued fractions).

| cite | improve this answer | |
$\endgroup$
  • $\begingroup$ Isn't this only for simple continued fractions? Mine is a generalized continued fraction. $\endgroup$ – user14717 Jul 9 at 16:50
  • $\begingroup$ Oh yes. I did not notice that your denominator changes in each step, albeit it is not of the most generalized from. Did you search for a similar formula for non-simple continued fractions? If you find one, please let us know. $\endgroup$ – cdalitz Jul 9 at 17:30
  • 2
    $\begingroup$ @user and cdalitz: one can always perform an equivalence transformation such that your CF's partial numerators or partial denominators are unity; see e.g. Waadeland/Lorentzen, among other standard references. Having done that, you can now easily construct the Euler-Minding series described in this answer (see again Waadeland/Lorentzen), but it is my own experience that the resulting series is often not easily accelerated by usual methods like Shanks/Wynn or Levin. $\endgroup$ – J. M. Jul 10 at 4:48
  • $\begingroup$ (As an aside, I detest the term "generalized continued fraction", but it is quite unfortunately standard.) $\endgroup$ – J. M. Jul 10 at 4:52

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.