rcodd@chudich.co.rmit.OZ.AU (David Doan) (07/18/90)
I am currently trying to map a sequential polynomial interpolation
algorithm onto a parallel system.
I would appreciate any information on how I should do this
or if there is a source that I might learn of a
parallel polynomial interpolation algorithm.
The application is to enhance an image through
reducing the noise (contrast enhancement) in an
X-ray image.
I would like to hear of any parallel mechanism that
may be of use to me.
Thank you
David Doan PHONE:(03) 660 2728 FAX:(03) 662 1060
IP No.: 131.170.32.1
ACSnet: rcodd@chudich.co.rmit.oz.au
ARPA: rcodd@chudich.co.rmit.oz.au@uunet.uu.net
CSNET: rcodd@chudich.co.rmit.oz.au
BITNET: rcodd@chudich.co.rmit.oz.au@CSNET-RELAY
UUCP: ...!uunet!munnari!chudich.co.rmit.oz.au!rcodd
SNAIL: Royal Melbourne Institute of Technology,
Department of Communication and Electrical Engineering,
G.P.O. Box 2476V, Melbourne, Victoria, 3001. AUSTRALIA.bs@linus.mitre.org (Robert D. Silverman) (07/19/90)
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"