arrow
Return

Fitting a Cm-smooth function to data I

delete2009-01-01
delete51
delete
OA
AI
C
Charles Fefferman *
B
Bo’az Klartag
DOI:10.4007/annals.2009.169.315delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Suppose we are given a finite subset E subset of R-n and a function f : E -> R. How to extend f to a C-m function F : R-n -> R with C-m norm of the smallest possible order of magnitude? In this paper and in [20] we tackle this question from the perspective of theoretical computer science. We exhibit algorithms for constructing such an extension function F, and for computing the order of magnitude of its C-m norm. The running time of our algorithms is never more than CN log N, where N is the cardinality of E and C is a constant depending only on m and n.
Keywords:
WHITNEYS EXTENSION PROBLEM
CLOSED-SETS
LINEAR-OPERATORS
THEOREM

Journal

Annals of Mathematics cover
Annals of Mathematics
IF:
5.3
Papers:
1.4K
Citations:
1.6W

Organization

I
institute for advanced study - usa
Scholars:
933
Papers: 1.4K
Citations: 15
P
Princeton University
Scholars:
2.1W
Papers: 2.3W
Citations: 5.1W
Cited Papers

Cited Papers

No cited papers available