Calculation of Minkowski-reduced lattice bases (Q762199): Difference between revisions

Up to now there has been an algorithm for the calculation of Minkowski- reduced lattice bases to dimension \(n=6\) or at most \(n=7\). Thereby a finite (large) number of conditions has to be checked. A new algorithm is presented which is practicable for greater dimensions and requires less computation time. In this algorithm first a minimization is done with the help of real minima. For a final search Cholesky's method is used for the partition of the appearing positive definite matrix.