## Abstract

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 C^{m} function F: R{double struck} ^{n} → R{double struck} 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.

Original language | English |
---|---|

Pages (from-to) | 315-346 |

Number of pages | 32 |

Journal | Annals of Mathematics |

Volume | 169 |

Issue number | 1 |

DOIs | |

State | Published - 2009 |

Externally published | Yes |

## Fingerprint

Dive into the research topics of 'Fitting a C^{m}-smooth function to data I'. Together they form a unique fingerprint.