A modification of Miller's recurrence algorithm
From MaRDI portal
Publication:5679672
DOI10.1007/BF01932818zbMath0263.65105MaRDI QIDQ5679672
Publication date: 1972
Published in: BIT (Search for Journal in Brave)
Related Items
The first and second kind chebyshev coefficients of the moments for the general order derivative on an infinitely differentiable function, Spectral solutions for differential and integral equations with varying coefficients using classical orthogonal polynomials, The ultraspherical coefficients of the moments of a general-order derivative of an infinitely differentiable function, On the legendre coefficients of the moments of the general order derivative of an infinitely differentiable function, Error estimates for Miller's algorithm, A reformulation of Olver's algorithm for the numerical solution of second-order difference-equations, Recurrences and explicit formulae for the expansion and connection coefficients in series of classical discrete orthogonal polynomials, Improving a method for computing non-dominant solutions of certain second-order recurrence relations of Poincaré-type, On the connection coefficients and recurrence relations arising from expansions in series of hermite polynomials, Recurrence relation approach for expansion and connection coefficients in series of Hahn polynomials
Cites Work
- Unnamed Item
- The numerical solution of linear recurrence relations
- Relative error propagation in the recursive solution of linear recurrence relations
- An extension of Olver's error estimation technique for linear recurrence relations
- Recursive Computation of the Repeated Integrals of the Error Function
- Computational Aspects of Three-Term Recurrence Relations
- Numerical solution of second-order linear difference equations
- Bounds for the solutions of second-order linear difference equations
- A procedure for summing asymptotic series
- Error Analysis of Miller's Recurrence Algorithm