Optimization approaches to quadrature: new characterizations of Gaussian quadrature on the line and quadrature with few nodes on plane algebraic curves, on the plane and in higher dimensions
Cordian Riener, Markus Schweighofer

TL;DR
This paper develops new optimization-based methods to construct Gaussian quadrature rules on algebraic curves and cubature rules in higher dimensions, minimizing specific polynomial values and generalizing classical quadrature results.
Contribution
It introduces novel characterizations of Gaussian quadrature on algebraic curves and extends cubature rules with few nodes to higher dimensions using optimization techniques.
Findings
Existence of quadrature rules with nodes on algebraic curves
Bound on the number of nodes for cubature rules in 2D
Characterization of Gaussian quadrature as a minimizer of polynomial values
Abstract
Let and be positive integers. Let be a positive Borel measure on possessing finite moments up to degree . If the support of is contained in an algebraic curve of degree , then we show that there exists a quadrature rule for with at most many nodes all placed on the curve (and positive weights) that is exact on all polynomials of degree at most . This generalizes both Gauss and (the odd degree case of) Szeg\H{o} quadrature where the curve is a line and a circle, respectively, to arbitrary plane algebraic curves. We use this result to show that, without any hypothesis on the support of , there is always a cubature rule for with at most many nodes. In both results, we show that the quadrature or cubature rule can be chosen such that its value on a certain positive definite form of degree is…
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.
