Back to Search
Start Over
Stability of parallel algorithms for polynomial evaluation
- Source :
-
Computers & Mathematics with Applications . Sep2003, Vol. 46 Issue 5/6, p769. 13p. - Publication Year :
- 2003
-
Abstract
- In this paper, we analyse the stability of parallel algorithms for the evaluation of polynomials written as a finite series of orthogonal polynomials. The basic part of the computation is the solution of a triangular tridiagonal linear system. This fact allows us to present a more detailed analysis. The theoretical results show that the parallel algorithms are almost as stable as their sequential counterparts for practical applications. Extensive numerical experiments confirm the theoretical conclusions. [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 08981221
- Volume :
- 46
- Issue :
- 5/6
- Database :
- Academic Search Index
- Journal :
- Computers & Mathematics with Applications
- Publication Type :
- Academic Journal
- Accession number :
- 11729700
- Full Text :
- https://doi.org/10.1016/S0898-1221(03)90140-4