Fast Construction of the Fejér and Clenshaw–Curtis Quadrature Rules
By Jörg Waldvogel. 2006
188 citations recorded by the source corpus.
Subfields: Applied Mathematics, Atomic and Molecular Physics, and Optics, Numerical Analysis
View Paper: https://www.semanticscholar.org/paper/3775886f2f9354dff2d88778c00a1c0f10aac6ce
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Applied Mathematics
- Szymon Jaroszewicz
- Marcin Korzen
- Lloyd N. Trefethen
- Sheehan Olver
- Anirvan Chakraborty
- Jean-Paul Berrut
- Georges Klein
- Probal Chaudhuri
In Atomic and Molecular Physics, and Optics
- Szymon Jaroszewicz
- Marcin Korzen
- Lloyd N. Trefethen
- B. McKeon
- Matthew Kelly
- Sheehan Olver
- J. A. Hernández
- Miguel Hermanns
In Numerical Analysis
- Szymon Jaroszewicz
- Marcin Korzen
- Lloyd N. Trefethen
- Sheehan Olver
- J. Andre Weideman
- Georges Klein
- Jean-Paul Berrut
- Uri M. Ascher
Citations in the corpus
- Is Gauss Quadrature Better than Clenshaw-Curtis? (2008, methodology): “3For FFT evaluations of the other two rules, see [59].”
- Arithmetic Operations on Independent Random Variables: A Numerical Approach (2012, methodology): “For finite intervals we use Clenshaw–Curtis and Fejér quadratures as described in [20, 21].”
- Six myths of polynomial interpolation and quadrature (2011, methodology): “Clenshaw–Curtis is easy to implement, using either the Fast Fourier Transform or by an algorithm of Waldvogel in 2006 [9], and one reason it gets little attention may be that Gauss quadrature had a big head start, invented in 1814 [10] instead of 1960 [11].”