Stability analysis of parallel evaluation of finite series of orthogonal polynomials

DOI10.1007/3-540-45262-1_7MaRDI QIDQ2724473zbMATH OpenFDO

Authors Roberto Barrio, Plamen Yalamov

Publication date 7 February 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45262-1_7

zbMATH Keywords

algorithmsevaluation of polynomialsnumerical examplesorthogonal polynomialsparallel computationrecurrence relationrounding errors

Mathematics Subject Classification ID

Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45) Orthogonal functions and polynomials, general theory of nontrigonometric harmonic analysis (42C05) Computation of special functions and constants, construction of tables (65D20) Parallel numerical computation (65Y05)

Recommendations

• Stability of parallel algorithms for polynomial evaluation
• Stability of parallel algorithms to evaluate Chebyshev series
• scientific article; zbMATH DE number 2102138
• Parallel Algorithms to Evaluate Orthogonal Polynomial Series
• scientific article; zbMATH DE number 4056871

Cited in

(4)

• On the numerical evaluation of linear recurrences
• Stability of parallel algorithms to evaluate Chebyshev series
• Rounding error bounds for the Clenshaw and Forsythe algorithms for the evaluation of orthogonal polynomial series
• Stability of parallel algorithms for polynomial evaluation

This page was built for publication: Stability analysis of parallel evaluation of finite series of orthogonal polynomials

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