Matrix multiplication via arithmetic progressions
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Sorting in c log n parallel steps
Combinatorica
Asymptotically fast triangularization of matrices over rings
SIAM Journal on Computing
Near optimal algorithms for computing Smith normal forms of integer matrices
ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
Modern computer algebra
Fast deterministic computation of determinants of dense matrices
ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
Integer Smith form via the valence: experience with large sparse matrices from homology
ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
On the computation of elementary divisors of integer matrices
Journal of Symbolic Computation
Introduction to Algorithms
Finite field linear algebra subroutines
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Acceleration of Euclidean algorithm and extensions
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
On computing the determinant and Smith form of an integer matrix
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Factoring into coprimes in essentially linear time
Journal of Algorithms
Signature of symmetric rational matrices and the unitary dual of lie groups
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
A BLAS based C library for exact linear algebra on integer matrices
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Generic matrix multiplication and memory management in linBox
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Solving sparse rational linear systems
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Some recent progress in exact linear algebra and related questions
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Parallel computation of the rank of large sparse matrices from algebraic K-theory
Proceedings of the 2007 international workshop on Parallel symbolic computation
LinBox and future high performance computer algebra
Proceedings of the 2007 international workshop on Parallel symbolic computation
Integer matrix rank certification
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Chip-firing games, potential theory on graphs, and spanning trees
Journal of Combinatorial Theory Series A
Fast computation of Smith forms of sparse matrices over local rings
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation
Deterministic unimodularity certification
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation
Computing the invariant structure of integer matrices: fast algorithms into practice
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
| Hi-index | 0.00 |
We present a variation of the fast Monte Carlo algorithm of Eberly, Giesbrecht and Villard for computing the Smith form of an integer matrix. It is faster in practice, but with the same asymptotic complexity, and it also handles the singular case. Then we will apply the key principle to improve Storjohann's algorithm and Iliopoulos' algorithm. We have a soft linear time algorithm for the special case of a diagonal matrix. A local Smith form Algorithm is also considered.We offer analysis and experimental results regarding these algorithms, with a view to the construction of an adaptive algorithm exploiting each algorithm at it's best range of performance. Finally, based on this information, we sketch the proposed structure of an adaptive Smith form algorithm for matrices over the integers. Our experiments use implementations in LinBox, a library for exact computational linear algebra available at linalg.org.