Clenshaw-Curtis

Implementing Clenshaw-Curtis quadrature, I methodology and experience. Clenshaw-Curtis quadrature is a particularly important automatic quadrature scheme for a variety of reasons, especially the high accuracy obtained from relatively few integrand values. However, it has received little use because it requires the computation of a cosine transformation, and the arithmetic cost of this has been prohibitive. This paper is in two parts; a companion paper, “II Computing the Cosine Transformation,” shows that this objection can be overcome by computing the cosine transformation by a modification of the fast Fourier transform algorithm. This first part discusses the strategy and various error estimates, and summarizes experience with a particular implementation of the scheme.

This software is also peer reviewed by journal TOMS.

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element

References in zbMATH (referenced in 41 articles )

Showing results 1 to 20 of 41.
Sorted by year (citations)

1 2 3 next

  1. Nakatsukasa, Yuji; Townsend, Alex: Error localization of best (L_1) polynomial approximants (2021)
  2. Boullé, Nicolas; Townsend, Alex: Computing with functions in the ball (2020)
  3. Ceniceros, Hector D.: Efficient order-adaptive methods for polymer self-consistent field theory (2019)
  4. Gilles, Marc Aurèle; Townsend, Alex: Continuous analogues of Krylov subspace methods for differential operators (2019)
  5. Hasegawa, Takemitsu; Sugiura, Hiroshi: Uniform approximation to finite Hilbert transform of oscillatory functions and its algorithm (2019)
  6. Liu, Guidong; Xiang, Shuhuang: Clenshaw-Curtis-type quadrature rule for hypersingular integrals with highly oscillatory kernels (2019)
  7. Hasegawa, Takemitsu; Sugiura, Hiroshi: Uniform approximation to Cauchy principal value integrals with logarithmic singularity (2018)
  8. Kang, Myeongmin; Jung, Miyoun; Kang, Myungjoo: Higher-order regularization based image restoration with automatic regularization parameter selection (2018)
  9. Townsend, Alex; Webb, Marcus; Olver, Sheehan: Fast polynomial transforms based on Toeplitz and Hankel matrices (2018)
  10. Wang, Haiyong: On the convergence rate of Clenshaw-Curtis quadrature for integrals with algebraic endpoint singularities (2018)
  11. Hasegawa, Takemitsu; Sugiura, Hiroshi: A user-friendly method for computing indefinite integrals of oscillatory functions (2017)
  12. Lewanowicz, Stanisław; Keller, Paweł; Woźny, Paweł: Constrained approximation of rational triangular Bézier surfaces by polynomial triangular Bézier surfaces (2017)
  13. Motygin, Oleg V.: Numerical approximation of oscillatory integrals of the linear ship wave theory (2017)
  14. Ruijter, M. J.; Oosterlee, C. W.: A Fourier cosine method for an efficient computation of solutions to BSDEs (2015)
  15. Domínguez, V.; Graham, I. G.; Smyshlyaev, V. P.: Stability and error estimates for Filon-Clenshaw-Curtis rules for highly oscillatory integrals (2011)
  16. Hasegawa, Takemitsu; Sugiura, Hiroshi: Algorithms for approximating finite Hilbert transform with end-point singularities and its derivatives (2011)
  17. Sugiura, Hiroshi; Hasegawa, Takemitsu: A polynomial interpolation process at quasi-Chebyshev nodes with the FFT (2011)
  18. Keller, Paweł; Woźny, Paweł: On the convergence of the method for indefinite integration of oscillatory and singular functions (2010)
  19. Hasegawa, Takemitsu; Sugiura, Hiroshi: Uniform approximation to fractional derivatives of functions of algebraic singularity (2009)
  20. Wang, Haiyong; Xiang, Shuhuang: Uniform approximations to Cauchy principal value integrals of oscillatory functions (2009)

1 2 3 next