Padé approximants for functions with branch points — strong asymptotics of Nuttall–Stahl polynomials

By Alexander I. Aptekarev, Maxim L. Yattselev. 2011

68 citations recorded by the source corpus.

Let f be a germ of an analytic function at infinity that can be analytically continued along any path in the complex plane deprived of a finite set of points, $${f \in \mathcal{A}(\bar{\mathbb{C}} \setminus A)}$$f∈A(C¯\A), $${\# A< \infty}$$#A<∞. J. Nuttall has put forward the important relation between the maximal domain of f where the function has a single-valued branch and the domain of convergence of the diagonal Padé approximants for f. The Padé approximants, which are rational functions and thus single-valued, approximate a holomorphic branch of f in the domain of their convergence. At the same time most of their poles tend to the boundary of the domain of convergence and the support of their limiting distribution models the system of cuts that makes the function f single-valued. Nuttall has conjectured (and proved for many important special cases) that this system of cuts has minimal logarithmic capacity among all other systems converting the function f to a single-valued branch. Thus the domain of convergence corresponds to the maximal (in the sense of minimal boundary) domain of single-valued holomorphy for the analytic function $${f\in\mathcal{A}(\bar{\mathbb{C}} \setminus A)}$$f∈A(C¯\A). The complete proof of Nuttall’s conjecture (even in a more general setting where the set A has logarithmic capacity 0) was obtained by H. Stahl. In this work, we derive strong asymptotics for the denominators of the diagonal Padé approximants for this problem in a rather general setting. We assume that A is a finite set of branch points of f which have the algebro-logarithmic character and which are placed in a generic position. The last restriction means that we exclude from our consideration some degenerated “constellations” of the branch points.

Subfields: Applied Mathematics

View Paper: https://www.semanticscholar.org/paper/b7deefbc9519c27d990fbbf83d9bcfd858f7e218

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Applied Mathematics

Citations in the corpus

The AAA Algorithm for Rational Approximation (2016, background): “ithms have been proposed over the years. Probably nobody has a complete view of this terrain, as the developments have occurred in diverse elds including often highly theoretical approximation theory [3, 4, 16, 30, 47, 48, 50, 54, 55, 56, 57, 60, 61], physics [6, 29, 31, 32, 33], systems and control”