Paper
18 September 2007 Numerical properties of the LLL method
Author Affiliations +
Abstract
The LLL algorithm is widely used to solve the integer least squares problems that arise in many engieering applications. As most practitioners did not understand how the LLL algorithm works, they avoided the issue by referring to the method as an integer Gram Schmidt approach (without explaining what they mean by this term). Luk and Tracy1 were first to describe the behavior of the LLL algorithm, and they presented a new numerical implementation that should be more robust than the original LLL scheme. In this paper, we compare the numerical properties of the two different LLL implementations.
© (2007) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Franklin T. Luk and Sanzheng Qiao "Numerical properties of the LLL method", Proc. SPIE 6697, Advanced Signal Processing Algorithms, Architectures, and Implementations XVII, 669703 (18 September 2007); https://doi.org/10.1117/12.740194
Lens.org Logo
CITATIONS
Cited by 1 scholarly publication.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Matrices

Condition numbers

Algorithms

Control systems

Cryptography

Global Positioning System

Mathematics

RELATED CONTENT

Pseudo-random generator based on Chinese Remainder Theorem
Proceedings of SPIE (September 03 2009)
Conditioning properties of the LLL algorithm
Proceedings of SPIE (September 02 2009)
Alternative To The SVD: Rank Revealing QR-Factorizations
Proceedings of SPIE (April 04 1986)
How bad are symmetric Pick matrices?
Proceedings of SPIE (November 13 2000)
Accurate fast Hankel matrix solver
Proceedings of SPIE (December 01 1991)

Back to Top