Related papers: $L^2$ and $L^\infty$ rational approximation
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…
Let f be holomorphically continuable over the complex plane except for finitely many branch points contained in the unit disk. We prove that best rational approximants to f of degree n, in the L^2-sense on the unit circle, have poles that…
We calculate the least upper bounds for approximations in the metric of the space $L_2$ by linear methods of summation of Fourier series on classes of periodic functions $L^\psi_{\bar\beta,1}$ defined by sequences of multipliers…
Over the past a few years, research and development has made significant progresses on big data analytics. A fundamental issue for big data analytics is the efficiency. If the optimal solution is unable to attain or not required or has a…
Rational approximation appears in many contexts throughout science and engineering, playing a central role in linear systems theory, special function approximation, and many others. There are many existing methods for solving the rational…
We comment on recent results in the field of information based complexity, which state (in a number of different settings), that approximation of infinitely differentiable functions is intractable and suffers from the curse of…
We construct Monte Carlo methods for the $L^2$-approximation in Hilbert spaces of multivariate functions sampling no more than $n$ function values of the target function. Their errors catch up with the rate of convergence and the…
Computing rational minimax approximations can be very challenging when there are singularities on or near the interval of approximation - precisely the case where rational functions outperform polynomials by a landslide. We show that far…
A reasonably complete theory of the approximation of an irrational by rational fractions whose numerators and denominators lie in prescribed arithmetic progressions is developed in this paper. Results are both, on the one hand, from a…
The Iterative Rational Krylov Algorithm (IRKA) of [8] is an interpolatory model reduction approach to the optimal $\mathcal{H}_2$ approximation problem. Even though the method has been illustrated to show rapid convergence in various…
A collection of algorithms is described for numerically computing with smooth functions defined on the unit disk. Low rank approximations to functions in polar geometries are formed by synthesizing the disk analogue of the double Fourier…
We provide theory for computing the lower semi-continuous convex envelope of functionals of the type f(x) plus an l2 misfit, and discuss applications to various non-convex optimization problems. The latter term is a data fit term whereas f…
We present one of the approaches to find the best approximation of the given function by trigonometric polynomials in $L^1$ metric and applied it to find the optimal constants in the Nikolsky's type inequality, concerning approximation of…
In this paper we consider one particular mathematical problem of this large area of fractional powers of self-adjoined elliptic operators, defined either by Dunford-Taylor-like integrals or by the representation through the spectrum of the…
We show that the $L^2$ integral mean on $r\D$ of an analytic function in the unit disk $\D$ with respect to the weighted area measure $(1-|z|^2)^\alpha\,dA(z)$, where $-3\le\alpha\le0$, is a logarithmically convex function of $r$ on…
Rational best approximations (in a Chebyshev sense) to real functions are characterized by an equioscillating approximation error. Similar results do not hold true for rational best approximations to complex functions in general. In the…
Here we study theoretically and compare experimentally an efficient method for solving systems of algebraic equations, where the matrix comes from the discretization of a fractional diffusion operator. More specifically, we focus on…
We study approximation of embeddings between finite dimensional L_p spaces in the quantum model of computation. For the quantum query complexity of this problem matching (up to logarithmic factors) upper and lower bounds are obtained. The…
The aim of this paper is to prove upper and lower $L^p$ estimates, $1<p<\infty$, for Littlewood-Paley square functions in the rational Dunkl setting.
We consider the problem of finding a rational function in barycentric form to approximate a given function or data set in $\mathbb{R}$ or $\mathbb{C}$. The famous AAA algorithm, introduced in 2018, constructs such a rational function: the…