Constrained interpolants with minimal Wk,p-norm

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

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

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

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

منابع مشابه

Computing minimal interpolants in C(R)

We consider the following interpolation problem. Suppose one is given a finite set E ⊂ R, a function f : E → R, and possibly the gradients of f at the points of E as well. We want to interpolate the given information with a function F ∈ C(R) with the minimum possible value of Lip(∇F ). We present practical, efficient algorithms for constructing an F such that Lip(∇F ) is minimal, or for less co...

متن کامل

Norm-Constrained Kalman Filtering∗

The problem of estimating the state vector of a dynamical system from vector measurements, when it is known that the state vector satisfies norm equality constraints is considered. The case of a linear dynamical system with linear measurements subject to a norm equality constraint is discussed with a review of existing solutions. The norm constraint introduces a nonlinearity in the system for w...

متن کامل

On the Semi-norm of Radial Basis Function Interpolants

Radial basis function interpolation has attracted a lot of interest in recent years. For popular choices, for example thin plate splines, this problem has a variational formulation, i.e. the interpolant minimizes a semi-norm on a certain space of radial functions. This gives rise to a function space, called the native space. Every function in this space has the property that the semi-norm of an...

متن کامل

Acting on Norm Constrained Plans

The behaviour of deliberative agents is often guided by a plan library designed to achieve goals given certain environmental conditions. Plans in these plan libraries are designed to achieve individual goals, and cannot possibly account for all possible variations of restrictions in the societies within which these agents must operate. These restrictions, captured through norms, include obligat...

متن کامل

Computing minimal interpolants in $C^{1, 1}(\mathbb{R}^d)$

We consider the following interpolation problem. Suppose one is given a finite set E ⊂ R, a function f : E → R, and possibly the gradients of f at the points of E. We want to interpolate the given information with a function F ∈ C(R) with the minimum possible value of Lip(∇F ). We present practical, efficient algorithms for constructing an F such that Lip(∇F ) is minimal, or for less computatio...

متن کامل

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


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

ژورنال

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

سال: 1987

ISSN: 0021-9045

DOI: 10.1016/0021-9045(87)90105-5