Related papers: On the Chebyshev approximation of a function with …
A symmetric function of $N$ variables can be given in terms of symmetric polynomials of these variables. We determine those symmetric polynomials in which the dual differential operators take the neatest form when expressed in terms of our…
We describe polynomials of the best uniform approximation to sgn(x) on the union of two intervals in terms of special conformal mappings. This permits us to find the exact asymptotic behavior of the error of this approximation.
In the framework of mapped pseudospectral methods, we introduce a new polynomial-type mapping function in order to describe accurately the dynamics of systems developing almost singular structures. Using error criteria related to the…
This paper considers filtered polynomial approximations on the unit sphere $\mathbb{S}^d\subset \mathbb{R}^{d+1}$, obtained by truncating smoothly the Fourier series of an integrable function $f$ with the help of a "filter" $h$, which is a…
We derive a three-term recurrence relation for computing the polynomial of best approximation in the uniform norm to $x^{-1}$ on a finite interval with positive endpoints. As application, we consider two-level methods for scalar elliptic…
Factorization of polynomials arises in numerous areas in symbolic computation. It is an important capability in many symbolic and algebraic computation. There are two type of factorization of polynomials. One is convention polynomial…
In this paper, we introduce and investigate a new subclass of bi-prestarlike functions defined in the open unit disk, associated with Chebyshev Polynomials. Furthermore, we find estimates of first two coefficients of functions in these…
We prove a version of the Bernstein-Walsh theorem on uniform polynomial approximation of holomorphic functions on compact sets in several complex variables. Here we consider subclasses of the full polynomial space associated to a convex…
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…
Factorization of polynomials is one of the foundations of symbolic computation. Its applications arise in numerous branches of mathematics and other sciences. However, the present advanced programming languages such as C++ and J++, do not…
The best polynomial approximation and Chebyshev approximation are both important in numerical analysis. In tradition, the best approximation is regarded as more better than the Chebyshev approximation, because it is usually considered in…
The low-rank matrix approximation problem is ubiquitous in computational mathematics. Traditionally, this problem is solved in spectral or Frobenius norms, where the accuracy of the approximation is related to the rate of decrease of the…
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…
A Chebyshev expansion is a series in the basis of Chebyshev polynomials of the first kind. When such a series solves a linear differential equation, its coefficients satisfy a linear recurrence equation. We interpret this equation as the…
We show that every real nonnegative polynomial $f$ can be approximated as closely as desired by a sequence of polynomials $\{f_\epsilon\}$ that are sums of squares. Each $f_\epsilon$ has a simple et explicit form in terms of $f$ and…
This expository article proves some results of Ferguson, on the approximation of continuous functions on a compact subset of R by polynomials with integral coefficients.
This paper presents a novel method for generating a single polynomial approximation that produces correctly rounded results for all inputs of an elementary function for multiple representations. The generated polynomial approximation has…
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.
The discrete cosine transforms of types V--VIII are generalized to the antisymmetric and symmetric multivariate discrete cosine transforms. Four families of discretely and continuously orthogonal Chebyshev-like polynomials corresponding to…
In this paper we propose a subgradient algorithm for solving the equilibrium problem where the bifunction may be quasiconvex with respect to the second variable. The convergence of the algorithm is investigated. A numerical example for a…