Chebyshev-type Quadratures for Doubling Weights
Shoni Gilboa, Ron Peled

TL;DR
This paper extends existing research on Chebyshev-type quadratures by applying Kane's method to establish tight bounds on the minimal number of nodes needed for doubling weight functions, building on Bernstein's foundational work.
Contribution
It introduces a novel application of Kane's method to derive bounds for Chebyshev-type quadratures with doubling weights, advancing the theoretical understanding of quadrature node requirements.
Findings
Established tight bounds for minimal nodes in Chebyshev-type quadratures
Extended classical results to doubling weight functions
Connected modern methods with historical quadrature theory
Abstract
A Chebyshev-type quadrature for a given weight function is a quadrature formula with equal weights. In this work we show that a method presented by Kane may be used to produce tight bounds for the minimal number of nodes required in Chebyshev-type quadratures for doubling weight functions. This extends a long line of research on Chebyshev-type quadratures starting with the 1937 work of Bernstein.
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.
