Article ID Journal Published Year Pages File Type
4608799 Journal of Complexity 2009 7 Pages PDF
Abstract

We prove that L∞L∞-approximation of C∞C∞-functions defined on [0,1]d[0,1]d is intractable and suffers from the curse of dimensionality. This is done by showing that the minimal number of linear functionals needed to obtain an algorithm with worst case error at most ε∈(0,1)ε∈(0,1) is exponential in dd. This holds despite the fact that the rate of convergence is infinite.

Related Topics
Physical Sciences and Engineering Mathematics Analysis
Authors
, ,