Parallel algorithms for matrix polynomial division
From MaRDI portal
Publication:805151
DOI10.1016/0898-1221(91)90179-8zbMath0728.65033OpenAlexW1988435385MaRDI QIDQ805151
Publication date: 1991
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0898-1221(91)90179-8
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Polynomial division and its computational complexity
- Complexity of parallel matrix computations
- Parallel Solution of Certain Toeplitz Linear Systems
- An efficient division algorithm for polynomial matrices
- Logarithmic Depth Circuits for Algebraic Functions
- Relations between Concurrent-Write Models of Parallel Computation
- A fast algorithm for the division of two polynomial matrices
- Finding the maximum, merging, and sorting in a parallel computation model
- A Survey of Parallel Algorithms in Numerical Linear Algebra
This page was built for publication: Parallel algorithms for matrix polynomial division