Parallel algorithms for some algebraic operations on polynomial equations

Authors:
Xiaodong Zhang;Hao Lu;Ervin Y. Rodin
Affiliations:
Division of Mathematics and Computer Science, The University of Texas at San Antonio, San Antonio, Texas 78285-0664 USA;Department of Mathematics, Xian Jiaotong University, Shanxi, People's Republic of China;Department of Mathematics, Xian Jiaotong University, Shanxi, People's Republic of China
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
1990

Citing 5
Cited 0

Parallel solution of certain toeplitz linear systems

SIAM Journal on Computing
Parallelization and Performance Analysis of the Cooley-Tukey FFT Algorithm for Shared-Memory Architectures

IEEE Transactions on Computers
A parallel triangular solver for distributed-memory multiprocessor

SIAM Journal on Scientific and Statistical Computing
A new method for solving triangular systems on distributed-memory message-passing multiprocessors

SIAM Journal on Scientific and Statistical Computing
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms

Quantified Score

Hi-index	0.98

Visualization

Abstract

We give a group of parallel methods for solving polynomial related problems and their implementation on a distributed memory multicomputer. These problems are 1. the evaluation of polynomials, 2. the multiplication of polynomials, 3. the division of polynomials, and 4. the interpolation of polynomials. Mathematical analyses are given for exploiting the parallelism of these operations. The related parallel methods supporting the solutions of these polynomial problems, such as FFT, Toeplitz linear systems and others are also discussed.