Read More
Date: 14-12-2021
![]()
Date: 14-12-2021
![]()
Date: 7-12-2021
![]() |
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
|
|
للعاملين في الليل.. حيلة صحية تجنبكم خطر هذا النوع من العمل
|
|
|
|
|
"ناسا" تحتفي برائد الفضاء السوفياتي يوري غاغارين
|
|
|
|
|
ملاكات العتبة العباسية المقدسة تُنهي أعمال غسل حرم مرقد أبي الفضل العباس (عليه السلام) وفرشه
|
|
|