Mr. Smith goes to Las Vegas: Randomized parallel computation of the Smith Normal form of polynomial matrices
From MaRDI portal
Publication:5393358
DOI10.1007/3-540-51517-8_134zbMath1209.15003OpenAlexW1491879309MaRDI QIDQ5393358
Erich L. Kaltofen, B. David Saunders, Mukkai S. Krishnamoorthy
Publication date: 16 April 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-51517-8_134
Symbolic computation and algebraic computation (68W30) Parallel algorithms in computer science (68W10) Software, source code, etc. for problems pertaining to linear algebra (15-04) Special matrices (15B99)
Related Items
An \(NC^ 2\) algorithm for testing similarity of matrices, Computing diagonal form and Jacobson normal form of a matrix using Gröbner bases, Fraction-free algorithm for the computation of diagonal forms matrices over Ore domains using Gröbner bases, Fast Parallel Computation of Hermite and Smith Forms of Polynomial Matrices, A fast Las Vegas algorithm for computing the Smith normal form of a polynomial matrix
