2000 character limit reached
The boundary Carathéodory-Fejér interpolation problem
Published 5 Nov 2010 in math.CV | (1011.1399v2)
Abstract: We give an elementary proof of a solvability criterion for the {\em boundary Carath\'{e}odory-Fej\'{e}r problem}: given a point $x \in \R$ and, a finite set of target values, to construct a function $f$ in the Pick class such that the first few derivatives of $f$ take on the prescribed target values at $x$. We also derive a linear fractional parametrization of the set of solutions of the interpolation problem. The proofs are based on a reduction method due to Julia and Nevanlinna.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.