Professor Mayer Humi
This project presents a modified method of numerical integration for a â€œwell behavedâ€� function over the finite interval [-1,1]. Similar to the Clenshaw-Curtis quadrature rule, this new algorithm relies on expressing the integrand as an expansion of Chebyshev polynomials of the second kind. The truncated series is integrated term-by-term yielding an approximation for the integral of which we wish to compute. The modified method is then contrasted with its predecessor Clenshaw-Curtis, as well as the classical method of Gauss-Legendre in terms of convergence behavior, error analysis and computational efficiency. Lastly, illustrative examples are shown which demonstrate the dependence that the convergence has on the given function to be integrated.
Worcester Polytechnic Institute
All authors have granted to WPI a nonexclusive royalty-free license to distribute copies of the work. Copyright is held by the author or authors, with all rights reserved, unless otherwise noted. If you have any questions, please contact email@example.com.
Barden, Jeffrey M., "A Modified Clenshaw-Curtis Quadrature Algorithm" (2013). Masters Theses (All Theses, All Years). 265.
Chebyshev Polynomials, Quadrature, Clenshaw-Curtis