High dimensional numerical problems

From MaRDI portal





High-dimensional numerical problems are ubiquitous although one tries to avoid them because of their intrinsic difficulty. There are limits of practical computability for this class of problems related with the high dimension. There is a ``curse of dimension which means that the minimal cost of computing an approximation is exponential in the dimension of the problem. Hence many high-dimensional numerical problems are practically impossible to solve. The author expands the limit of practical computability by using, in an optimal way, the a priori knowledge about the smoothness and the structure of the problem. The suggested method is developed for partially separable problems in nonclassical function spaces and is based on the so-called Smolyak formulas for the methods known under different names such as hyperbolic cross point methods, Boolean methods, discrete blending methods or sparse grid methods. The application to integration and global optimization is also suggested.



Cites work



Describes a project that uses

Uses Software






This page was built for publication: High dimensional numerical problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4377209)