Results 261 to 270 of about 822,442 (292)

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

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

Simultaneous Approximation of Polynomials

2016
Let \(\mathcal{P}_d\) denote the family of all polynomials of degree at most d in one variable x, with real coefficients. A sequence of positive numbers \(x_1\le x_2\le \ldots \) is called \(\mathcal{P}_d\)-controlling if there exist \(y_1, y_2,\ldots \in \mathbb {R}\) such that for every polynomial \(p\in \mathcal{P}_d\) there exists an index i with \(
Kupavskii, Andrei, Pach, Janos
openaire   +1 more source

Approximation by Chlodowsky–Taylor polynomials

Applied Mathematics and Computation, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sevilay Kirci Serenbay, Ertan Ibikli
openaire   +3 more sources

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   +3 more sources

Approximation in the Mean by Polynomials

The Annals of Mathematics, 1991
Let \(\mu\) be a positive measure with compact support in the complex plane and let \(t\in[1,\infty)\). Denote by \(P^ t(\mu)\) the closure in \(L^ t(\mu)\) of the polynomials in one complex variable. The paper deals with the description of \(P^ t(\mu)\). The main results are the following: There exists a Borel partition \(\{\Delta_ i\}^ \infty_{i=0}\)
openaire   +1 more source

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

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   +3 more sources