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.

Creator

• Barden, Jeffrey M.

Colaboradores

• Humi, Mayer

Degree

• MS

Unit

• Mathematical Sciences

Publisher

• Worcester Polytechnic Institute

Language

• English

Identifier

• etd-042413-133119

Palabra Clave

• Quadrature
• Clenshaw-Curtis
• Chebyshev Polynomials

Advisor

• Humi, Mayer

Defense date

• 2013-04-24

Year

• 2013

Date created

• 2013-04-24

Resource type

• Report

Rights statement

• In Copyright