Abstract
Luk and Tracy (2008) [7] developed a matrix interpretation of the LLL algorithm. Building on their work [7], we propose to add pivoting to the algorithm. We prove that our new algorithm always terminates, and we construct a class of ill-conditioned reduced matrices to illustrate the advantages of pivoting.
| Original language | English |
|---|---|
| Pages (from-to) | 2296-2307 |
| Number of pages | 12 |
| Journal | Linear Algebra and Its Applications |
| Volume | 434 |
| Issue number | 11 |
| DOIs | |
| Publication status | Published - 1 Jun 2011 |
User-Defined Keywords
- Conditioning
- Lattice basis reduction
- LLL algorithm
- Pivoting