Need algorithm to convert general continued fraction to simple continued fraction

• To: mathgroup at smc.vnet.net
• Subject: [mg70171] Need algorithm to convert general continued fraction to simple continued fraction
• From: "Diana" <diana.mecum at gmail.com>
• Date: Fri, 6 Oct 2006 01:58:46 -0400 (EDT)

```Math folks,

I have a general continued fraction, the partial quotients of which are
comprised of arbitrary polynomials in t. These arbitrary polynomials do
not repeat in a regular fashion, but I have the continued fraction
expansion available to any desired length.

I would like to know if there is an alogrithm which I could use, and
then code with Mathematica, which would allow me to convert this
fraction to a simple continued fraction.

In other words, I would like to replace a non-zero a_0 term with 0.

So, is there a way to convert:

[{1/(t^2+t+1), t^4-t, t^2-t, t^4-t, ...}] (These polynomials in t are
arbitrary but known.)

to:

[{0, ...}]?

```

• Prev by Date: Re: Algorithm in NDSolve and FindMinimum