Interpolation of data in R^n


Charles Fefferman

Princeton University


Thursday, October 21, 2010

Talk at 4:30 p.m. in Room 4-237

Tea from 4:00 - 4:30 p.m. in Room 2-290


Abstract:   Fix positive integers m,n. How can one compute a function F, having nearly the smallest possible norm in $C^m(R^n)$, and agreeing (exactly or approximately) with given values at N given data points? This talk sets up the problem and states results.

It is the first of a three-part series of talks -- the Wiener lectures -- given at MIT. The second talk (Friday, Oct. 22) gives some of the main ideas in the proofs. The third talk (Tuesday, Oct. 26) explains recent work on the analogous problem with $C^m(R^n)$ replaced by Sobolev spaces. For more information on the Wiener Lectures, please visit:


Home Web page:  Alexandru I. Suciu Comments to: 
Posted: October 15, 2010    URL: