References
The theory summarised in Numerical Quadrature and the derivations in Quadrature Rules follow the sources listed below.
For the Chebyshev-based rules, Trefethen [1] is the natural starting point: it settles the question of how Clenshaw-Curtis compares with Gauss quadrature in practice and gives the taxonomy of the three Chebyshev variants. The construction of the Clenshaw-Curtis weights used in this package follows Reid [15]; Waldvogel [18] gives the fast $O(n \log n)$ alternative. Davis and Rabinowitz [19] is the standard monograph on numerical integration, and Trefethen [20] covers the approximation theory that the convergence results rest on.
The tanh-sinh rule goes back to Takahasi and Mori [4], who introduced the double-exponential transformation; Mori and Sugihara [5] surveys it and its relatives, and Mori [6] tells the story of its discovery. Trefethen and Weideman [3] explains why the trapezoidal rule underlying it is spectrally accurate on the real line, and Bailey et al. [7] documents its role as the standard scheme for high-precision quadrature.
- [1]
- L. N. Trefethen. Is Gauss Quadrature Better than Clenshaw-Curtis? SIAM Review 50, 67–87 (2008).
- [2]
- J. P. Imhof. On the method for numerical integration of Clenshaw and Curtis. Numerische Mathematik 5, 138–141 (1963).
- [3]
- L. N. Trefethen and J. A. Weideman. The Exponentially Convergent Trapezoidal Rule. SIAM Review 56, 385–458 (2014).
- [4]
- H. Takahasi and M. Mori. Double Exponential Formulas for Numerical Integration. Publications of the Research Institute for Mathematical Sciences 9, 721–741 (1974).
- [5]
- M. Mori and M. Sugihara. The double-exponential transformation in numerical analysis. Journal of Computational and Applied Mathematics 127, 287–296 (2001).
- [6]
- M. Mori. Discovery of the Double Exponential Transformation and Its Developments. Publications of the Research Institute for Mathematical Sciences 41, 897–935 (2005).
- [7]
- D. H. Bailey, K. Jeyabalan and X. S. Li. A Comparison of Three High-Precision Quadrature Schemes. Experimental Mathematics 14, 317–329 (2005).
- [8]
- G. H. Golub and J. H. Welsch. Calculation of Gauss quadrature rules. Mathematics of Computation 23, 221–230 (1969).
- [9]
- R. Radau. Étude sur les formules d'approximation qui servent à calculer la valeur numérique d'une intégrale définie. Journal de Mathématiques Pures et Appliquées 6, 283–336 (1880).
- [10]
- W. Gautschi. Gauss–Radau formulae for Jacobi and Laguerre weight functions. Mathematics and Computers in Simulation 54, 403–412 (2000).
- [11]
- E. Hairer and G. Wanner. Solving Ordinary Differential Equations II: Stiff and Differential-Algebraic Problems. 2 Edition, Vol. 14 of Springer Series in Computational Mathematics (Springer, Berlin, Heidelberg, 1996).
- [12]
- J. P. Boyd. Chebyshev and Fourier Spectral Methods. 2nd Edition (Dover Publications, 2001).
- [13]
- L. Fejér. Mechanische Quadraturen mit positiven Cotesschen Zahlen. Mathematische Zeitschrift 37, 287–309 (1933).
- [14]
- C. W. Clenshaw and A. R. Curtis. A method for numerical integration on an automatic computer. Numerische Mathematik 2, 197–205 (1960).
- [15]
- M. T. Reid. 18.330 Lecture Notes: Clenshaw-Curtis Quadrature. Course notes for 18.330, Massachusetts Institute of Technology. No longer available online; the derivation is reproduced in the Clenshaw-Curtis section of this documentation.
- [16]
- H. O'Hara and F. J. Smith. Error estimation in the Clenshaw-Curtis quadrature formula. The Computer Journal 11, 213–219 (1968).
- [17]
- W. M. Gentleman. Implementing Clenshaw-Curtis quadrature, I methodology and experience. Communications of the ACM 15, 337–342 (1972).
- [18]
- J. Waldvogel. Fast construction of the Fejér and Clenshaw-Curtis quadrature rules. BIT Numerical Mathematics 46, 195–202 (2006).
- [19]
- P. J. Davis and P. Rabinowitz. Methods of Numerical Integration. 2nd Edition (Academic Press, 1984).
- [20]
- L. N. Trefethen. Approximation Theory and Approximation Practice, Extended Edition (Society for Industrial and Applied Mathematics, 2019).