Clenshaw algorithm
In numerical analysis, the Clenshaw algorithm, also called Clenshaw summation, is a recursive method to evaluate a linear combination of Chebyshev polynomials. It is a generalization of Horner's method for evaluating a linear combination of monomials. It generalizes to more than just Chebyshev polynomials; it applies to any class of functions that can be defined by a three-term recurrence relation.
Wikipage redirect
primaryTopic
Clenshaw algorithm
In numerical analysis, the Clenshaw algorithm, also called Clenshaw summation, is a recursive method to evaluate a linear combination of Chebyshev polynomials. It is a generalization of Horner's method for evaluating a linear combination of monomials. It generalizes to more than just Chebyshev polynomials; it applies to any class of functions that can be defined by a three-term recurrence relation.
has abstract
Algorytm Clenshawa – rekurency ...... owego równania rekurencyjnego.
@pl
Der Clenshaw-Algorithmus ist e ...... ome rekursiv berechnen lassen.
@de
En analyse numérique, l’algori ...... ation de récurrence d'ordre 2.
@fr
In numerical analysis, the Cle ...... hree-term recurrence relation.
@en
في التحليل العددي، خوارزمية كل ...... بعلاقة تكرارية ثلاثية الحدود.
@ar
在数值分析中，Clenshaw递推公式 (由Charles William Clenshaw发现)是一个求切比雪夫多项式的值的递归方法。
@zh
Wikipage page ID
Wikipage revision ID
678,806,415
subject
comment
Algorytm Clenshawa – rekurency ...... owego równania rekurencyjnego.
@pl
Der Clenshaw-Algorithmus ist e ...... ome rekursiv berechnen lassen.
@de
En analyse numérique, l’algori ...... ation de récurrence d'ordre 2.
@fr
In numerical analysis, the Cle ...... hree-term recurrence relation.
@en
في التحليل العددي، خوارزمية كل ...... بعلاقة تكرارية ثلاثية الحدود.
@ar
在数值分析中，Clenshaw递推公式 (由Charles William Clenshaw发现)是一个求切比雪夫多项式的值的递归方法。
@zh
label
Algorithme de Clenshaw
@fr
Algorytm Clenshawa
@pl
Clenshaw algorithm
@en
Clenshaw-Algorithmus
@de
Clenshaw递推公式
@zh
خوارزمية كلنشو
@ar