A Modified Clenshaw-Curtis Quadrature Algorithm
PublicDownloadable Content
open in viewerThis 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
- Contributors
- Degree
- Unit
- Publisher
- Language
- English
- Identifier
- etd-042413-133119
- Keyword
- Advisor
- Defense date
- Year
- 2013
- Date created
- 2013-04-24
- Resource type
- Rights statement
Relations
- In Collection:
Items
Items
Thumbnail | Title | Visibility | Embargo Release Date | Actions |
---|---|---|---|---|
A_Modified_Clenshaw-Curtis_Quadrature_Algorithm.pdf | Public | Download |
Permanent link to this page: https://digital.wpi.edu/show/g158bh42h