Related papers: Polynomials of the best uniform approximation to s…
Two approximations of the integral of a class of sinusoidal composite functions, for which an explicit form does not exist, are derived. Numerical experiments show that the proposed approximations yield an error that does not depend on the…
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…
In this paper we consider the approximation of a function by its interpolating multilinear spline and the approximation of its derivatives by the derivatives of the corresponding spline. We derive formulas for the uniform approximation…
We present a constructive approach for approximating the conformal map (uniformization) of a polyhedral surface to a canonical domain in the plane. The main tool is a characterization of convex spaces of quasiconformal simplicial maps and…
We study best approximation to a given function, in the least square sense on a subset of the unit circle, by polynomials of given degree which are pointwise bounded on the complementary subset. We show that the solution to this problem, as…
Motivated by conforming finite element methods for elliptic problems of second order, we analyze the approximation of the gradient of a target function by continuous piecewise polynomial functions over a simplicial mesh. The main result is…
There is presented an approach to find an approximation polynomial of a function with two variables based on the two dimensional discrete Fourier transform. The approximation polynomial is expressed through Chebyshev polynomials. There is…
Asymptotic expansions are derived for Gegenbauer (ultraspherical) polynomials for large order $n$ that are uniformly valid for unbounded complex values of the argument $z$, including the real interval $0 \leq z \leq 1$ in which the zeros in…
When implementing regular enough functions (e.g., elementary or special functions) on a computing system, we frequently use polynomial approximations. In most cases, the polynomial that best approximates (for a given distance and in a given…
In this paper we study the best asymmetric (sometimes also called penalized or sign-sensitive) approximation in the metrics of the space $L_p$, $1\leqslant p\leqslant\infty$, of functions $f\in C^2\left([0,1]^2\right)$ with nonnegative…
How to find "best rational approximations" of maximal commutative subgroups of GL(n,R)? In this paper we pose and make first steps in the study of this problem. It contains both classical problems of Diophantine and simultaneous…
We obtain some results on the asymptotic behaviour of Geometric polynomials in both the complex plane minus $[-1,0]$ and the interval $(-1,0)$. We also find the distance of consecutive zeros of these polynomials in the bulk of the interval…
We present methods for approximating the mapping that defines the invariant manifold for two systems exhibiting generalized synchronization. If the equations of motion are known then an analytic approximation to the mapping can be found. If…
We give the asymptotics for D-optimal (equivalently G-optimal) designs on a compact (possibly complex) design space.
This paper considers pairs of optimization problems that are defined from a single input and for which it is desired to find a good approximation to either one of the problems. In many instances, it is possible to efficiently find an…
The optimal one-sided parametric polynomial approximants of a circular arc are considered. More precisely, the approximant must be entirely in or out of the underlying circle of an arc. The natural restriction to an arc's approximants…
We develop new methods for approximating conformal blocks as positive functions times polynomials, with applications to the numerical bootstrap. We argue that to obtain accurate bootstrap bounds, conformal block approximations should…
Some properties of generalized convexity for sets and for functions are identified in case of the reliability polynomials of two dual minimal networks. A method of approximating the reliability polynomials of two dual minimal network is…
We study the polynomial approximation of symmetric multivariate functions and of multi-set functions. Specifically, we consider $f(x_1, \dots, x_N)$, where $x_i \in \mathbb{R}^d$, and $f$ is invariant under permutations of its $N$…
We present a technique for approximating generic normalization constants subject to constraints. The method is then applied to derive the exact asymptotics for the conditional normalization constant of constrained exponential random graphs.