A note on the hermite basis computation of large integer matrices

Authors:
Ulrich Vollmer
Affiliations:
Technische Universität Darmstadt, Darmstadt, Germany
Venue:
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
Year:
2003

Citing 4
Cited 2

Matrix multiplication via arithmetic progressions

Journal of Symbolic Computation - Special issue on computational algebraic complexity
Asymptotically fast triangularization of matrices over rings

SIAM Journal on Computing
Algorithms for Large Integer Matrix Problems

AAECC-14 Proceedings of the 14th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
An Accelerated Buchmann Algorithm for Regulator Computation in Real Quadratic Fields

ANTS-V Proceedings of the 5th International Symposium on Algorithmic Number Theory

A BLAS based C library for exact linear algebra on integer matrices

Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Computing hermite forms of polynomial matrices

Proceedings of the 36th international symposium on Symbolic and algebraic computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new algorithm is given and analyzed for the computation of the Hermite basis of a large integer matrix whose HNF has small essential part. The algorithm improves the results from [3] by dropping two key requirements on the matrix considered---sparsity and small kernel dimension---at the cost of relying on small determinant size.