Orthogonal polynomials, reproducing kernels, and zeros of optimal approximants
Catherine B\'en\'eteau, Dmitry Khavinson, Constanze Liaw, Daniel Seco,, and Alan A. Sola

TL;DR
This paper explores the relationships between orthogonal polynomials, reproducing kernels, and optimal polynomial approximants in various function spaces, revealing zero distributions and providing methods for their computation.
Contribution
It establishes new connections between extremal polynomials and orthogonal polynomial theory across different weighted spaces, including zero location insights.
Findings
Extremal polynomials are non-vanishing in the closed unit disk for certain spaces.
Zeros of extremal polynomials can move inside the disk for negative alpha.
Provides formulas and methods for computing approximation distances using orthogonal polynomials.
Abstract
We study connections between orthogonal polynomials, reproducing kernel functions, and polynomials minimizing Dirichlet-type norms for a given function . For (which includes the Hardy and Dirichlet spaces of the disk) and general , we show that such extremal polynomials are non-vanishing in the closed unit disk. For negative , the weighted Bergman space case, the extremal polynomials are non-vanishing on a disk of strictly smaller radius, and zeros can move inside the unit disk. We also explain how , where is the space of polynomials of degree at most , can be expressed in terms of quantities associated with orthogonal polynomials and kernels, and we discuss methods for computing the quantities in question.
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.
