Title :
Generalizing the continued fraction algorithm to arbitrary dimensions
Author_Institution :
FB Math., Frankfurt Univ., West Germany
fDate :
30 Oct-1 Nov 1989
Abstract :
A higher dimensional continued fraction algorithm (CFA) that produces diophantine approximations of more than linear goodness is given. The algorithm is also ideally convergent and detects integer relations
Keywords :
algorithm theory; continued fraction algorithm; convergent; diophantine approximations; integer relations; linear goodness; Arithmetic; Convergence; Costs; Jacobian matrices; Tires; Vectors; Zinc;
Conference_Titel :
Foundations of Computer Science, 1989., 30th Annual Symposium on
Conference_Location :
Research Triangle Park, NC
Print_ISBN :
0-8186-1982-1
DOI :
10.1109/SFCS.1989.63497
