A new algorithm for unstable three term recurrence relations
DOI10.1016/0096-3003(87)90073-7zbMATH Open0625.65133OpenAlexW2082809284MaRDI QIDQ579909FDOQ579909
Authors: Seenith Sivasundaram, Donato Trigiante 
Publication date: 1987
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0096-3003(87)90073-7
Recommendations
- scientific article; zbMATH DE number 3990816
- Is the recurrence relation for orthogonal polynomials always stable?
- Publication:3201711
- Transitory minimal solutions of hypergeometric recursions and pseudoconvergence of associated continued fractions
- Three term recurrence for the evaluation of multivariate orthogonal polynomials
efficiencyerror boundsnumerical examplesMiller algorithmfundamental systemlinear homogeneous difference equations of second orderOlver algorithmPerron's theoremstable algorithmsUnstable three term recurrence relationsPoincarés theorem
Cites Work
- Computational Aspects of Three-Term Recurrence Relations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Numerical solution of second-order linear difference equations
- A mathematical analysis of Miller's algorithm
- A note on the iterative solution of recurrence relations
- Use of Olver's algorithm to evaluate certain definite integrals of plasma physics involving Chebyshev polynomials
- Title not available (Why is that?)
Cited In (6)
This page was built for publication: A new algorithm for unstable three term recurrence relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q579909)
