A parallel algorithm for Lagrange interpolation on the star graph

DOI10.1006/JPDC.2001.1812zbMATH Open1016.65005OpenAlexW2047772825MaRDI QIDQ697014FDOQ697014

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

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

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)

Cited In (7)

• Largest connected component of a star graph with faulty vertices
• A new parallel algorithm for Lagrange interpolation on a hypercube
• A parallel clustering algorithm on the star graph and its performance
• Lagrange interpolation on a processor tree with ring connections
• Title not available (Why is that?)
• Analytic performance comparison of hypercubes and star graphs with implementation constraints
• A parallel algorithm for Lagrange interpolation polynomial

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)