Services & Resources / Wolfram Forums
-----
 /
MathGroup Archive
2006
*January
*February
*March
*April
*May
*June
*July
*August
*September
*October
*November
*December
*Archive Index
*Ask about this page
*Print this page
*Give us feedback
*Sign up for the Wolfram Insider

MathGroup Archive 2006

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

Search the Archive

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
  • Next by Date: Re: Beginner--[Please Help]How to get coefficient list issued from a Series Command
  • Previous by thread: Re: FoourierTransform of a function defined in sections
  • Next by thread: Re: Need algorithm to convert general continued fraction to simple continued fraction