Clenshaw%E2%80%93Curtis%20quadrature%20formula
(0.004 seconds)
1—10 of 336 matching pages
1: Bibliography C
2: 29.20 Methods of Computation
3: 3.5 Quadrature
4: Bibliography P
5: 18.40 Methods of Computation
A numerical approach to the recursion coefficients and quadrature abscissas and weights
… ►Results of low ( to decimal digits) precision for are easily obtained for to . … ►The quadrature points and weights can be put to a more direct and efficient use. …6: Bibliography T
7: 28.34 Methods of Computation
Solution of the systems of linear algebraic equations (28.4.5)–(28.4.8) and (28.14.4), with the conditions (28.4.9)–(28.4.12) and (28.14.5), by boundary-value methods (§3.6) to determine the Fourier coefficients. Subsequently, the Fourier series can be summed with the aid of Clenshaw’s algorithm (§3.11(ii)). See Meixner and Schäfke (1954, §2.87). This procedure can be combined with §28.34(ii)(d).
8: Bibliography O
9: Bibliography W
10: 6.20 Approximations
Cody and Thacher (1968) provides minimax rational approximations for , with accuracies up to 20S.
Cody and Thacher (1969) provides minimax rational approximations for , with accuracies up to 20S.
MacLeod (1996b) provides rational approximations for the sine and cosine integrals and for the auxiliary functions and , with accuracies up to 20S.
Clenshaw (1962) gives Chebyshev coefficients for for and for (20D).