Stability Analysis of Parallel Evaluation of Finite Series of Orthogonal Polynominals

Authors:
Roberto Barrio;Plamen Y. Yalamov
Affiliations:
-;-
Venue:
NAA '00 Revised Papers from the Second International Conference on Numerical Analysis and Its Applications
Year:
2000

Citing 3
Cited 0

Stability of a partitioning algorithm for bidiagonal systems

Parallel Computing
Parallel Algorithms to Evaluate Orthogonal Polynomial Series

SIAM Journal on Scientific Computing
Accuracy and Stability of Numerical Algorithms

Accuracy and Stability of Numerical Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we study the rounding errors in the parallel evaluation of a finite series of a general family of orthogonal polynomials. Both, the theoretical bounds and the numerical tests present an almost similar behavior between the sequential and the parallel algorithms.