Related papers: On rational approximation of algebraic functions

We present a new rational approximation algorithm based on the empirical interpolation method for interpolating a family of parametrized functions to rational polynomials with invariant poles, leading to efficient numerical algorithms for…

Unlike polynomials, rational functions can represent functions having poles or branch cuts with root-exponential convergence and no Runge phenomenon. Recent developments of the AAA and greedy Thiele algorithms have sparked renewed interest…

Given a vector function ${\bf F}=(F_1,\ldots,F_d),$ analytic on a neighborhood of some compact subset $E$ of the complex plane with simply connected complement, we define a sequence of vector rational functions with common denominator in…

Let $A$ be a square complex matrix; $z_1$, ..., $z_{N}\in\mathbb C$ be arbitrary (possibly repetitive) points of interpolation; $f$ be an analytic function defined on a neighborhood of the convex hull of the union of the spectrum…

A new algebraic object is introduced - recurrent fractions, which is an n-dimensional generalization of continued fractions. It is used to describe an algorithm for rational approximations of algebraic irrational numbers. Some…

In this article we obtain new irrationality measures for values of functions which belong to a certain class of hypergeometric functions including shifted logarithmic functions, binomial functions and shifted exponential functions. We…

In this work we develop an algorithmic procedure for associating a function defined on the Riemann surface of the $\log$ to given asymptotic data from a function at an essential singularity. We do this by means of rational approximations…

We investigate the rational approximation of fractional powers of unbounded positive operators attainable with a specific integral representation of the operator function. We provide accurate error bounds by exploiting classical results in…

This article describes a sequence of rational functions which converges locally uniformly to the zeta function. The numerators (and denominators) of these rational functions can be expressed as characteristic polynomials of matrices that…

Given a system of functions $\textup{\textbf{F}}=(F_1,\ldots,F_d),$ analytic on a neighborhood of some compact subset $E$ of the complex plane with simply connected complement, we define a sequence of vector rational functions with common…

Let $r_1,\ldots,r_s:\mathbb{Z}_{n\geqslant 0}\to\mathbb{C}$ be linearly recurrent sequences whose associated eigenvalues have arguments in $\pi\mathbb{Q}$ and let $F(z):=\sum_{n\geqslant 0}f(n)z^n$, where $f(n)\in\{r_1(n),\ldots,$…

We consider sequences of rational interpolants $r_n(z)$ of degree $n$ to the exponential function $e^z$ associated to a triangular scheme of complex points $\{z_{j}^{(2n)}\}_{j=0}^{2n}$, $n>0$, such that, for all $n$, $|z_{j}^{(2n)}|\leq…

Functions with singularities are notoriously difficult to approximate with conventional approximation schemes. In computational applications, they are often resolved with low-order piecewise polynomials, multilevel schemes, or other types…

We present a new method for approximating real-valued functions on ${\mathbb R}^+$ by linear combinations of exponential functions with complex coefficients. The approach is based on a multi-point Pad\'e approximation of the Laplace…

Let $\sum a_nx^n\in\bar{\mathbb{Q}}[[x]]$ be the power series representation of a rational function and let $f:\ \{0,1,\ldots\}\rightarrow \bar{\mathbb{Q}}$ be a so-called almost quasi-polynomial. Under a necessary stability condition, we…

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{\C} \setminus A), \sharp A <\infty. J. Nuttall has put…

In 1923 Schur considered the following problem. Let f(X) be a polynomial with integer coefficients that induces a bijection on the residue fields Z/pZ for infinitely many primes p. His conjecture, that such polynomials are compositions of…

A set $R\subset \mathbb{N}$ is called rational if it is well-approximable by finite unions of arithmetic progressions. Examples of rational sets include many classical sets of number-theoretical origin such as the set of squarefree numbers,…

We present a new method for the reconstruction of rational functions through finite-fields sampling that can significantly reduce the number of samples required. The method works by exploiting all the independent linear relations among…

Let $\Re_n$ be the set of all rational functions of the type $r(z) = p(z)/w(z),$ where $p(z)$ is a polynomial of degree at most $n$ and $w(z) = \prod_{j=1}^{n}(z-a_j)$, $|a_j|>1$ for $1\leq j\leq n$. In this paper, we set up some results…