Relations between rational and spline approximations in Lp metric

نویسندگان

چکیده

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

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

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

منابع مشابه

Hierarchical Spline Approximations

1 Center for Image Processing and Integrated Computing (CIPIC), Department of Computer Science, University of California, Davis, CA 95616-8562, U.S.A.; e-mail: {wiley, hamann, joy}@cs.ucdavis.edu 2 University of Kaiserslautern, Fachbereich Informatik, P.O. Box 3049, D-67653 Kaiserslautern, Germany; e-mail: {bertram, scheuer}@informatik.uni-kl.de 3 Pixar Feature Division, Pixar Animation Studios...

متن کامل

Discrete Rational Lp Approximation

In this paper, the problem of approximating a function defined on a finite subset of the real line by a family of generalized rational functions whose numerator and denominator spaces satisfy the Haar conditions on some closed interval [a, b] containing the finite set is considered. The pointwise closure of the family restricted to the finite set is explicitly determined. The representation obt...

متن کامل

Bivariate Rational Spline Surface

This paper is concerned with the nonnegativity preserving interpolation of data on rectangular grids. The function is a kind of bivariate rational interpolation spline with parameters, which is C1 in the whole interpolation region. Sufficient conditions are derived on coefficients in the rational spline to ensure that the surfaces are always nonnegative if the original data are nonnegative. The...

متن کامل

Codes and lattices in the lp metric

Codes and associated lattices are studied in the lp metric, particularly in the l1 (Lee) and the l∞ (maximum) distances. Discussions and results on decoding processes, classification and analysis of perfect or dense codes in these metrics are presented. Keywords—Codes and lattices, lp metric, Lee metric, perfect codes.

متن کامل

Convex Polynomial and Spline Approximation in Lp , 0 < p <

We prove that a convex function f 6 L p [ -1 , 1], 0 < p < cx~, can be approximated by convex polynomials with an error not exceeding Cw~ (f, 1/n)p where w~(f, .) is the Ditzian-Totik modulus of smoothness of order three of f . We are thus filling the gap between previously known estimates involving og~(f, I/n)p, and the impossibility of having such estimates involving ~o4. We also give similar...

متن کامل

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


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

ژورنال

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

سال: 1987

ISSN: 0021-9045

DOI: 10.1016/0021-9045(87)90005-0