The error bounds and tractability of quasi-Monte Carlo algorithms in infinite dimension
From MaRDI portal
Publication:3147179
DOI10.1090/S0025-5718-01-01377-1zbMath1032.65006OpenAlexW2021578090MaRDI QIDQ3147179
Fred J. Hickernell, Xiaoqun Wang
Publication date: 18 September 2002
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0025-5718-01-01377-1
Hilbert spaceerror boundreproducing kerneltractabilityHalton sequencegeneralized variationinfinite dimensional integrationgeneralized discrepancyquasi-Monte Carlo algorithm
Monte Carlo methods (65C05) Numerical quadrature and cubature formulas (65D32) Complexity and performance of numerical algorithms (65Y20)
Related Items
A constructive approach to strong tractability using quasi-Monte Carlo algorithms, Finite-order weights imply tractability of multivariate integration, Strong tractability of multivariate integration using quasi–Monte Carlo algorithms, QUASI-MONTE CARLO METHODS FOR HIGH-DIMENSIONAL INTEGRATION: THE STANDARD (WEIGHTED HILBERT SPACE) SETTING AND BEYOND, Exact cubature for a class of functions of maximum effective dimension, Strong tractability of integration using scrambled Niederreiter points, Entropy, Randomization, Derandomization, and Discrepancy, Liberating the Dimension for Function Approximation and Integration, The existence of good extensible rank-1 lattices, Liberating the dimension for \(L_2\)-approximation, 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, Tractability of infinite-dimensional integration in the worst case and randomized settings, Efficient algorithms for multivariate and \(\infty\)-variate integration with exponential weight, Weighted geometric discrepancies and numerical integration on reproducing kernel Hilbert spaces, Infinite-dimensional integration in weighted Hilbert spaces: anchored decompositions, optimal deterministic algorithms, and higher-order convergence, Low discrepancy sequences in high dimensions: how well are their projections distributed?, Deterministic multi-level algorithms for infinite-dimensional integration on \(\mathbb R^{\mathbb N}\), Infinite-dimensional integration and the multivariate decomposition method, Good lattice rules in weighted Korobov spaces with general weights, 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, Optimal randomized changing dimension algorithms for infinite-dimensional integration on function spaces with ANOVA-type decomposition, Multi-level Monte Carlo algorithms for infinite-dimensional integration on \(\mathbb R^{\mathbb N}\), Embeddings for infinite-dimensional integration and \(L_2\)-approximation with increasing smoothness, Hyperbolic cross approximation in infinite dimensions, Infinite-dimensional integration on weighted Hilbert spaces, Calculation of Discrepancy Measures and Applications, The effective dimension and quasi-Monte Carlo integration
Cites Work
- On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals
- When are quasi-Monte Carlo algorithms efficient for high dimensional integrals?
- Integration and approximation in arbitrary dimensions
- Average case complexity of multivariate integration
- Discrépance de suites associées à un système de numération (en dimension s)
- Quasi-Random Sequences and Their Discrepancies
- A generalized discrepancy and quadrature error bound
- On tractability of path integration
- Theory of Reproducing Kernels
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
