On the numerical evaluation of linear recurrences
From MaRDI portal
Publication:1863682
DOI10.1016/S0377-0427(02)00565-4zbMath1015.65072MaRDI QIDQ1863682
Publication date: 12 March 2003
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (6)
Basis conversions among univariate polynomial representations ⋮ Fast Parallel Algorithm for Polynomial Evaluation ⋮ Rounding error analysis of linear recurrences using generating series ⋮ High-order recurrences satisfied by classical orthogonal polynomials. ⋮ Generation and evaluation of orthogonal polynomials in discrete Sobolev spaces. I: Algorithms ⋮ Generation and evaluation of orthogonal polynomials in discrete Sobolev spaces. II: numerical stability
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generation and evaluation of orthogonal polynomials in discrete Sobolev spaces. I: Algorithms
- Resurrecting the asymptotics of linear recurrences
- Rounding error propagation in polynomial evaluation schemes
- Solutions of linear difference equations with variable coefficients
- Fourth-order difference equation for the associated classical discrete orthogonal polynomials
- Results on the associated Jacobi and Gegenbauer polynomials
- Fourth-order difference equation for the first associated of classical discrete orthogonal polynomials
- Recurrence relations for connection coefficients between two families of orthogonal polynomials
- Associated Laguerre and Hermite polynomials
- Connection Coefficients of Orthogonal Polynomials
- On Orthogonal Polynomials of Sobolev Type: Algebraic Properties and Zeros
- Time and Parallel Processor Bounds for Linear Recurrence Systems
- Parallel Tridiagonal Equation Solvers
- The Complexity of Parallel Evaluation of Linear Recurrences
- A Parallel Algorithm to Evaluate Chebyshev Series on a Message Passing Environment
- Condition Numbers of Random Triangular Matrices
- Parallel Algorithms to Evaluate Orthogonal Polynomial Series
- On Recurrence Relations for Sobolev Orthogonal Polynomials
- Rounding error bounds for the Clenshaw and Forsythe algorithms for the evaluation of orthogonal polynomial series
This page was built for publication: On the numerical evaluation of linear recurrences
