Continued fraction/Arithmetic: Difference between revisions

From Rosetta Code
Content added Content deleted
(add references)
mNo edit summary
Line 13: Line 13:
My description follows [http://perl.plover.com/yak/cftalk/INFO/gosper.txt part of Glover reproduced on perl.plover.com]. This document is text and unnumbered, you may wish to start by searching for "Addition, Multiplication, etc. of Two Continued Fractions" prior to reading the whole thing.
My description follows [http://perl.plover.com/yak/cftalk/INFO/gosper.txt part of Glover reproduced on perl.plover.com]. This document is text and unnumbered, you may wish to start by searching for "Addition, Multiplication, etc. of Two Continued Fractions" prior to reading the whole thing.


[http://perl.plover.com/classes/cftalk/TALK/slide001.html perl.plover.com] also includes a series of slides as a class on continued fractions. The example [1;5,2] + 1/2 in [[Continued fraction arithmetic/G(matrix NG, Contined Fraction N) | G(matrix_NG,_Contined_Fraction_N)]] is worked through in this class.
[http://perl.plover.com/classes/cftalk/TALK/slide001.html perl.plover.com] also includes a series of slides as a class on continued fractions. The example [1;5,2] + 1/2 in [[Continued fraction arithmetic/G(matrix NG, Contined Fraction N) | G(matrix NG, Contined Fraction_N)]] is worked through in this class.




Line 66: Line 66:
:So I can define arithmetic as operations on this matrix which make a<sub>12</sub>, a<sub>1</sub>, a<sub>2</sub>, b<sub>12</sub>, b<sub>1</sub>, b<sub>2</sub> zero and read the answer from a and b. This is more interesting when N<sub>1</sub> and N<sub>2</sub> are continued fractions, which is the subject of the following tasks.
:So I can define arithmetic as operations on this matrix which make a<sub>12</sub>, a<sub>1</sub>, a<sub>2</sub>, b<sub>12</sub>, b<sub>1</sub>, b<sub>2</sub> zero and read the answer from a and b. This is more interesting when N<sub>1</sub> and N<sub>2</sub> are continued fractions, which is the subject of the following tasks.


==[[Continued fraction arithmetic/G(matrix NG, Contined Fraction N) | G(matrix_NG,_Contined_Fraction_N)]]==
==[[Continued fraction arithmetic/G(matrix NG, Contined Fraction N) | G(matrix NG, Contined Fraction N)]]==
* The complete solution G(matrix NG, Continued Fraction N<sub>1</sub>, Continued Fraction N<sub>2</sub>)
* The complete solution G(matrix NG, Continued Fraction N<sub>1</sub>, Continued Fraction N<sub>2</sub>)
* Compare two continued fractions
* Compare two continued fractions

Revision as of 12:24, 7 February 2013

By popular demand, see Talk:Continued fraction#creating_a_continued_fraction and Talk:Continued fraction#Arithmetics.3F.3F, or be careful what you ask for.

This page is a placeholder for several subtasks which will eventually implement a function:

G(matrix NG, Continued Fraction N1, Continued Fraction N2)

which will perform basic mathmatical operations on continued fractions.

{http://mathworld.wolfram.com/ContinuedFraction.html Mathworld] informs me:

Gosper has invented an algorithm for performing analytic addition, subtraction, multiplication, and division using continued fractions. It requires keeping track of eight integers which are conceptually arranged at the polyhedron vertices of a cube. Although this algorithm has not appeared in print, similar algorithms have been constructed by Vuillemin (1987) and Liardet and Stambul (1998).
Gosper's algorithm for computing the continued fraction for (ax+b)/(cx+d) from the continued fraction for x is described by Gosper (1972), Knuth (1998, Exercise 4.5.3.15, pp. 360 and 601), and Fowler (1999). (In line 9 of Knuth's solution, X_k<-|_A/C_| should be replaced by X_k<-min(|_A/C_|,|_(A+B)/(C+D)_|).) Gosper (1972) and Knuth (1981) also mention the bivariate case (axy+bx+cy+d)/(Axy+Bx+Cy+D).


My description follows part of Glover reproduced on perl.plover.com. This document is text and unnumbered, you may wish to start by searching for "Addition, Multiplication, etc. of Two Continued Fractions" prior to reading the whole thing.

perl.plover.com also includes a series of slides as a class on continued fractions. The example [1;5,2] + 1/2 in G(matrix NG, Contined Fraction_N) is worked through in this class.


For these tasks continued fractions will be of the form:

so each may be described by the notation []

Continued fraction arithmetic/Continued fraction r2cf(Rational N)

During these tasks I shall use the function described in this task to create continued fractions from rational numbers.

Matrix NG

Consider a matrix NG:

and a function G(matrix NG, Number N1, Number N2) which returns:

Convince yourself that NG = :
adds N1 to N2
subtracts N2 from N1
multiplies N1 by N2
divides N1 by N2
calculates (3*N1 + 4) * (7*N2 - 5)
Note that with N1 = 22, N2 = 7, and NG = :
I could define the solution to be N1 = 1, N2 = 1 and NG = :
So I can define arithmetic as operations on this matrix which make a12, a1, a2, b12, b1, b2 zero and read the answer from a and b. This is more interesting when N1 and N2 are continued fractions, which is the subject of the following tasks.

G(matrix NG, Contined Fraction N)

  • The complete solution G(matrix NG, Continued Fraction N1, Continued Fraction N2)
  • Compare two continued fractions
  • Sqrt of a continued fraction