scientific article; zbMATH DE number 3990816
[For the entire collection see Zbl 0599.00010.] Three-term recurrences appear in a natural way in the study of group representations, discretization methods and further topics of mathematics. Since three-term recurrences form a suitable basis for creating numerical algorithms of computation values of special functions, or their derivatives and of constructing solutions to discretized problems a need of numerical analysis of such recurrences has already engaged many specialists to consider three-term recurrences from point of view of numerical analysis. In our contribution we present a general numerically stable method of solving three-term recurrences.
- A new algorithm for unstable three term recurrence relations
- Three term recurrence for the evaluation of multivariate orthogonal polynomials
- Is the recurrence relation for orthogonal polynomials always stable?
- Computational properties of three-term recurrence relations for Kummer functions
- On the numerical evaluation of linear recurrences
- Computational properties of three-term recurrence relations for Kummer functions
- On the nonnegative solution of a Freud three-term recurrence
- On Ternary Integral Recurrences
- scientific article; zbMATH DE number 5947802 (Why is no real title available?)
- A new algorithm for unstable three term recurrence relations
- An ubiquitous three-term recurrence relation
- The signs of three-term recurrence sequences
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3753439)