Parallel algorithms for matrix polynomial division
From MaRDI portal
(Redirected from Publication:805151)
Recommendations
- Polynomial division and its computational complexity
- A fast algorithm for the division of two polynomial matrices
- Improved Parallel Polynomial Division
- Fast parallel polynomial division via reduction to triangular Toeplitz matrix inversion and to polynomial inversion modulo a power
- Fast parallel algorithms for polynomial division over an arbitrary field of constants
Cites work
- A Survey of Parallel Algorithms in Numerical Linear Algebra
- A fast algorithm for the division of two polynomial matrices
- An efficient division algorithm for polynomial matrices
- Complexity of parallel matrix computations
- Finding the maximum, merging, and sorting in a parallel computation model
- Logarithmic Depth Circuits for Algebraic Functions
- Parallel Solution of Certain Toeplitz Linear Systems
- Polynomial division and its computational complexity
- Relations between Concurrent-Write Models of Parallel Computation
Cited in
(10)- Data parallel evaluation-interpolation algorithm for polynomial matrix inversion
- A fast algorithm for the division of two polynomial matrices
- A division algorithm for polynomial matrices
- Computational algorithms for algebraic operations on multidimensional polynomials
- A new parallel polynomial division by a separable polynomial via Hermite interpolation with applications
- A logarithmic Boolean time algorithm for parallel polynomial division
- Algorithms for fast polynomial division
- scientific article; zbMATH DE number 4217603 (Why is no real title available?)
- Fast parallel algorithms for polynomial division over an arbitrary field of constants
- scientific article; zbMATH DE number 3958730 (Why is no real title available?)
This page was built for publication: Parallel algorithms for matrix polynomial division
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q805151)