Approximation of Random Fields in High Dimension
published: Dec. 18, 2008, recorded: December 2008, views: 256
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
We consider the ε-approximation by n-term partial sums of the Karhunen- Lo`eve expansion to d-parametric random ﬁelds of tensor product-type in the average case setting. We investigate the behavior, as d → ∞, of the informa- tion complexity of approximation with error not exceeding a given level ε. It was recently shown that for this problem one observes the curse of dimen- sionality (intractability) phenomenon. We aim to give the exact asymptotic expression for the information complexity.
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !