On the numerical evaluation of linear recurrences
From MaRDI portal
Investigation of the rounding errors for the evaluation of \(n\)-term linear recurrences of order \(m+1\). For several examples the new result is compared with the exact error and an old estimate. Then the parallel evaluation of the last term of a recurrence is discussed with an algorithm based on Stone's algorithm. Speedup examples on a T3E are presented for different values of \(m,n\) and number of processors up to 512.
Recommendations
- scientific article; zbMATH DE number 2102138
- Stability analysis of parallel evaluation of finite series of orthogonal polynomials
- Generation and evaluation of orthogonal polynomials in discrete Sobolev spaces. II: numerical stability
- A unified rounding error bound for polynomial evaluation
- Error bounds for the numerical evaluation of Legendre polynomials by a three-term recurrence
Cites work
- A Parallel Algorithm to Evaluate Chebyshev Series on a Message Passing Environment
- Associated Laguerre and Hermite polynomials
- Condition Numbers of Random Triangular Matrices
- Connection Coefficients of Orthogonal Polynomials
- Fourth-order difference equation for the associated classical discrete orthogonal polynomials
- Fourth-order difference equation for the first associated of classical discrete orthogonal polynomials
- Generation and evaluation of orthogonal polynomials in discrete Sobolev spaces. I: Algorithms
- scientific article; zbMATH DE number 3467565 (Why is no real title available?)
- scientific article; zbMATH DE number 1104473 (Why is no real title available?)
- scientific article; zbMATH DE number 846277 (Why is no real title available?)
- scientific article; zbMATH DE number 3110365 (Why is no real title available?)
- On Orthogonal Polynomials of Sobolev Type: Algebraic Properties and Zeros
- On Recurrence Relations for Sobolev Orthogonal Polynomials
- Parallel Algorithms to Evaluate Orthogonal Polynomial Series
- Parallel Tridiagonal Equation Solvers
- Recurrence relations for connection coefficients between two families of orthogonal polynomials
- Results on the associated Jacobi and Gegenbauer polynomials
- Resurrecting the asymptotics of linear recurrences
- Rounding error bounds for the Clenshaw and Forsythe algorithms for the evaluation of orthogonal polynomial series
- Rounding error propagation in polynomial evaluation schemes
- Solutions of linear difference equations with variable coefficients
- The Complexity of Parallel Evaluation of Linear Recurrences
- Time and Parallel Processor Bounds for Linear Recurrence Systems
Cited in
(15)- Horner's rule and the computation of linear recurrences
- On the logarithmic evaluation of recurrence relations
- High-order recurrences satisfied by classical orthogonal polynomials.
- Some recurrence relations and their parallel evaluation using nested recurrent product form algorithm
- Basis conversions among univariate polynomial representations
- Error bounds for the numerical evaluation of Legendre polynomials by a three-term recurrence
- A general condition number for polynomials
- scientific article; zbMATH DE number 3990816 (Why is no real title available?)
- scientific article; zbMATH DE number 2052980 (Why is no real title available?)
- Fast Parallel Algorithm for Polynomial Evaluation
- Efficient computation of terms of linear recurrence sequences of any order
- 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
- Evaluation of Legendre polynomials by a three-term recurrence in floating-point arithmetic
- Rounding error analysis of linear recurrences using generating series
This page was built for publication: On the numerical evaluation of linear recurrences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1863682)
