Parallel Algorithms to Evaluate Orthogonal Polynomial Series

DOI10.1137/S1064827598340494MaRDI QIDQ4509829zbMATH OpenOpenAlexFDO

Authors Roberto Barrio

Publication date 19 October 2000

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

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

zbMATH Keywords

orthogonal polynomialsparallel algorithmspolynomial evaluation

Mathematics Subject Classification ID

Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45) Numerical approximation and evaluation of special functions (33F05) Computation of special functions and constants, construction of tables (65D20) Parallel numerical computation (65Y05)

Recommendations

• scientific article; zbMATH DE number 2102138
• A parallel algorithm for generating discrete orthogonal polynomials
• Fast Parallel Algorithm for Polynomial Evaluation
• Stability of parallel algorithms for polynomial evaluation
• Parallel evaluation of Chebyshev and trigonometric series

Cited in

(10)

• A parallel algorithm for generating discrete orthogonal polynomials
• On the numerical evaluation of linear recurrences
• Parallel evaluation of Chebyshev and trigonometric series
• scientific article; zbMATH DE number 1617952 (Why is no real title available?)
• A Parallel Algorithm to Evaluate Chebyshev Series on a Message Passing Environment
• scientific article; zbMATH DE number 2067903 (Why is no real title available?)
• Generation and evaluation of orthogonal polynomials in discrete Sobolev spaces. I: Algorithms
• Stability of parallel algorithms to evaluate Chebyshev series
• Stability of parallel algorithms for polynomial evaluation
• Model reduction based on parallelisation and Krawtchouk polynomials for discrete time systems with delays

This page was built for publication: Parallel Algorithms to Evaluate Orthogonal Polynomial Series

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