Storage efficient algorithm for Hermite Normal Form using LLL
Autor: | Seongan Lim, Gook Hwa Cho, Yoonjeong Kim, Hyang-Sook Lee |
---|---|
Rok vydání: | 2021 |
Předmět: |
Discrete mathematics
Numerical Analysis Algebra and Number Theory Efficient algorithm Modulo Computation 010102 general mathematics 010103 numerical & computational mathematics 01 natural sciences Hermite normal form Matrix (mathematics) Lattice (order) Discrete Mathematics and Combinatorics Geometry and Topology 0101 mathematics Lattice reduction Extended Euclidean algorithm Mathematics |
Zdroj: | Linear Algebra and its Applications. 613:183-200 |
ISSN: | 0024-3795 |
DOI: | 10.1016/j.laa.2020.12.022 |
Popis: | Computing HNF has a long history, but designing a storage efficient algorithm is a challenging issue for matrices of large sizes. One of the main challenges in the design of storage efficient HNF algorithm is to control the rank and the size of the intermediate input. In our proposed algorithm, we use a multiple extended gcd algorithm and show that the rank of the intermediate input matrix decreases as the number of iteration increases. The determinant of the intermediate input matrix of our algorithm is a factor of the determinant d of the input matrix and thus size reduction modulo d can be done in the computations of our algorithm. By using a lattice reduction algorithm and a proven quality of LLL reduced basis, we prove that the storage of the intermediate input matrix B k of our algorithm is less than ( n − k + 1 ) ( ( n − k + 1 ) ( n − k ) 4 + log 2 d ) in bits. Therefore, it is expected that a smaller storage for kth iteration is required as k closes to n. We compare the intermediate computations of our algorithm to MW-type algorithm which has an optimal asymptotic space requirement. Our experimental example and results on intermediate size suggest that the intermediate storage of our HNF algorithm is comparable to MW-type algorithm and well controlled by the intermediate input size. |
Databáze: | OpenAIRE |
Externí odkaz: |