A unified framework for the computation of polynomial quadrature weights and errors

Abstract

For the class of polynomial quadrature rules we show that conveniently chosen bases allow to compute both the weights and the theoretical error expression of a $n$-point rule via the undetermined coefficients method. As an illustration, the framework is applied to some classical rules such as Newton-Cotes, Adams-Bashforth, Adams-Moulton and Gaussian rules.

arXiv commentMinor misprints corrected

Cited by in corpus (3)

• Exact Wavelets on the Ball
• Quadrature as a least-squares and minimax problem
• Root Finding by High Order Iterative Methods Based on Quadratures