Parallel algorithms for matrix normal forms

DOI10.1016/0024-3795(90)90028-BzbMath0727.65031MaRDI QIDQ803724

Mukkai S. Krishnamoorthy, Erich L. Kaltofen

Publication date: 1990

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

similarityrandomized parallel algorithmpolynomial matrixSmith normal formnon-similarityFast parallel algorithmsHermite form computations

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Parallel numerical computation (65Y05) Canonical forms, reductions, classification (15A21)

Related Items

High-order lifting and integrality certification, The shifted number system for fast linear algebra on integer matrices, Minimal matrix centralizers over the field ℤ₂, The rank of a random matrix, On efficient sparse integer matrix Smith normal form computations, A local construction of the Smith normal form of a matrix polynomial, Triangular \(x\)-basis decompositions and derandomization of linear algebra algorithms over \(K[x\)], Diophantine quadratic equation and Smith normal form using scaled extended integer Abaffy-Broyden-Spedicato algorithms, Efficient decomposition of separable algebras., Normal forms for general polynomial matrices, Determining the structure of the Jordan normal form of a matrix by symbolic computation, A fast Las Vegas algorithm for computing the Smith normal form of a polynomial matrix, The numerical rank of a matrix and its applications, Evaluation techniques for zero-dimensional primary decomposition, Eigenvalue trim approach to exact order reduction for Roesser state-space model of multidimensional systems, Computing rational forms of integer matrices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving systems of linear equations over polynomials
• The complexity of elementary algebra and geometry
• A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
• 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 Matrix
• Parallel Algorithms for Algebraic Problems
• A taxonomy of problems with fast parallel algorithms
• Representations and Parallel Computations for Rational Functions
• Solving sparse linear equations over finite fields
• Fast Parallel Computation of Hermite and Smith Forms of Polynomial Matrices
• Two theorems on matrices
• Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Algorithms for the Solution of Systems of Linear Diophantine Equations