A divide-and-inner product parallel algorithm for polynomial evaluation
- Aomori Univ. (Japan)
- Tohoku Univ., Sendai (Japan)
In this paper, a divide-and-inner product parallel algorithm for evaluating a polynomial of degree N (N+1=KL) on a MIMD computer is presented. It needs 2K + log{sub 2}L steps to evaluate a polynomial of degree N in parallel on L+1 processors (L{<=}2K-2log{sub 2}K) which is a decrease of log{sub 2}L steps as compared with the L-order Homer`s method, and which is a decrease of (2log{sub 2}L){sup 1/2} steps as compared with the some MIMD algorithms. The new algorithm is simple in structure and easy to be realized.
- Research Organization:
- Front Range Scientific Computations, Inc., Boulder, CO (United States); US Department of Energy (USDOE), Washington DC (United States); National Science Foundation, Washington, DC (United States)
- OSTI ID:
- 219558
- Report Number(s):
- CONF-9404305-Vol.2; ON: DE96005736; TRN: 96:002321-0005
- Resource Relation:
- Journal Volume: 6; Journal Issue: 1; Conference: Colorado conference on iterative methods, Breckenridge, CO (United States), 5-9 Apr 1994; Other Information: PBD: [1994]; Related Information: Is Part Of Colorado Conference on iterative methods. Volume 2; PB: 261 p.
- Country of Publication:
- United States
- Language:
- English
Similar Records
Parallel algorithms and architectures for the manipulator inertia matrix
A parallel additive Schwarz preconditioned Jacobi-Davidson algorithm for polynomial eigenvalue problems in quantum dot simulation
Fast and practical parallel polynomial interpolation
Miscellaneous
·
Sun Jan 01 00:00:00 EST 1989
·
OSTI ID:219558
A parallel additive Schwarz preconditioned Jacobi-Davidson algorithm for polynomial eigenvalue problems in quantum dot simulation
Journal Article
·
Tue Apr 20 00:00:00 EDT 2010
· Journal of Computational Physics
·
OSTI ID:219558
Fast and practical parallel polynomial interpolation
Technical Report
·
Thu Jan 01 00:00:00 EST 1987
·
OSTI ID:219558