Results 281 to 290 of about 44,196 (310)

Complexity and Approximability of the Cover Polynomial

computational complexity, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Markus Bläser, Holger Dell, Mahmoud Fouz   +2 more
openaire   +2 more sources

Monotone Approximation by Polynomials

SIAM Journal on Mathematical Analysis, 1977
We prove Jackson type estimates for the approximation of monotone functions by monotone polynomials. The results are given in terms of the modulus of continuity of $f^{(k)} $ , for any $k \geqq 0$. The estimates are of the same order as for the unconstrained approximation by polynomials.
openaire   +1 more source

Weighted Polynomial Approximations

2001
In this chapter, we establish the existence of weighted polynomial approximations that are a prerequisite to the estimates and asymptotics in subsequent chapters. We search for polynomials P n of degree n such that P n W approximates 1 in some sense on [a −n, a n ].
Eli Levin, Doron S. Lubinsky
openaire   +1 more source

Polynomial approximations in predistortion workfunctions

2004 IEEE 15th International Symposium on Personal, Indoor and Mobile Radio Communications (IEEE Cat. No.04TH8754), 2005
Alternative approaches for approximating the ideal predistortion workfunction with a polynomial are compared. It is found that the inclusion of even order linearizing terms leads to small performance improvements but puts more stringent requirements on workfunction circuitry, increases coefficient sensitivity, and slightly degrades the adaptation speed.
Nielsen, Troels Studsgaard, Lindfors, Saska   +1 more
openaire   +2 more sources

Approximation by Bernstein Polynomials

American Journal of Mathematics, 1994
Let \[ B_ n(f; x)= \sum^ n_{k=0} f\left({k\over n}\right)\left(\begin{smallmatrix} n\\ k\end{smallmatrix}\right) x^ k(1-x)^{n- k} \] and \(w_ \varphi(f; \delta)= \sup_{0\leq t\leq \delta} \sup_ x| f(x- t\varphi(x))- 2f(x)+ f(x+ t\varphi(x)))|\), where \(f\in C[0,1]\), \(\varphi(x)= \sqrt{x(1-x)}\) and the second supremum is taken for those values of ...
openaire   +2 more sources

Approximation by $\delta $-Polynomials

SIAM Journal on Numerical Analysis, 1973
The approximation to complex-valued functions, continuous on a closed Jordan curve by polynomials of degree n, whose uniform norm on that curve is greater than or equal to some prescribed constant, is investigated. The limits for the resultant sequence of the best such deviations are found for a large class of functions.
openaire   +3 more sources

Approximation of analytic functions by polynomials ?close? to polynomials of best approximation

Ukrainian Mathematical Journal, 1992
See the review in Zbl 0758.30034.
openaire   +2 more sources

A SURVEY OF POLYNOMIAL APPROXIMATION ON THE SPHERE

International Journal of Wavelets, Multiresolution and Information Processing, 2009
The main purpose of this paper is to survey some of the work on spherical approximation done by the BNU group under the direction of Professor Sun. The equiconvergent operators of Cesàro means, and their interesting applications are described.
Feng Dai, Kunyang Wang
openaire   +2 more sources

m-approximate Taylor polynomial

manuscripta mathematica, 2019
In \(\mathbb{R}^n\) a notion of \(m\)-density for \(m\in [n, \infty)\) is a generalization of density. Analogous as approximate continuity (differentiability) one can define \(m\)-approximate continuity (differentiability) at a point. It is proved that if \(1\leq p< \infty\) and \(f\colon \mathbb{R}^n \to \mathbb{R}\) is \(L^p\) differentiable at \(x ...
openaire   +3 more sources

ON APPROXIMATE FACTORS OF POLYNOMIALS

The Quarterly Journal of Mathematics, 1955
openaire   +1 more source