Randomized quasi-Monte Carlo methods on triangles: extensible lattices and sequences
From MaRDI portal
Publication:6549580
Recommendations
Cites work
- scientific article; zbMATH DE number 5797591 (Why is no real title available?)
- scientific article; zbMATH DE number 3145344 (Why is no real title available?)
- scientific article; zbMATH DE number 1304526 (Why is no real title available?)
- scientific article; zbMATH DE number 914714 (Why is no real title available?)
- A Koksma–Hlawka Inequality for Simplices
- Algorithm 823
- Component-by-component construction of randomized rank-1 lattice rules achieving almost the optimal randomized error rate
- Constructing Embedded Lattice Rules for Multivariate Integration
- Construction-free median quasi-Monte Carlo rules for function spaces with unspecified smoothness and general weights
- Dependence properties of scrambled Halton sequences
- Extensible Lattice Sequences for Quasi-Monte Carlo Quadrature
- Gaussian quadrature formulas for triangles
- Lattice Integration Rules of Maximal Rank Formed by Copying Rank 1 Rules
- Low discrepancy constructions in the triangle
- Monte Carlo and quasi-Monte Carlo sampling
- On integration methods based on scrambled nets of arbitrary size
- On the dependence structure and quality of scrambled \((t,m,s)\)-nets
- Quasi-Monte Carlo integration for twice differentiable functions over a triangle
- Randomization of Number Theoretic Methods for Multiple Integration
- Remarks on a Multivariate Transformation
- Scrambled net variance for integrals of smooth functions
- The mean square discrepancy of randomized nets
- Transformations and Hardy-Krause variation
- Transforming low-discrepancy sequences from a cube to a simplex
- Verteilungsfunktionen. II.
This page was built for publication: Randomized quasi-Monte Carlo methods on triangles: extensible lattices and sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6549580)
