Conditioning properties of the LLL algorithm

Franklin T LUK, Sanzheng Qiao*

*Corresponding author for this work

Research output: Chapter in book/report/conference proceedingConference proceedingpeer-review

2 Citations (Scopus)

Abstract

Although the LLL algorithm1 was originally developed for lattice basis reduction, the method can also be used2 to reduce the condition number of a matrix. In this paper, we propose a pivoted LLL algorithm that further improves the conditioning. Our experimental results demonstrate that this pivoting scheme works well in practice.

Original languageEnglish
Title of host publicationMathematics for Signal and Information Processing
EditorsMark S. Schmalz
DOIs
Publication statusPublished - 2009
EventMathematics for Signal and Information Processing - San Diego, CA, United States
Duration: 2 Aug 20095 Aug 2009

Publication series

NameProceedings of SPIE - The International Society for Optical Engineering
Volume7444
ISSN (Print)0277-786X

Conference

ConferenceMathematics for Signal and Information Processing
Country/TerritoryUnited States
CitySan Diego, CA
Period2/08/095/08/09

Scopus Subject Areas

  • Electronic, Optical and Magnetic Materials
  • Condensed Matter Physics
  • Computer Science Applications
  • Applied Mathematics
  • Electrical and Electronic Engineering

User-Defined Keywords

  • Gauss transformation
  • Lattice
  • LLL algorithm
  • Matrix conditioning
  • Pivoting
  • Reduced basis
  • Unimodular matrix

Fingerprint

Dive into the research topics of 'Conditioning properties of the LLL algorithm'. Together they form a unique fingerprint.

Cite this