Parallel Algorithms to Evaluate Orthogonal Polynomial Series

Authors:
Roberto Barrio
Affiliations:
-
Venue:
SIAM Journal on Scientific Computing
Year:
1999

Citing 0
Cited 4

On the numerical evaluation of linear recurrences

Journal of Computational and Applied Mathematics
Stability Analysis of Parallel Evaluation of Finite Series of Orthogonal Polynominals

NAA '00 Revised Papers from the Second International Conference on Numerical Analysis and Its Applications
Generation and evaluation of orthogonal polynomials in discrete Sobolev spaces I: algorithms

Journal of Computational and Applied Mathematics
Generation and evaluation of orthogonal polynomials in discrete Sobolev spaces I: algorithms

Journal of Computational and Applied Mathematics

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper four parallel algorithms for the evaluation of finite series of orthogonal polynomials are introduced. The algorithms are based on the Forsythe and Clenshaw sequential algorithms. Several tests carried out on a Cray T3D are presented.