English
Related papers

Related papers: $L^2$ and $L^\infty$ rational approximation

200 papers

We generalize a classical result by A.Macintyre and W.Rogosinski on best $H^p$--approximation in $L^p$ of rational functions. For each inner function $\theta$ we give a description of $H^p$--badly approximable functions in $\bar \theta…

Complex Variables · Mathematics 2013-09-26 R. V. Bessonov

We derive lower bounds in best rational approximation of given degree to finite Blaschke products, in the Hardy space $H^2$ of the unit disk. We first consider approximation to $z^N$, and then move on to more general Blaschke products whose…

Classical Analysis and ODEs · Mathematics 2026-03-18 Laurent Baratchart , Alexander Borichev , Sylvain Chevillard , Claire Coiffard Marre , Rachid Zarouf

We derive optimal order a posteriori error estimates in the $L^\infty(L^2)$ and $L^1(L^2)$-norms for the fully discrete approximations of time fractional parabolic differential equations. For the discretization in time, we use the $L1$…

Numerical Analysis · Mathematics 2023-11-14 Jiliang Cao , Wansheng Wang , Aiguo Xiao

For a given irrational number, we consider the properties of best rational approximations of given parities. There are three different kinds of rational numbers according to the parity of the numerator and denominator, say odd/odd, even/odd…

Number Theory · Mathematics 2024-03-20 Dong Han Kim , Seul Bee Lee , Lingmin Liao

We derive some lower bounds in rational approximation of given degree to functions in the Hardy space $H^2$ of the disk. We apply these to asymptotic errors rates in approximation to Blaschke products and to Cauchy integrals on geodesic…

Complex Variables · Mathematics 2015-03-25 Laurent Baratchart , Sylvain Chevillard , Tao Qian

Let $ f(z)=\int(z-x)^{-1}d\mu(x) $, where $ \mu $ is a Borel measure supported on several subintervals of $ (-1,1) $ with smooth Radon-Nikodym derivative. We study strong asymptotic behavior of the error of approximation $ (f-r_n)(z) $,…

Classical Analysis and ODEs · Mathematics 2023-02-21 Maxim L. Yattselev

In this paper we provide explicit upper and lower bounds on certain $L^2$ $n$-widths, i.e., best constants in $L^2$ approximation. We further describe a numerical method to compute these $n$-widths approximately, and prove that this method…

Numerical Analysis · Mathematics 2020-09-28 Andrea Bressan , Michael S. Floater , Espen Sande

Unitary best approximation to the exponential function on an interval on the imaginary axis has been introduced recently. In the present work two algorithms are considered to compute this best approximant: an algorithm based on rational…

Numerical Analysis · Mathematics 2025-04-15 Tobias Jawecki

We consider approximation or recovery of functions based on a finite number of function evaluations. This is a well-studied problem in optimal recovery, machine learning, and numerical analysis in general, but many fundamental insights were…

Numerical Analysis · Mathematics 2026-04-07 David Krieg , Mario Ullrich

For $a\in (0,1)$ let $L^k_m(a)$ be the error of the best approximation of the function $\sgn(x)$ on the two symmetric intervals $[-1,-a]\cup[a,1]$ by rational functions with the only possible poles of degree $2k-1$ at the origin and of…

Classical Analysis and ODEs · Mathematics 2007-05-23 Franz Peherstorfer , Peter Yuditskii

We develop a general framework for estimating the $L_\infty(\mathbb{T}^d)$ error for the approximation of multivariate periodic functions belonging to specific reproducing kernel Hilbert spaces (RHKS) using approximants that are…

Numerical Analysis · Mathematics 2019-09-06 Lutz Kämmerer

We describe an approximate rational arithmetic with round-off errors (both absolute and relative) controlled by the user. The rounding procedure is based on the continued fraction expansion of real numbers. Results of computer experiments…

Numerical Analysis · Mathematics 2025-10-20 Grigori Litvinov , Anatoli Rodionov , Andrei Chourkin

Several questions of approximation theory are discussed: 1) can one approximate stably in $L^\infty$ norm $f^\prime$ given approximation $f_\delta, \parallel f_\delta - f \parallel_{L^\infty} < \delta$, of an unknown smooth function $f(x)$,…

Classical Analysis and ODEs · Mathematics 2007-05-23 A. G. Ramm

In metric of spaces $L_{s}, \ 1\leq s\leq\infty$, we obtain exact in order estimates of best $m$-term trigonometric approximations of classes of convolutions of periodic functions, that belong to unit all of space $L_{p}, \ 1\leq…

Classical Analysis and ODEs · Mathematics 2016-03-08 A. S. Serdyuk , T. A. Stepaniuk

An algorithm is given for determining an optimal $b$-step approximation of weighted data, where the error is measured with respect to the $L_\infty$ norm. For data presorted by the independent variable the algorithm takes $\Theta(n + \log n…

Data Structures and Algorithms · Computer Science 2015-05-05 Quentin F. Stout

A rational approximation by a ratio of polynomial functions is a flexible alternative to polynomial approximation. In particular, rational functions exhibit accurate estimations to nonsmooth and non- Lipschitz functions, where polynomial…

Optimization and Control · Mathematics 2020-02-27 V. Peiris , N. Sharon , N. Sukhorukova J. Ugon

We consider the problem of approximation of matrix functions of class $L^p$ on the unit circle by matrix functions analytic in the unit disk in the norm of $L^p$, $2\le p<\be$. For an $m\times n$ matrix function $\Phi$ in $L^p$, we consider…

Functional Analysis · Mathematics 2008-05-29 L. Baratchart , F. L. Nazarov , V. V. Peller

The extended L\"uroth's Theorem says that if the transcendence degree of $\KK(\mathsf{f}_1,\dots,\mathsf{f}_m)/\KK$ is 1 then there exists $f \in \KK(\underline{X})$ such that $\KK(\mathsf{f}_1,\dots,\mathsf{f}_m)$ is equal to $\KK(f)$. In…

Symbolic Computation · Computer Science 2011-11-08 Guillaume Chèze

We show how rational function approximations to the logarithm, such as $\log z \approx (z^2 - 1)/(z^2 + 6z + 1)$, can be turned into fast algorithms for approximating the determinant of a very large matrix. We empirically demonstrate that…

Data Structures and Algorithms · Computer Science 2024-05-07 Thomas Colthurst , Srinivas Vasudevan , James Lottes , Brian Patton

We consider the problem of finding the best harmonic or analytic approximant to a given function. We discuss when the best approximant is unique, and what regularity properties the best approximant inherits from the original function. All…

Functional Analysis · Mathematics 2007-05-23 Dmitry Khavinson , John E. McCarthy , Harold S. Shapiro
‹ Prev 1 2 3 10 Next ›