Parallel algorithms for matrix normal forms
- 1 July 1990
- journal article
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 136, 189-208
- https://doi.org/10.1016/0024-3795(90)90028-b
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Finite Abelian Groups and the Hermite and Smith Normal Forms of an Integer MatrixSIAM Journal on Computing, 1989
- Fast Parallel Computation of Hermite and Smith Forms of Polynomial MatricesSIAM Journal on Algebraic Discrete Methods, 1987
- A fast parallel algorithm to compute the rank of a matrix over an arbitrary fieldCombinatorica, 1987
- Representations and Parallel Computations for Rational FunctionsSIAM Journal on Computing, 1986
- The complexity of elementary algebra and geometryJournal of Computer and System Sciences, 1986
- A taxonomy of problems with fast parallel algorithmsInformation and Control, 1985
- Solving systems of linear equations over polynomialsTheoretical Computer Science, 1985
- Parallel Algorithms for Algebraic ProblemsSIAM Journal on Computing, 1984
- Algorithms for the Solution of Systems of Linear Diophantine EquationsSIAM Journal on Computing, 1982
- Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer MatrixSIAM Journal on Computing, 1979