Uniform Approximation of Minimax Point Estimates

نویسندگان

چکیده

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

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

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

منابع مشابه

Uniform Rectifiability, Carleson Measure Estimates, and Approximation of Harmonic Functions

Let E ⊂ Rn+1, n ≥ 2, be a uniformly rectifiable set of dimension n. Then bounded harmonic functions in Ω := Rn+1 \ E satisfy Carleson measure estimates, and are “ε-approximable”. Our results may be viewed as generalized versions of the classical F. and M. Riesz theorem, since the estimates that we prove are equivalent, in more topologically friendly settings, to quantitative mutual absolute con...

متن کامل

Minimax Polynomial Approximation

Some new methods for obtaining the minimax polynomial approximation of degree n to a continuous function are introduced, and applied to several simple functions. The amount of computation required is substantially reduced compared with that of previous methods.

متن کامل

L-bounded Point Evaluations for Polynomials and Uniform Rational Approximation

A connection is established between uniform rational approximation and approximation in the mean by polynomials on compact nowhere dense subsets of the complex plane C. Peak points for R(X) and bounded point evaluations for Hp(X, dA), 1 ≤ p < ∞, play a fundamental role.

متن کامل

Sharp Stability and Approximation Estimates for Symmetric Saddle Point Systems

We establish sharp well-posedness and approximation estimates for variational saddle point systems at the continuous level. The main results of this note have been known to be true only in the finite dimensional case. Known spectral results from the discrete case are reformulated and proved using a functional analysis view, making the proofs in both cases, discrete and continuous, less technica...

متن کامل

Strategyproof Approximation of the Minimax on Networks

We consider the problem of locating a facility on a network represented by a graph. A set of strategic agents have different ideal locations for the facility; the cost of an agent is the distance between its ideal location and the facility. A mechanism maps the locations reported by the agents to the location of the facility. We wish to design mechanisms that are strategyproof (SP) in the sense...

متن کامل

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


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

ژورنال

عنوان ژورنال: The Annals of Mathematical Statistics

سال: 1964

ISSN: 0003-4851

DOI: 10.1214/aoms/1177703262