Article

Finding Best Simultaneous Diophantine Approximations Using Sequences Of Minimal Sets Of Lattice Points

Authors:
To read the full-text of this research, you can request a copy directly from the authors.

Abstract

. A theory is presented for simultaneousDiophantineapproximation by means of minimal sets of lattice points, defined in a certain sense. We show that successive minima can be used to find best simultaneous Diophantine approximations. We construct algorithms for producing these minima, and consequently best approximations, for lattices of the second degree and for lattices of the third degree. The latter algorithm is demonstrated with some numerical examples. 1. Introduction. This paper presents a theory regarding certain types of minimal sets of lattice points which are employed to produce algorithms for finding best simultaneous Diophantine approximations in a sense to be made precise. The definition of simultaneous Diophantine approximation we shall use is similar to that proposed by Lagarias [7], which is a generalisation of the more classical definitions, of which those given in [2] and [6] are examples. From this definition we produce a theory of (ae; h)-minimal sets of lattice p...

No full-text available

Request Full-text Paper PDF

To read the full-text of this research,
you can request a copy directly from the authors.

ResearchGate has not been able to resolve any citations for this publication.
Article
Full-text available
A description is given of a modified version of Voronoi's algorithm for obtaining the regulator of a pure cubic field \mathcal{Q}(\sqrt[3]{D}).Thisnewalgorithmhastheadvantageofexecutingrelativelyrapidlyforlargevaluesof. This new algorithm has the advantage of executing relatively rapidly for large values of D.Italsoeliminatesacomputationalproblemwhichoccursinalmostallalgorithmsforfindingunitsinalgebraicnumberfields.Thisistheproblemofperformingcalculationsinvolvingalgebraicirrationalsbyusingonlyapproximationsofthesenumbers.Thealgorithmwasimplementedonacomputerandrunonallvaluesof. It also eliminates a computational problem which occurs in almost all algorithms for finding units in algebraic number fields. This is the problem of performing calculations involving algebraic irrationals by using only approximations of these numbers. The algorithm was implemented on a computer and run on all values of D (\leqslant 10^5)suchthattheclassnumberof such that the class number of \mathcal{Q}(\sqrt[3]{D})$ is not divisible by 3. Several tables summarizing the results of this computation are also presented.
Article
Full-text available
We define the notion of a best Diophantine approximation vector to a set of linear forms. This generalizes definitions of a best approximation vector to a single linear form and of a best simultaneous Diophantine approximation vector. We derive necessary and sufficient conditions for the existence of an infinite set of best Diophantine approximation vectors. Finally, we prove that such approximation vectors are spaced far apart in an appropriate sense.
Article
Full-text available
In this paper we present an algorithm for finding successive best approximations of a line by lattice points in three dimensions. Our algorithm is primarily an extension of the work of Furtwangler [13], which has been generalised for arbitrary radius functions, lattices and initial bases. We show that, after a finite number of initialisation iterations, the algorithm will produce all best approximations to the line above a certain height. Conversely, we show that, after initialisation, all convergents of the algorithm are best approximations (with one possible exception). We also provide a numerical example to illustrate the algorithm. 1 Introduction The best approximation of a line by lattice points is a problem of fundamental interest in the design of algorithms. The problem is one of finding those lattice points which lie successively closer to the given line as we move along the line away from the origin. That is, given an M-dimensional latticeOmegaGamma defined (though not un...
Book
I Minkowski's Two Theorems.- Lecture I.- Lecture II.- Lecture III.- Lecture IV.- II Linear Inequalities.- Lecture V.- Lecture VI.- Lecture VII.- Lecture VIII.- Lecture IX.- III Theory of Reduction.- Lecture X.- Lecture XI.- Lecture XII.- Lecture XIII.- Lecture XIV.- Lecture XV.- References.
Australia E-mail address: Vaughan.Clarkson@dsto.defence.gov
  • P O Box
Electronic Warfare Division, Defence Science & Technology Organisation, P.O. Box 1500, Salisbury, South Australia, 5108, Australia E-mail address: Vaughan.Clarkson@dsto.defence.gov.au Department of Engineering, Faculty of Engineering and Information Technology, The Australian National University, Canberra, ACT, 0200, Australia E-mail address: Iven.Mareesl@anu.edu.au
G en eralisation de la th eorie des fractions continues
  • Hermann Minkowski
Hermann Minkowski, G en eralisation de la th eorie des fractions continues, Ann. Sci. Ec. Norm. Sup er., ser. III 13 (1896), 41{60.
Number theoretic solutions to intercept time problems
, Number theoretic solutions to intercept time problems, IEEE Trans. Inform. Theory 42 (1996), no. 3, To appear.