Fast parallel algorithms for polynomial division over an arbitrary field of constants

DOI10.1016/0898-1221(86)90015-5zbMath0615.68033OpenAlexW2093384631MaRDI QIDQ4723298

Pan, Victor Y., Dario Andrea Bini

Publication date: 1986

Published in: Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(86)90015-5

zbMATH Keywords

parallel algorithmspolynomial divisioninversion of circulant matrices

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Parallel algorithms in computer science (68W10) Polynomials in general fields (irreducibility, etc.) (12E05)

Related Items

On application of some recent techniques of the design of algebraic algorithms to the sequential and parallel evaluation of the roots of a polynomial and to some other numerical problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast parallel polynomial division via reduction to triangular Toeplitz matrix inversion and to polynomial inversion modulo a power
• Relations between exact and approximate bilinear algorithms. Applications
• Parallel Solution of Certain Toeplitz Linear Systems
• How Can We Speed Up Matrix Multiplication?
• Logarithmic Depth Circuits for Algebraic Functions
• Partial and Total Matrix Multiplication
• On the Asymptotic Complexity of Matrix Multiplication
• Fast parallel matrix and GCD computations