Fitting a Cm-smooth function to data I

Charles Fefferman, Bo'az Klartag

Research output: Contribution to journalArticlepeer-review

47 Scopus citations


Suppose we are given a finite subset E ⊂ R{double struck} n and a function f: E → R{double struck}. How to extend f to a Cm function F: R{double struck} n → R{double struck} with Cm 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 Cm 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.

Original languageEnglish (US)
Pages (from-to)315-346
Number of pages32
JournalAnnals of Mathematics
Issue number1
StatePublished - 2009

All Science Journal Classification (ASJC) codes

  • Statistics and Probability
  • Statistics, Probability and Uncertainty


Dive into the research topics of 'Fitting a Cm-smooth function to data I'. Together they form a unique fingerprint.

Cite this