An extremal problem for the Bergman kernel of orthogonal polynomials

arXiv2207.04662MaRDI QIDQ6404567FDOQ6404567

Authors: Stéphane Charpentier, Norm Levenberg, F. Wielonsky

Publication date: 11 July 2022

Abstract: Let

G a m m a s u b s e t m a t h b b C

be a curve of class

C (2, a l p h a)

. For

z_{0}

in the unbounded component of

m a t h b b C s e t m i n u s G a m m a

, and for

n = 1, 2, ...

, let

u_{n}

be a probability measure with supp

(u_{n}) s u b s e t G a m m a

which minimizes the Bergman function

B_{n} (u, z) := s u m_{k = 0}^{n} | q_{k}^{u} (z) |^{2}

at

z_{0}

among all probability measures

u

on

G a m m a

(here,

q_{0}^{u}, l d o t s, q_{n}^{u}

are an orthonormal basis in

L^{2} (u)

for the holomorphic polynomials of degree at most

n

). We show that

{u_{n}}_{n}

tends weak-* to

h a t d e l t a_{z_{0}}

, the balayage of the point mass at

z_{0}

onto

G a m m a

, by relating this to an optimization problem for probability measures on the unit circle. Our proof makes use of estimates for Faber polynomials associated to

G a m m a

.

Mathematics Subject Classification ID

Approximation by polynomials (41A10) Approximation in the complex plane (30E10) Kernel functions in one complex variable and applications (30C40)

This page was built for publication: An extremal problem for the Bergman kernel of orthogonal polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6404567)