Discrepancy, integration and tractability
From MaRDI portal
Recommendations
- Low discrepancy sequences in high dimensions: how well are their projections distributed?
- \(L_2\) discrepancy and multivariate integration
- Entropy, Randomization, Derandomization, and Discrepancy
- When are quasi-Monte Carlo algorithms efficient for high dimensional integrals?
- scientific article; zbMATH DE number 4082826
Cited in
(28)- Discrepancy-based error estimates for quasi-Monte Carlo. II: Results in one dimension
- Paradox of integration -- a computational model
- BMO and exponential Orlicz space estimates of the discrepancy function in arbitrary dimension
- Tusnády's problem, the transference principle, and non-uniform QMC sampling
- Discrepancy theory and its applications
- Tractability properties of the discrepancy in Orlicz norms
- Connections between numerical integration, discrepancy, dispersion, and universal discretization
- Proof techniques in quasi-Monte Carlo theory
- Quasi-Monte Carlo methods for integration of functions with dominating mixed smoothness in arbitrary dimension
- Low discrepancy sequences in high dimensions: how well are their projections distributed?
- When are integration and discrepancy tractable?
- Discrepancy-based additive bounding procedures
- Some results on the complexity of numerical integration
- Optimal quasi-Monte Carlo rules on order 2 digital nets for the numerical integration of multivariate periodic functions
- \(L_2\) discrepancy and multivariate integration
- scientific article; zbMATH DE number 1390114 (Why is no real title available?)
- A sharp discrepancy bound for jittered sampling
- Discrepancy theory and quasi-Monte Carlo integration
- Calculation of discrepancy measures and applications
- Digital inversive vectors can achieve polynomial tractability for the weighted star discrepancy and for multivariate integration
- Probabilistic discrepancy bound for Monte Carlo point sets
- Statistical properties of generalized discrepancies
- Solving some discrepancy problems in NC
- Bounds for the weighted L^p discrepancy and tractability of integration
- Heuristic approaches to obtain low-discrepancy point sets via subset selection
- The L₁-Discrepancy with Nonnegative Weights Suffers from the Curse of Dimensionality
- Upper bounds for generalized L_p-discrepancy of random points
- Bases in function spaces, sampling, discrepancy, numerical integration
This page was built for publication: Discrepancy, integration and tractability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2926214)