On Nikol'skii inequalities for domains in RdR^d

preprint2016arXivOpen access

Abstract

Nikol'skii inequalities for various sets of functions, domains and weights will be discussed. Much of the work is dedicated to the class of algebraic polynomials of total degree nn on a bounded convex domain DD. That is, we study σ:=σ(D,d)σ:= σ(D,d) for which ∥P∥Lq(D)≤cnσ(1p−1q)∥P∥Lp(D),0<p≤q≤∞, \|P\|_{L_q(D)}\le c n^{σ(\frac1p-\frac1q)}\|P\|_{L_p(D)},\quad 0<p\le q\le\infty, where PP is a polynomial of total degree nn. We use geometric properties of the boundary of DD to determine σ(D,n)σ(D,n) with the aid of comparison between domains. Computing the asymptotics of the Christoffel function of various domains is crucial in our investigation. The methods will be illustrated by the numerous examples in which the optimal σ(D,n)σ(D,n) will be computed explicitly.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.