What is a three-term recurrence relation?
A three-term recurrence relation is a mathematical equation that defines each term in a sequence using the two preceding terms. In numerical analysis, a standard homogeneous linear form calculates the next term from the prior two based on governing coefficient sequences and initial values. Functions defined by these relations, such as orthogonal polynomials, enable efficient computational algorithms.
What we know
- A standard homogeneous linear three-term recurrence relation expresses term y_{n+1} as a_n y_n + b_n y_{n-1}, governed by coefficient sequences a_n and b_n together with initial values y_0 and y_1. [2]
- The Clenshaw algorithm generalizes Horner's method to evaluate linear combinations of any class of functions defined by a three-term recurrence relation. [3]
- Kravchuk polynomials are discrete orthogonal polynomials associated with the binomial distribution that form sequences generated by recursive terms. [5]
Where to go next
- the bigger pictureHow do general recurrence relations work in mathematics?
- how it workedHow does the Clenshaw algorithm evaluate function series?
- a case in pointWhat are Kravchuk polynomials?
- compared withHow does Horner's method compare to Clenshaw summation?
- how we knowHow do orthogonal polynomials enable Gaussian quadrature?
- an unexpected connectionHow do three-term recurrences assist numerical integration?Functions defined by three-term recurrence relations produce orthogonal polynomials whose roots supply the exact nodes for accurate Gaussian quadrature calculations.
Sources
- [1]Three-term recurrence relation (Wikidata Q131191614) · CC0 1.0
- [2]Three-term recurrence relation · CC BY-SA 4.0
- [3]Clenshaw algorithm · CC BY-SA 4.0
- [4]Gaussian quadrature · CC BY-SA 4.0
- [5]Kravchuk polynomials · CC BY-SA 4.0
Your path
- What does the Nile mosaic of Palestrina depict?
- What is a three-term recurrence relation?