Pages that link to "Item:Q1863682"
From MaRDI portal
The following pages link to On the numerical evaluation of linear recurrences (Q1863682):
Displaying 13 items.
- Generation and evaluation of orthogonal polynomials in discrete Sobolev spaces. I: Algorithms (Q557692) (← links)
- Generation and evaluation of orthogonal polynomials in discrete Sobolev spaces. II: numerical stability (Q557693) (← links)
- Horner's rule and the computation of linear recurrences (Q1092939) (← links)
- On the logarithmic evaluation of recurrence relations (Q1183470) (← links)
- High-order recurrences satisfied by classical orthogonal polynomials. (Q1764578) (← links)
- Some recurrence relations and their parallel evaluation using nested recurrent product form algorithm (Q1825585) (← links)
- Basis conversions among univariate polynomial representations (Q1887026) (← links)
- Error bounds for the numerical evaluation of Legendre polynomials by a three-term recurrence (Q2035853) (← links)
- A general condition number for polynomials (Q2840398) (← links)
- (Q4454615) (← links)
- Fast Parallel Algorithm for Polynomial Evaluation (Q4820805) (← links)
- Efficient computation of terms of linear recurrence sequences of any order (Q5384249) (← links)
- Rounding error analysis of linear recurrences using generating series (Q6163326) (← links)