Quadrature rules with (not too many) derivatives
Matthew Wiersma

TL;DR
This paper introduces new quadrature formulas that require only endpoint derivatives and provides error bounds based on the function's smoothness, improving efficiency in numerical integration.
Contribution
It presents novel quadrature rules with minimal derivative evaluations at endpoints and derives error bounds for functions with different smoothness conditions.
Findings
Quadrature formulas requiring only endpoint derivatives are identified.
Error bounds are established for functions with various smoothness assumptions.
The methods improve efficiency in numerical integration by reducing derivative evaluations.
Abstract
Quadrature formulas for where derivative terms need only be evaluated at and in the composite rule are identified. Error bounds are given when satisfies is absolutely continuous so that , and when is merely continuous.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical functions and polynomials · Differential Equations and Boundary Problems · Algebraic and Geometric Analysis
