Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!samsung!emory!hubcap!bs
From: bs@linus.mitre.org (Robert D. Silverman)
Newsgroups: comp.parallel
Subject: Re: parallel interpolation algorithm
Keywords: parallel interpolation alogorithm
Message-ID: <9756@hubcap.clemson.edu>
Date: 19 Jul 90 14:56:21 GMT
Sender: fpst@hubcap.clemson.edu
Followup-To: comp.parallel
Lines: 27
Approved: parallel@hubcap.clemson.edu

In article <9742@hubcap.clemson.edu> rcodd@chudich.co.rmit.OZ.AU (David Doan) writes:
...
:I am currently trying to map a sequential polynomial interpolation
:algorithm onto a parallel system.

Polynomial interpolation can be reformulated as a problem in polynomial
multiplication. See, for example, Aho, Hopcroft & Ullman, The Design
and Analysis of Computer Algorithms.

For parallel methods of polynomial multiplication, based upon the use
of FFT techniques and Residue Number Systems see the following:

P. Montgomery & R. Silverman
An FFT Extension to the P-1 Factoring Algorithm
Mathematics of Computation  V. 54 pp. 839-853 (1990)

and

R. Silverman
Parallel Polynomial Arithmetic over Finite Rings
J. Parallel & Dist. Computing (to appear 1990)

-- 
Bob Silverman
#include <std.disclaimer>
Mitre Corporation, Bedford, MA 01730
"You can lead a horse's ass to knowledge, but you can't make him think"