A parallel algorithm for Lagrange interpolation on the star graph

DOI10.1006/JPDC.2001.1812MaRDI QIDQ697014zbMATH OpenOpenAlexFDO

Authors Hamid Sarbazi-Azad, M. Ould-Khaoua, L. M. Mackenzie, Selim G. Akl

Publication date 12 September 2002

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

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

zbMATH Keywords

performanceparallel algorithmLagrange interpolationinterconnection networksstar graph

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Numerical interpolation (65D05)

Recommendations

• scientific article; zbMATH DE number 1302617
• A new parallel algorithm for Lagrange interpolation on a hypercube
• Fast parallel algorithm for polynomial interpolation
• Parallel Lagrange interpolation on \(k\)-ary \(n\)-cubes with maximum channel utilization
• EMPLOYINGK-ARY n-CUBES FOR PARALLEL LAGRANGE INTERPOLATION

Cited in

(7)

• Largest connected component of a star graph with faulty vertices
• Lagrange interpolation on a processor tree with ring connections
• A new parallel algorithm for Lagrange interpolation on a hypercube
• Analytic performance comparison of hypercubes and star graphs with implementation constraints
• A parallel algorithm for Lagrange interpolation polynomial
• scientific article; zbMATH DE number 1302617 (Why is no real title available?)
• A parallel clustering algorithm on the star graph and its performance

This page was built for publication: A parallel algorithm for Lagrange interpolation on the star graph

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