Abstract

We exhibit an algorithm to solve the following extension problem: Given a finite set E⊂RnE \subset \mathbb{R}^n and a function f:E→Rf: E \rightarrow \mathbb{R}, compute an extension FF in the Sobolev space Lm,p(Rn)L^{m,p}(\mathbb{R}^n), p>np>n, with norm having the smallest possible order of magnitude, and secondly, compute the order of magnitude of the norm of FF. Here, Lm,p(Rn)L^{m,p}(\mathbb{R}^n) denotes the Sobolev space consisting of functions on Rn\mathbb{R}^n whose mmth order partial derivatives belong to Lp(Rn)L^p(\mathbb{R}^n). The running time of our algorithm is at most CNlog⁡NC N \log N, where NN denotes the cardinality of EE, and CC is a constant depending only on mm,nn, and pp.

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.