Read More
Date: 10-12-2021
771
Date: 10-12-2021
520
Date: 14-12-2021
807
|
The downward Clenshaw recurrence formula evaluates a sum of products of indexed coefficients by functions which obey a recurrence relation. If
(1) |
and
(2) |
where the s are known, then define
(3) |
|||
(4) |
for and solve backwards to obtain and .
(5) |
(6) |
|||
(7) |
|||
(8) |
|||
(9) |
|||
(10) |
The upward Clenshaw recurrence formula is
(11) |
(12) |
for .
(13) |
REFERENCES:
Press, W. H.; Flannery, B. P.; Teukolsky, S. A.; and Vetterling, W. T. "Recurrence Relations and Clenshaw's Recurrence Formula." §5.5 in Numerical Recipes in FORTRAN: The Art of Scientific Computing, 2nd ed. Cambridge, England: Cambridge University Press, pp. 172-178, 1992
|
|
لصحة القلب والأمعاء.. 8 أطعمة لا غنى عنها
|
|
|
|
|
حل سحري لخلايا البيروفسكايت الشمسية.. يرفع كفاءتها إلى 26%
|
|
|
|
|
قسم الحزام الأخضر الجنوبي ينظّم حفلاً بذكرى ولادة الإمام علي (عليه السلام)
|
|
|