26564 articles – 20396 Notices  [english version]
Fiche détaillée Articles dans des revues avec comité de lecture
Mathematics of Computation 81, 279 (2012) 1487-1511
Versions disponibles :
Liste des fichiers attachés à ce document : 
PDF
qrperturb2011.pdf(316.1 KB)
Perturbation Analysis of the QR Factor R in the Context of LLL Lattice Basis Reduction
Xiao-Wen Chang1, Damien Stehlé2, 3, Gilles Villard2, 3

In 1982, Arjen Lenstra, Hendrik Lenstra Jr. and László Lovász introduced an efficiently computable notion of reduction of basis of a Euclidean lattice that is now commonly referred to as LLL-reduction. The precise definition involves the R-factor of the QR factorisation of the basis matrix. A natural mean of speeding up the LLL reduction algorithm is to use a (floating-point) approximation to the R-factor. In the present article, we investigate the accuracy of the factor R of the QR factorisation of an LLL-reduced basis. Our main contribution is the first fully rigorous perturbation analysis of the R-factor of LLL-reduced matrices under column-wise perturbations. Our results should be very useful to devise LLL-type algorithms relying on floating-point approximations.
1 :  SOCS - School of Computer Science [Quebec]
2 :  LIP - Laboratoire de l'Informatique du Parallélisme
3 :  Inria Grenoble Rhône-Alpes / LIP Laboratoire de l'Informatique du Parallélisme - ARENAIRE
Lattice reduction – LLL – QR factorization – Perturbation analysis