Fast Parallel Computation of Hermite and Smith Forms of Polynomial Matrices
From MaRDI portal
Recommendations
Cites work
- A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
- Exact reduction of a polynomial matrix to the Smith normal form
- Fast parallel matrix and GCD computations
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- scientific article; zbMATH DE number 3841223 (Why is no real title available?)
- scientific article; zbMATH DE number 3935166 (Why is no real title available?)
- scientific article; zbMATH DE number 3750146 (Why is no real title available?)
- scientific article; zbMATH DE number 3756646 (Why is no real title available?)
- scientific article; zbMATH DE number 3222940 (Why is no real title available?)
- scientific article; zbMATH DE number 3401090 (Why is no real title available?)
- Mr. Smith goes to Las Vegas: randomized parallel computation of the Smith normal form of polynomial matrices
- Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
- Solving systems of linear equations over polynomials
- The complexity of the word problems for commutative semigroups and polynomial ideals
Cited in
(24)- Compound matrices: Properties, numerical issues and analytical computations
- Easy intruder deduction problems with homomorphisms
- A compound matrix algorithm for the computation of the Smith form of a polynomial matrix
- Computing algorithms for the reduction of a Hermite algorithm with polynomial coefficients
- Fast parallel algorithms for matrix reduction to normal forms
- The complexity of the characteristic and the minimal polynomial.
- A polynomial-time algorithm to compute generalized Hermite normal forms of matrices over \(\mathbb{Z} [x]\)
- Complexity of nilpotent unification and matching problems.
- Computing rational forms of integer matrices
- On Computing the Hermite Form of a Matrix of Differential Polynomials
- scientific article; zbMATH DE number 1263431 (Why is no real title available?)
- Fast parallel Hermite normal form computation of matrices over $$\mathbb{F}[x]$$
- Fast Parallel Computation of the Polynomial Remainder Sequence via Bézout and Hankel Matrices
- Unification and matching modulo nilpotence
- Computationally Efficient Reduced Polynomial Based Algorithms for Hermitian Toeplitz Matrices
- A modular algorithm to compute the generalized Hermite normal form for \(\mathbb{Z}[x]\)-lattices
- Mr. Smith goes to Las Vegas: randomized parallel computation of the Smith normal form of polynomial matrices
- Fast computation of divided differences and parallel Hermite interpolation
- On the quasi-stability criteria of monic matrix polynomials
- A local construction of the Smith normal form of a matrix polynomial
- A Formal Proof of the Computation of Hermite Normal Form in a General Setting
- A fast Las Vegas algorithm for computing the Smith normal form of a polynomial matrix
- A decision algorithm for linear sentences on a PFM
- Parallel algorithms for matrix normal forms
This page was built for publication: Fast Parallel Computation of Hermite and Smith Forms of Polynomial Matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3802506)
