Accelerating the convergence of lattice methods by importance sampling-based transformations
From MaRDI portal
Recommendations
Cites work
- A New Family of Estimators for Random Walk Problems
- Construction algorithms for good extensible lattice rules
- Extensible Lattice Sequences for Quasi-Monte Carlo Quadrature
- Fast convergence of quasi-Monte Carlo for a class of isotropic integrals
- scientific article; zbMATH DE number 3728384 (Why is no real title available?)
- scientific article; zbMATH DE number 53679 (Why is no real title available?)
- scientific article; zbMATH DE number 1304526 (Why is no real title available?)
- scientific article; zbMATH DE number 1103085 (Why is no real title available?)
- scientific article; zbMATH DE number 3440485 (Why is no real title available?)
- scientific article; zbMATH DE number 3377130 (Why is no real title available?)
- scientific article; zbMATH DE number 3386717 (Why is no real title available?)
- scientific article; zbMATH DE number 3187192 (Why is no real title available?)
- scientific article; zbMATH DE number 3196612 (Why is no real title available?)
- Multidimensional quadrature algorithms at higher degree and/or dimension
- Point sets and sequences with small discrepancy
- Quasi-Random Methods for Estimating Integrals Using Relatively Small Samples
- The existence of good extensible rank-1 lattices
- Weighted Uniform Sampling — a Monte Carlo Technique for Reducing Variance
Cited in
(4)
This page was built for publication: Accelerating the convergence of lattice methods by importance sampling-based transformations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5326131)