High dimensional numerical problems
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.
- High-dimensional numerical integration
- Algorithms for Numerical Analysis in High Dimensions
- scientific article; zbMATH DE number 4076523
- scientific article; zbMATH DE number 19001
- Solution of linear systems in high spatial dimensions
- Numerical methods for higher dimensional problems and the curse of the dimension.
- Numerical solution of parabolic equations in high dimensions
- Numerical methods for high-dimensional probability density function equations
- High dimensional simulation
- High order approximation schemes
- An adaptive algorithm for numerical integration over an \(n\)-dimensional cube
- Average case complexity of linear multivariate problems. II: Applications
- Deterministic and stochastic error bounds in numerical analysis
- Explicit cost bounds of algorithms for multivariate tensor product problems
- High dimensional integration of smooth functions over cubes
- How to increase the order to get minimal-error algorithms for systems of ODE
- scientific article; zbMATH DE number 440658 (Why is no real title available?)
- scientific article; zbMATH DE number 4213311 (Why is no real title available?)
- scientific article; zbMATH DE number 3790208 (Why is no real title available?)
- scientific article; zbMATH DE number 44104 (Why is no real title available?)
- scientific article; zbMATH DE number 44570 (Why is no real title available?)
- scientific article; zbMATH DE number 50734 (Why is no real title available?)
- scientific article; zbMATH DE number 66109 (Why is no real title available?)
- scientific article; zbMATH DE number 515830 (Why is no real title available?)
- scientific article; zbMATH DE number 1049042 (Why is no real title available?)
- scientific article; zbMATH DE number 835705 (Why is no real title available?)
- scientific article; zbMATH DE number 848791 (Why is no real title available?)
- scientific article; zbMATH DE number 914714 (Why is no real title available?)
- scientific article; zbMATH DE number 3321507 (Why is no real title available?)
- scientific article; zbMATH DE number 970338 (Why is no real title available?)
- On sequential and parallel solution of initial value problems
- On the power of adaption
- On tractability of path integration
- Remarks on algorithm 006: An adaptive algorithm for numerical integration over an N-dimensional rectangular region
- Tractability and strong tractability of linear multivariate problems
- Variational properties of averaged equations for periodic media
- Numerical methods for higher dimensional problems and the curse of the dimension.
- A Sparse Interpolation Algorithm for Dynamical Simulations in Computational Chemistry
- scientific article; zbMATH DE number 19001 (Why is no real title available?)
- Algorithms for Numerical Analysis in High Dimensions
- Approximation of functions of few variables in high dimensions
- On the approximability and curse of dimensionality of certain classes of high-dimensional functions
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)