Calculation of Minkowski-reduced lattice bases (Q762199): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 02:09, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Calculation of Minkowski-reduced lattice bases |
scientific article |
Statements
Calculation of Minkowski-reduced lattice bases (English)
0 references
1985
0 references
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.
0 references
lattice structure
0 references
reduction of quadratic forms
0 references
random number generation
0 references
computational number theory
0 references
Minkowski-reduced lattice bases
0 references
algorithm
0 references
greater dimensions
0 references
Cholesky's method
0 references
