Discrete Interpolation Norms with Applications

نویسندگان

  • Mario Arioli
  • Daniel Loghin
چکیده

We describe norm representations for interpolation spaces generated by finitedimensional subspaces of Hilbert spaces. These norms are products of integer and non-integer powers of the Grammian matrices associated with the generating pair of spaces for the interpolation space. We include a brief description of some of the algorithms which allow the efficient computation of matrix powers. We consider in some detail the case of fractional Sobolev spaces both for positive and negative indices together with applications arising in preconditioning techniques. Numerical experiments are included.

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

ثبت نام

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

منابع مشابه

Presentation of K Nearest Neighbor Gaussian Interpolation and comparing it with Fuzzy Interpolation in Speech Recognition

Hidden Markov Model is a popular statisical method that is used in continious and discrete speech recognition. The probability density function of observation vectors in each state is estimated with discrete density or continious density modeling. The performance (in correct word recognition rate) of continious density is higher than discrete density HMM, but its computation complexity is very ...

متن کامل

Presentation of K Nearest Neighbor Gaussian Interpolation and comparing it with Fuzzy Interpolation in Speech Recognition

Hidden Markov Model is a popular statisical method that is used in continious and discrete speech recognition. The probability density function of observation vectors in each state is estimated with discrete density or continious density modeling. The performance (in correct word recognition rate) of continious density is higher than discrete density HMM, but its computation complexity is very ...

متن کامل

Characterizations of Hankel Multipliers

We give characterizations of radial Fourier multipliers as acting on radial L functions, 1 < p < 2d/(d + 1), in terms of Lebesgue space norms for Fourier localized pieces of the convolution kernel. This is a special case of corresponding results for general Hankel multipliers. Besides L −L bounds we also characterize weak type inequalities and intermediate inequalities involving Lorentz spaces....

متن کامل

Near minimally normed spline quasi-interpolants on uniform partitions

Spline quasi-interpolants are local approximating operators for functions or discrete data. We consider the construction of discrete and integral spline quasi-interpolants on uniform partitions of the real line having small infinite norms. We call them near minimally normed quasi-interpolants: they are exact on polynomial spaces and minimize a simple upper bound of their infinite norms. We give...

متن کامل

Mixing times and `p bounds for Oblivious routing

We study the task of uniformly minimizing all the `p norms of the vector of edge loads in an undirected graph while obliviously routing a multicommodity flow. Let G be an undirected graph having m edges and n vertices. Let the performance index π of an oblivious routing algorithm A (on G) be the supremum of its competitive ratios over all `p norms, where the adversarial adaptive routing scheme ...

متن کامل

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


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

عنوان ژورنال:
  • SIAM J. Numerical Analysis

دوره 47  شماره 

صفحات  -

تاریخ انتشار 2009