language-icon Old Web
English
Sign In

Adaptive quadrature

Adaptive quadrature is a numerical integration method in which the integral of a function f ( x ) {displaystyle f(x)} is approximated using static quadrature rules on adaptively refined subintervals of the integration domain. Generally, adaptive algorithms are just as efficient and effective as traditional algorithms for 'well behaved' integrands, but are also effective for 'badly behaved' integrands for which traditional algorithms fail. Adaptive quadrature is a numerical integration method in which the integral of a function f ( x ) {displaystyle f(x)} is approximated using static quadrature rules on adaptively refined subintervals of the integration domain. Generally, adaptive algorithms are just as efficient and effective as traditional algorithms for 'well behaved' integrands, but are also effective for 'badly behaved' integrands for which traditional algorithms fail.

[ "Quadrature modulation", "Clenshaw–Curtis quadrature", "Quadrature (mathematics)", "Chebyshev–Gauss quadrature" ]
Parent Topic
Child Topic
    No Parent Topic