The curse of dimension and a universal method for numerical integration
From MaRDI portal
(Redirected from The curse of dimension and a universal method for numerical integration)
Recommendations
- The curse of dimensionality for numerical integration on general domains
- The curse of dimensionality for numerical integration of smooth functions
- The curse of dimensionality for numerical integration of smooth functions. II
- scientific article; zbMATH DE number 866542
- scientific article; zbMATH DE number 663851
- Integration and approximation in arbitrary dimensions
- Numerical methods for higher dimensional problems and the curse of the dimension.
- Numerical integration in many dimensions. II
- Numerical integration in many dimensions. I
- Numerical integration of discontinuous functions in many dimensions
Cited in
(33)- Interpolation of functions from Besov-type spaces on Gauß-Chebyshev grids
- Fast Bayesian optimal experimental design for seismic source inversion
- Quasi-Monte Carlo algorithms for diffusion equations in high dimensions
- Numerical methods for higher dimensional problems and the curse of the dimension.
- On an interpolatory method for high dimensional integration
- Generation and application of multivariate polynomial quadrature rules
- Propagation of uncertainties in density-driven flow
- Solution of the 3D density-driven groundwater flow problem with uncertain porosity and permeability
- Divide and conquer: an incremental sparsity promoting compressive sampling approach for polynomial chaos expansions
- Sparse grid collocation schemes for stochastic natural convection problems
- A near-optimal sampling strategy for sparse recovery of polynomial chaos expansions
- Fast estimation of expected information gains for Bayesian experimental designs based on Laplace approximations
- On weak tractability of the Clenshaw-Curtis Smolyak algorithm
- Overcoming the curse of dimensionality in the numerical approximation of backward stochastic differential equations
- Sparse representations in stochastic mechanics
- Some results on the complexity of numerical integration
- The curse of dimensionality for numerical integration of smooth functions
- Sparse finite element approximation of high-dimensional transport-dominated diffusion problems
- Stochastic finite elements: Computational approaches to stochastic partial differential equations
- Solving stochastic systems with low-rank tensor compression
- For numerical differentiation, dimensionality can be a blessing!
- Fully Symmetric Kernel Quadrature
- Finite-order Integration Weights Can be Dangerous
- On the optimal convergence rate of universal and nonuniversal algorithms for multivariate integration and approximation
- scientific article; zbMATH DE number 2237872 (Why is no real title available?)
- Adaptive sparse grid algorithms with applications to electromagnetic scattering under uncertainty
- Transporting higher-order quadrature rules -- quasi-Monte Carlo points and sparse grids for mixture distributions
- Space-time deep neural network approximations for high-dimensional partial differential equations
- Optimal algorithms for numerical integration: recent results and open problems
- Nonlinear Monte Carlo methods with polynomial runtime for Bellman equations of discrete time high-dimensional stochastic optimal control problems
- Local discontinuous Galerkin method for nonlinear BSPDEs of Neumann boundary conditions with deep backward dynamic programming time-marching
- Galerkin methods for linear and nonlinear elliptic stochastic partial differential equations
- An evolutionary approach for achieving scalability with general regression neural networks
This page was built for publication: The curse of dimension and a universal method for numerical integration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4379953)
