Modification of the Maximin and ϕp (Phi) Criteria to Achieve Statistically Uniform Distribution of Sampling Points
From MaRDI portal
Publication:6636554
DOI10.1080/00401706.2019.1639550MaRDI QIDQ6636554FDOQ6636554
Authors: Miroslav Vořechovský, Ján Eliaš
Publication date: 12 November 2024
Published in: Technometrics (Search for Journal in Brave)
Cites Work
- Algorithm 823
- Minimax and Minimax Projection Designs Using Clustering
- The design and analysis of computer experiments.
- A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
- Large Sample Properties of Simulations Using Latin Hypercube Sampling
- Title not available (Why is that?)
- Maximum projection designs for computer experiments
- On the distribution of points in a cube and the approximate evaluation of integrals
- On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals
- Energy statistics: a class of statistics based on distances
- Orthogonal Array-Based Latin Hypercubes
- Exploratory designs for computational experiments
- Title not available (Why is that?)
- Low-discrepancy and low-dispersion sequences
- Discrépances de suites associées à un système de numération (en dimension un)
- Uniformly distributed sequences with an additional uniform property
- A generalized discrepancy and quadrature error bound
- Wrap-around \(L_2\)-discrepancy of random sampling Latin hypercube and uniform designs
- Title not available (Why is that?)
- Uniform Design: Theory and Application
- High-dimensional integration: The quasi-Monte Carlo way
- Funktionen von beschränkter Variation in der Theorie der Gleichverteilung
- Point sets and sequences with small discrepancy
- Algorithmic construction of optimal symmetric Latin hypercube designs.
- Title not available (Why is that?)
- Scrambling Sobol' and Niederreiter-Xing points
- Randomization of Number Theoretic Methods for Multiple Integration
- A study on algorithms for optimization of Latin hypercubes
- Finding maximin Latin hypercube designs by iterated local search heuristics
- Space-filling Latin hypercube designs for computer experiments
- Bounds for maximin Latin hypercube designs
- An efficient algorithm for constructing optimal design of computer experiments
- Maximin Latin Hypercube Designs in Two Dimensions
- Nested maximin Latin hypercube designs
- Title not available (Why is that?)
- Centered \(L_2\)-discrepancy of random sampling and Latin hypercube design, and construction of uniform designs
- \(I\)-binomial scrambling of digital nets and sequences
- Controlling Correlations in Latin Hypercube Samples
- Title not available (Why is that?)
- Construction algorithms for higher order polynomial lattice rules
- Construction of sliced maximin-orthogonal Latin hypercube designs
- Higher order scrambled digital nets achieve the optimal rate of the root mean square error for smooth integrands
- An algorithm for fast optimal Latin hypercube design of experiments
- Some applications of number-theoretic methods in statistics
- Theory and application of uniform experimental designs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Support points
- An efficient optimum Latin hypercube sampling technique based on sequencing optimisation using simulated annealing
- Interleaved lattice-based minimax distance designs
- Design for Sequential Follow-Up Experiments in Computer Emulations
This page was built for publication: Modification of the Maximin and ϕp (Phi) Criteria to Achieve Statistically Uniform Distribution of Sampling Points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6636554)