Comment by tim-kt
6 months ago
> [...] almost all methods of numerical integration (in any case all those that are useful and I am aware of) are equivalent to approximating the target function with another simpler function, which is then integrated using an exact formula.
The key property of quadrature formulas (i.e. numerical integration formulas) is the degree of exactness, which just says up to which degree we can integrate polynomials exactly. The (convergence of the) error of the quadrature depends on this exactness degree.
If you approximate the integral using a sum of n+1 weights and function evaluations, then any quadrature that has exactness degree n or better is in fact an interpolatory quadrature, that is, it is equivalent to interpolating your function on the n+1 nodes and integrating the polynomial. You can check this by (exactly) integrating the Lagrange basis polynomials, through which you can express the interpolation polynomial.
Something interesting here is that although Clenshaw-Curtis rules with N nodes only exactly integrate degree N-1 polynomials while Gauss rules integrate degree 2N-1, they are frequently competitive with Gauss rules when integrating general analytic functions. So while the space of polynomials being integrated is crucial, there are nevertheless many possible interpolatory quadrature rules and how they behave is not completely straightforward.