Related papers: Approximation by polynomials with only real critic…

It is a classical result in rational approximation theory that certain non-smooth or singular functions, such as $|x|$ and $x^{1/p}$, can be efficiently approximated using rational functions with root-exponential convergence in terms of…

We seek random versions of some classical theorems on complex approximation by polynomials and rational functions, as well as investigate properties of random compact sets in connection to complex approximation.

We present a constructive proof of Brouwer's fixed point theorem for uniformly continuous and sequentially locally non-constant functions based on the existence of approximate fixed points. And we will show that Brouwer's fixed point…

We establish a uniform approximation result for the Taylor polynomials of the xi function of Riemann which is valid in the entire complex plane as the degree grows. In particular, we identify a domain growing with the degree of the…

The theory of Chebyshev (uniform) approximation for univariate polynomial and piecewise polynomial functions has been studied for decades. The optimality conditions are based on the notion of alternating sequence. However, the extension the…

The theory of Chebyshev approximation has been extensively studied. In most cases, the optimality conditions are based on the notion of alternance or alternating sequence (that is, maximal deviation points with alternating deviation signs).…

A simple proof is given of the known fact that an m-times continuously differentiable function on the real line can be approximated along with its derivatives by an entire function and its respective derivatives.

We study the rational approximation properties of special manifolds defined by a set of polynomials with rational coefficients. Mostly we will assume the case of all polynomials to depend on only one variable. In this case the manifold can…

Let F be a number field, and let F\subset K be a field extension of degree n. Suppose that we are given 2r sufficiently general linear polynomials in r variables over F. Let X be the variety over F such that the F-points of X bijectively…

Let p_N be a random degree N polynomial in one complex variable whose zeros are chosen independently from a fixed probability measure mu on the Riemann sphere S^2. This article proves that if we condition p_N to have a zero at some fixed…

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…

The paper deals with a special filtered approximation method, which originates interpolation polynomials at Chebyshev zeros by using de la Vall\'ee Poussin filters. These polynomials can be an useful device for many theoretical and…

We prove that several forms of the Bernstein polynomials with integer coefficients possess the property of simultaneous approximation, that is, they approximate not only the function but also its derivatives. We establish direct estimates…

We introduce the notions of $\varepsilon$-approximate fixed point and weak $\varepsilon$-approximate fixed point. We show that for a group of unitary matrices even the existence of a nontrivial weak $\varepsilon$-approximate fixed point for…

Let f be a real or complex polynomial. We give an algorithm to compute the set of generalized critical values. The algorithm uses a finite dimensional space of rational arcs along which we can reach all generalized critical values of f.

We establish that every formal critical portrait (as defined by Goldberg and Milnor), can be realized by a postcritically finite polynomial.

We define the notion of Bernstein measures and Bernstein approximations over general convex polytopes. This generalizes well-known Bernstein polynomials which are used to prove the Weierstrass approximation theorem on one dimensional…

We give an elementary proof of an analogue of Fej\'er's theorem in weighted Dirichlet spaces with superharmonic weights. This provides a simple way of seeing that polynomials are dense in such spaces.

We define the notion of {\em rational presentation of a complete metric space} in order to study metric spaces from the algorithmic complexity point of view. In this setting, we study some presentations of the space $\czu$ of uniformly…

This work concerns the distance in 2-norm from a matrix polynomial to a nearest polynomial with a specified number of its eigenvalues at specified locations in the complex plane. Perturbations are allowed only on the constant coefficient…