scientific article; zbMATH DE number 1246220
From MaRDI portal
Publication:4226443
Recommendations
Cited in
(only showing first 100 items - show all)- Lower bounds of the wrap-around \(L_2\)-discrepancy and relationships between MLHD and uniform design with a large size
- What is the relativistic Volterra lattice?
- Wrap-around \(L_2\)-discrepancy of random sampling Latin hypercube and uniform designs
- The price of pessimism for multidimensional quadrature
- Tractability of multivariate integration for periodic functions
- Tractability of multivariate integration for weighted Korobov classes
- The existence of good extensible rank-1 lattices
- Component-by-component constructions achieve the optimal rate of convergence for multivariate integration in weighted Korobov and Sobolev spaces
- My dream quadrature rule
- Characterization of generalized aberration of some designs in terms of their complementary designs
- A note on optimal foldover design.
- A note on construction of nearly uniform designs with large number of runs.
- Lower bounds for centered and wrap-around \(L_2\)-discrepancies and construction of uniform designs by threshold accepting.
- The discrepancy and gain coefficients of scrambled digital nets.
- Effective lower bounds of wrap-around L₂-discrepancy on three-level combined designs
- Projection uniformity under mixture discrepancy
- Designing uniform computer sequential experiments with mixture levels using Lee discrepancy
- New results on quaternary codes and their Gray map images for constructing uniform designs
- Minimum projection uniformity for computer experiment with quantitative factors
- Multivariate integration in weighted Hilbert spaces based on Walsh functions and weighted Sobolev spaces
- The effective dimension and quasi-Monte Carlo integration
- A useful result in searches for good vertex-modified number-theoretic rules
- Random weights, robust lattice rules and the geometry of the \(cbcrc\) algorithm
- Goodness-of-fit statistics, discrepancies and robust designs
- How does Grover walk recognize the shape of crystal lattice?
- Variance reduction with array-RQMC for tau-leaping simulation of stochastic biological and chemical reaction networks
- A new foldover strategy and optimal foldover plans for three-level design
- Multiple doubling: a simple effective construction technique for optimal two-level experimental designs
- Sharp lower bounds of various uniformity criteria for constructing uniform designs
- Uniformity pattern of q-level factorials under mixture discrepancy
- New recommended designs for screening either qualitative or quantitative factors
- A novel non-heuristic search technique for constructing uniform designs with a mixture of two- and four-level factors: a simple industrial applicable approach
- Uniform design with prior information of factors under weighted wrap-around \(L_2\)-discrepancy
- Designing optimal large four-level experiments: a new technique without recourse to optimization softwares
- Construction of multi-level space-filling designs via code mappings
- Search for minimum aberration designs with uniformity
- Level-augmented uniform designs
- Building some bridges among various experimental designs
- Lattice meets lattice: application of lattice cubature to models in lattice gauge theory
- Construction of uniform mixed-level designs through level permutations
- Improving the space-filling behavior of multiple triple designs
- New lower bound for Lee discrepancy of asymmetrical factorials
- An appealing technique for designing optimal large experiments with three-level factors
- Variance-based adaptive sequential sampling for polynomial chaos expansion
- Construction of uniform designs without replications
- New lower bounds to wrap-around L₂-discrepancy for U-type designs with three-level
- Construction of four-level and mixed-level designs with zero Lee discrepancy
- Tripling of fractional factorial designs
- Comment on ``Probabilistic integration: a role in statistical computation?
- A new lower bound for wrap-around \(L_2\)-discrepancy on two and three mixed level factorials
- Constructing uniform designs under mixture discrepancy
- Construction of uniform designs via an adjusted threshold accepting algorithm
- Optimum addition of information to computer experiments in view of uniformity and orthogonality
- Mixture discrepancy for quasi-random point sets
- Construction of Sudoku designs and Sudoku-based uniform designs
- A note on the connection between uniformity and generalized minimum aberration
- Searching for extensible Korobov rules
- Lower bounds of various criteria in experimental designs
- Fast component-by-component construction of rank-1 lattice rules with a non-prime number of points
- A lower bound for the centered \(L_2\)-discrepancy on asymmetric factorials and its application
- Uniform supersaturated design and its construction
- Bad lattice points
- Lower bounds for wrap-around \(L_2\)-discrepancy and constructions of symmetrical uniform designs
- Maximin \(L_1\)-distance range-fixed level-augmented designs
- Asymptotic properties of the spectral test, diaphony, and related quantities
- Automatic evaluations of cross-derivatives
- scientific article; zbMATH DE number 5901636 (Why is no real title available?)
- On the step-by-step construction of quasi--Monte Carlo integration rules that achieve strong tractability error bounds in weighted Sobolev spaces
- Exponential convergence and tractability of multivariate integration for Korobov spaces
- Spherical discrepancy for designs on hyperspheres
- Construction of uniform U-designs
- Lower bounds and stochastic optimization algorithms for uniform designs with three or four levels
- Fast algorithms for component-by-component construction of rank-1 lattice rules in shift-invariant reproducing kernel Hilbert spaces
- New lower bound for centered L₂-discrepancy of four-level U-type designs
- Constructing uniform designs: A heuristic integer programming method
- Orthogonal arrays for estimating global sensitivity indices of non-parametric models based on ANOVA high-dimensional model representation
- Variance bounds and existence results for randomly shifted lattice rules
- Lattice Rules by Component Scaling
- Some new lower bounds to centered and wrap-round \(L_2\)-discrepancies
- Generation of space-filling uniform designs in unit hypercubes
- Efficient lattice assessment for LCG and GLP parameter searches
- Effective dimension of some weighted pre-Sobolev spaces with dominating mixed partial derivatives
- Uniformity in double designs
- Two- and three-level lower bounds for mixture \(L_2\)-discrepancy and construction of uniform designs by threshold accepting
- Construction of second-order orthogonal sliced Latin hypercube designs
- Lattice algorithms for multivariate approximation in periodic spaces with general weight parameters
- A catalog of optimal foldover plans for constructing U-uniform minimum aberration four-level combined designs
- Novel techniques for performing successful follow-up experiments based on prior information from initial-stage experiments
- Constructing optimal router bit life sequential experimental designs: New results with a case study
- Component-by-component construction of randomized rank-1 lattice rules achieving almost the optimal randomized error rate
- Symmetrical design for symmetrical global sensitivity analysis of model output
- Worst-Case Error for Unshifted Lattice Rules Without Randomisation
- Asymmetric uniform designs based on mixture discrepancy
- Fast component-by-component construction of lattice algorithms for multivariate approximation with POD and SPOD weights
- Constructing optimal projection designs
- Negative dependence, scrambled nets, and variance bounds
- Construction algorithms for polynomial lattice rules for multivariate integration
- On figures of merit for randomly-shifted lattice rules
- Statistical properties of generalized discrepancies
- Lower bounds of various discrepancies on combined designs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4226443)
