Fitting a Cm Smooth function to data

Fix m,n positive integers. Problem: Compute efficiently a Cm function F on Rn, whose graph passes through (or close to) finitely many given points in R^(n+1), with the Cm norm of F (nearly) as small as possible. (Joint work with Bo’az Klartag.)

Speaker Details

Charles Fefferman is the Herbert Jones University Professor at the mathematics department of Princeton University. He has made numerous fundamental contributions to various areas of mathematical analysis, such as harmonic analysis and partial differential equations. He has received several international awards, including the Salem Prize in 1971, the Waterman Award in 1976, and the Fields Medal in 1978.

Date:
Speakers:
Charles Fefferman
Affiliation:
Princeton University

    • Portrait of Jeff Running

      Jeff Running