| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4603094 | Linear Algebra and its Applications | 2008 | 12 Pages |
Abstract
The LLL algorithm has received a lot of attention as an effective numerical tool for preconditioning an integer least squares problem. However, the workings of the algorithm are not well understood. In this paper, we present a new way to look at the LLL reduction, which leads to a new implementation method that performs better than the original LLL scheme.
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
