Lagrange interpolation on a processor tree with ring connections

DOI10.1006/JPDC.1994.1090MaRDI QIDQ1344538zbMATH OpenOpenAlexWikidataFDO

Authors Ben Goertzel

Publication date 18 June 1995

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jpdc.1994.1090

zbMATH Keywords

algorithmcomplexityLagrange interpolationLagrange polynomialprocessor tree with ring connections

Mathematics Subject Classification ID

Numerical interpolation (65D05) Numerical algorithms for specific classes of architectures (65Y10)

Review text

The author describes an algorithm for evaluating the Lagrange polynomial. This method makes use of a processor tree with ring connections. Without the tree connections, this method requires \(n+1\) steps on \(n\) processors. The added tree connections cut the complexity by approximately half.

Recommendations

• A parallel algorithm for Lagrange interpolation polynomial
• Fast parallel algorithm for polynomial interpolation
• The complexity of evaluating interpolation polynomials
• A parallel algorithm for Lagrange interpolation on the star graph
• A new parallel algorithm for Lagrange interpolation on a hypercube

Cited in

(3)

• Parallel Lagrange interpolation on \(k\)-ary \(n\)-cubes with maximum channel utilization
• A new parallel algorithm for Lagrange interpolation on a hypercube
• EMPLOYINGK-ARY n-CUBES FOR PARALLEL LAGRANGE INTERPOLATION

This page was built for publication: Lagrange interpolation on a processor tree with ring connections

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1344538)