Liberating the dimension
From MaRDI portal
Publication:708310
DOI10.1016/j.jco.2009.12.003zbMath1203.65057MaRDI QIDQ708310
Ian H. Sloan, Frances Y. Kuo, Henryk Woźniakowski, Grzegorz W. Wasilkowski
Publication date: 11 October 2010
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jco.2009.12.003
complexity; algorithms; lower and upper bounds; tractability; worst case error; infinite dimensional integration; randomly shifted lattice rules
41A63: Multidimensional problems
41A55: Approximate quadratures
65D32: Numerical quadrature and cubature formulas
65Y20: Complexity and performance of numerical algorithms
Related Items
Liberating the Dimension for Function Approximation and Integration, Average case tractability of approximating ∞-variate functions, Hyperbolic cross approximation in infinite dimensions, Equivalence of anchored and ANOVA spaces via interpolation, Liberating the dimension for \(L_2\)-approximation, Efficient algorithms for multivariate and \(\infty\)-variate integration with exponential weight, Infinite-dimensional integration in weighted Hilbert spaces: anchored decompositions, optimal deterministic algorithms, and higher-order convergence, Deterministic multi-level algorithms for infinite-dimensional integration on \(\mathbb R^{\mathbb N}\), Liberating the dimension for function approximation: standard information, Existence and construction of shifted lattice rules with an arbitrary number of points and bounded weighted star discrepancy for general decreasing weights, Liberating the dimension for function approximation, Tractability of infinite-dimensional integration in the worst case and randomized settings, Weighted geometric discrepancies and numerical integration on reproducing kernel Hilbert spaces, On equivalence of weighted anchored and ANOVA spaces of functions with mixed smoothness of order one in \(L_1\) or \(L_\infty\), Multi-level Monte Carlo algorithms for infinite-dimensional integration on \(\mathbb R^{\mathbb N}\), Optimal randomized changing dimension algorithms for infinite-dimensional integration on function spaces with ANOVA-type decomposition, The cost of deterministic, adaptive, automatic algorithms: cones, not balls, Multi-level quasi-Monte Carlo finite element methods for a class of elliptic PDEs with random coefficients, On tractability of linear tensor product problems for \(\infty \)-variate classes of functions, On weighted Hilbert spaces and integration of functions of infinitely many variables, Tractability of approximation of \(\infty\)-variate functions with bounded mixed partial derivatives, Infinite-dimensional integration on weighted Hilbert spaces, QUASI-MONTE CARLO METHODS FOR HIGH-DIMENSIONAL INTEGRATION: THE STANDARD (WEIGHTED HILBERT SPACE) SETTING AND BEYOND, QMC Galerkin Discretization of Parametric Operator Equations, On decompositions of multivariate functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Infinite-dimensional quadrature and approximation of distributions
- Randomly shifted lattice rules for unbounded integrands
- On the convergence rate of the component-by-component construction of good lattice rules
- Generalized tractability for multivariate problems. I: Linear tensor product problems and linear information
- Tractability of multivariate problems. Volume I: Linear information
- Randomly shifted lattice rules with the optimal rate of convergence for unbounded integrands
- New averaging technique for approximating weighted integrals
- When are quasi-Monte Carlo algorithms efficient for high dimensional integrals?
- Component-by-component constructions achieve the optimal rate of convergence for multivariate integration in weighted Korobov and Sobolev spaces
- Complexity of weighted approximation over \(\mathbb{R}\)
- Good lattice rules in weighted Korobov spaces with general weights
- The error bounds and tractability of quasi-Monte Carlo algorithms in infinite dimension
- Fast algorithms for component-by-component construction of rank-1 lattice rules in shift-invariant reproducing kernel Hilbert spaces
- On decompositions of multivariate functions
- On the topology of a polymer ring
- Constructing Randomly Shifted Lattice Rules in Weighted Sobolev Spaces
- On tractability of path integration
- A new algorithm and worst case complexity for Feynman-Kac path integration.
- Intractability results for integration and discrepancy
