On the numerical evaluation of linear recurrences

Journal of Computational and Applied Mathematics

Volumn 150, Issue 1, 2003, Pages 71-86

  Barrio, R ^a,b   Melendo, B ^a,b   Serrano, S ^a  

^a Grupo de Mecánica Espacial   (Spain)

^b UNIVERSITY OF ZARAGOZA   (Spain)

Author keywords

Linear recurrence relations; Parallel algorithms; Rounding errors

Indexed keywords

ERROR ANALYSIS; POLYNOMIALS;

LINEAR RECURRENCES;

COMPUTATIONAL METHODS;

MATHEMATICAL METHOD;

EID: 0037211416     PISSN: 03770427     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-0427(02)00565-4     Document Type: Article

References (25)

1. On orthogonal polynomials of Sobolev type: Algebraic properties and zeros
2. Associated Laguerre and Hermite polynomials
3. Parallel algorithms to evaluate orthogonal polynomial series
4. Rounding error bounds for the Clenshaw and Forsythe algorithms for the evaluation of orthogonal polynomial series
5. A parallel algorithm to evaluate Chebyshev series on a message-passing environment
6. Time and parallel processors bounds for linear recurrence systems
7. A note on the summation of Chebyshev series
8. On recurrence relations for Sobolev orthogonal polynomials
9. Fourth-order difference equation for the associated classical discrete orthogonal polynomials
10. The complexity of parallel evaluation of linear recurrences
11. Results on the associated Jacobi and Gegenbauer polynomials
12. Solutions of linear difference equations with variable coefficients
13. Rounding error propagation in polynomial evaluation schemes
14. Parallel solution of linear recurrence systems
15. Fourth-order difference equation for the first associated of classical discrete orthogonal polynomials
16. Recurrence relations for connection coefficients between two families of orthogonal polynomials
17. Parallel tridiagonal equations solvers
18. Connection coefficients of orthogonal polynomials
19. Condition numbers of random triangular matrices
20. Resurrecting the asymptotics of linear recurrences