Performance of parallel algorithms for the evaluation of power series

DOI10.1016/0167-8191(94)90076-0MaRDI QIDQ1334545zbMATH OpenOpenAlexFDO

Authors V. Pereyra

Publication date 25 September 1994

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8191(94)90076-0

zbMATH Keywords

complexity analysisparallel algorithmsperformancepower series evaluation

Mathematics Subject Classification ID

Power series (including lacunary series) in one complex variable (30B10) Numerical summation of series (65B10) General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Parallel numerical computation (65Y05)

Review text

The authors study the absolute, relative, and comparative performance of a number of parallel algorithms for power series evaluation. The results are interpreted using complexity analysis and architectural data.

Cited in

(1)

• Parallel evaluation of Chebyshev and trigonometric series

This page was built for publication: Performance of parallel algorithms for the evaluation of power series

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