Cost-efficient parallel programs based on set-distributions for polynomial interpolation

DOI10.1016/J.JPDC.2007.04.005MaRDI QIDQ2641860zbMATH OpenOpenAlexFDO

Authors Virginia Niculescu

Publication date 23 August 2007

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

Full work available at URL https://doi.org/10.1016/j.jpdc.2007.04.005

zbMATH Keywords

complexitycostdata-distributionefficiencyformal derivationHermiteLagrangeparallel computationpolynomial interpolation

Mathematics Subject Classification ID

Numerical interpolation (65D05) Parallel numerical computation (65Y05) Parallel algorithms in computer science (68W10)

Recommendations

• Efficient algorithms for Hermite interpolation
• On data distributions in the construction of parallel programs
• Fast parallel algorithm for polynomial interpolation
• Parallel Hermite interpolation: An algebraic approach
• New algorithms for polynomial and trigonometric interpolation on parallel computers

Cited in

(2)

• Efficient algorithms for Hermite interpolation
• On data distributions in the construction of parallel programs

This page was built for publication: Cost-efficient parallel programs based on set-distributions for polynomial interpolation

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