Applications of the LLL Algorithm
Practical applications of lattice reduction: integer kernel and image computation, integer relation detection, recovering minimal polynomials from numerical approximations, and …
Every page in the KEVOS library tagged Linear Algebra & Lattices. 7 pages.
Practical applications of lattice reduction: integer kernel and image computation, integer relation detection, recovering minimal polynomials from numerical approximations, and …
The Gram-Schmidt procedure, the mu coefficients and their role in reduction conditions, the numerical instability of the classical algorithm, and exact integral alternatives.
Lattices as discrete subgroups, bases and unimodular change of basis, the Gram matrix and determinant, successive minima, and the correspondence with positive definite quadratic…
Exact Gaussian elimination, fraction-free elimination, determinant and characteristic polynomial algorithms, and kernel and image computation over fields and over ℤ.
Definition and uniqueness of the Hermite normal form, algorithms for computing it, entry explosion and its remedies, and its role as the representation of choice for modules and…
The LLL algorithm: reduction conditions, the swap-and-reduce loop, the potential function that proves polynomial termination, quality guarantees, and the deep-insertion and floa…
The Smith normal form, elementary divisors, the structure theorem for finitely generated abelian groups, and the application to class group structure determination.