The generalized Bernstein problem on weighted Lacunary polynomial approximation

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The generalized Bernstein problem on weighted Lacunary polynomial approximation

We obtain a necessary and sufficient condition for the lacunary polynomials to be dense in weighted Lp spaces of functions on the real line. This generalizes the solution to the classical Bernstein problem given by Izumi, Kawata and Hall. © 2005 Elsevier Inc. All rights reserved.

متن کامل

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...

متن کامل

A generalized parametric PR-QMF design technique based on Bernstein polynomial approximation

A generalized parametric PR-QMF design technique based on Bernstein polynomial approximation in the magnitude square domain is developed in this paper. The parametric nature of this solution provides useful insights to the PR-QMF problem. Several well-known orthonormal wavelet filters, PR-QMF's, are shown to be the special cases of the proposed technique. Energy compaction performance of a few ...

متن کامل

On Bernstein Type Inequalities for Complex Polynomial

In this paper, we establish some Bernstein type inequalities for the complex polynomial. Our results constitute generalizations and refinements of some well-known polynomial inequalities.

متن کامل

Polynomial-Time Approximation Algorithms for Weighted LCS Problem

We deal with a variant of the well-known Longest Common Subsequence (LCS) problem for weighted sequences. A (biological) weighted sequence determines the probability for each symbol to occur at a given position of the sequence (such sequences are also called Position Weighted Matrices, PWM). Two possible such versions of the problem were proposed by (Amir et al., 2009 and 2010), they are called...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Approximation Theory

سال: 2005

ISSN: 0021-9045

DOI: 10.1016/j.jat.2005.05.009