Weighted-$L^2$ polynomial approximation in $\mathbb {C}$
نویسندگان
چکیده
منابع مشابه
Constrained polynomial degree reduction in the L2-norm equals best weighted Euclidean approximation of Bézier coefficients
In this paper we show that the best constrained degree reduction of a given Bézier curve f of degree from n to m with Cα−1-continuity at the boundary in L2-norm is equivalent to the best weighted Euclidean approximation of the vector of Bernstein–Bézier (BB) coefficients of f from the vector of degree raised BB coefficients of polynomials of degree m with Cα−1-continuity at the boundary. 2003...
متن کاملWeighted Polynomial Approximation in the Complex Plane
Given a pair (G,W ) of an open bounded set G in the complex plane and a weight function W (z) which is analytic and different from zero in G, we consider the problem of the locally uniform approximation of any function f(z), which is analytic in G, by weighted polynomials of the form {Wn(z)Pn(z)}n=0, where deg Pn ≤ n. The main result of this paper is a necessary and sufficient condition for suc...
متن کاملWeighted Polynomial Approximation on the Integers
We prove here some polynomial approximation theorems, somewhat related to the Szasz-Mfintz theorem, but where the domain of approximation is the integers, by dualizing a gap theorem of C. l ~ Y I for periodic entire functions. In another Paper [7], we shall prove, by similar means, a completeness theorem ibr some special sets of entire functions. I t is well known (see, for example [l]) tha t i...
متن کاملReachability-Based Approach for L2 Gain Approximation of Polynomial Systems
This paper considers a computational mechanism to approximate a class of polynomial systems with a reduced order model. The approach is based on estimate of the reachability set and a finite gain L2 stability condition. The approach benefits from the use of sum of squares programming where the computation is rendered tractable.
متن کاملOn polynomial approximations over $\mathbb{Z}/2^k\mathbb{Z}$
We study approximation of Boolean functions by low-degree polynomials over the ring Z/2kZ. More precisely, given a Boolean function F : {0, 1}n → {0, 1}, define its k-lift to be Fk : {0, 1}n → {0, 2k−1} by Fk(x) = 2k−F(x) (mod 2k). We consider the fractional agreement (which we refer to as γd,k(F)) of Fk with degree d polynomials from Z/2 Z[x1, . . . , xn]. Our results are the following: • Incr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 2019
ISSN: 0002-9947,1088-6850
DOI: 10.1090/tran/7935