A Parallel Algorithm to Evaluate Chebyshev Series on a Message Passing Environment

DOI10.1137/S1064827596312857MaRDI QIDQ4253046zbMATH OpenOpenAlexFDO

Authors Roberto Barrio, Javier Sabadell

Publication date 24 June 1999

Published in SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s1064827596312857

zbMATH Keywords

arithmetic complexityChebyshev polynomialsnumerical experimentsparallel algorithmpolynomial evaluation

Mathematics Subject Classification ID

Real polynomials: analytic properties, etc. (26C05) Computation of special functions and constants, construction of tables (65D20) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20)

Recommendations

• Parallel evaluation of Chebyshev and trigonometric series
• Stability of parallel algorithms to evaluate Chebyshev series
• Parallel Algorithms to Evaluate Orthogonal Polynomial Series
• A parallel algorithm for generating discrete orthogonal polynomials

Cited in

(7)

• Compression of almost-periodic data.
• On the numerical evaluation of linear recurrences
• Parallel evaluation of Chebyshev and trigonometric series
• scientific article; zbMATH DE number 1950380 (Why is no real title available?)
• Stability of parallel algorithms to evaluate Chebyshev series
• Stability of parallel algorithms for polynomial evaluation
• Parallel implementation of 3D global MHD simulations for Earth's magnetosphere

This page was built for publication: A Parallel Algorithm to Evaluate Chebyshev Series on a Message Passing Environment

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