Design of computer experiments: space filling and beyond
From MaRDI portal
Publication:693293
DOI10.1007/s11222-011-9242-3zbMath1252.62080OpenAlexW2171993497MaRDI QIDQ693293
Werner G. Müller, Luc Pronzato
Publication date: 7 December 2012
Published in: Statistics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11222-011-9242-3
Related Items
On Design Orthogonality, Maximin Distance, and Projection Uniformity for Computer Experiments ⋮ Optimal design for correlated processes with input-dependent noise ⋮ Extremal measures maximizing functionals based on simplicial volumes ⋮ A Framework for Controlling Sources of Inaccuracy in Gaussian Process Emulation of Deterministic Computer Experiments ⋮ Warped Gaussian Processes and Derivative-Based Sequential Designs for Functions with Heterogeneous Variations ⋮ Asymptotic analysis of the role of spatial sampling for covariance parameter estimation of Gaussian processes ⋮ Optimal operation policy for a sustainable recirculation aquaculture system for ornamental fish: simulation and response surface methodology ⋮ Population parametrization of costly black box models using iterations between SAEM algorithm and Kriging ⋮ Efficient quantisation and weak covering of high dimensional cubes ⋮ Optimization of black-box problems using Smolyak grids and polynomial approximations ⋮ On the optimal designs for the prediction of Ornstein-Uhlenbeck sheets ⋮ Gaussian Process Regression on Nested Spaces ⋮ Unnamed Item ⋮ Assessing Basin Identification Methods for Locating Multiple Optima ⋮ On the maximin distance properties of orthogonal designs via the rotation ⋮ Parameter Selection in Gaussian Process Interpolation: An Empirical Study of Selection Criteria ⋮ Moderate deviations inequalities for Gaussian process regression ⋮ Computer experiment designs for accurate prediction ⋮ Unnamed Item ⋮ Faster Kriging: Facing High-Dimensional Simulators ⋮ Covering of high-dimensional cubes and quantization ⋮ Sequential Design of Experiment for Sparse Polynomial Chaos Expansions ⋮ Adaptive Numerical Designs for the Calibration of Computer Codes ⋮ Non-lattice Covering and Quantization of High Dimensional Sets ⋮ Optimal space-filling design for symmetrical global sensitivity analysis of complex black-box models ⋮ Incremental space-filling design based on coverings and spacings: improving upon low discrepancy sequences ⋮ A standardized distance-based index to assess the quality of space-filling designs ⋮ Measures minimizing regularized dispersion ⋮ Emulating dynamic non-linear simulators using Gaussian processes ⋮ Composite likelihood estimation for a Gaussian process under fixed domain asymptotics ⋮ On the construction of uncertain time series surrogates using polynomial chaos and Gaussian processes ⋮ Maximin distance designs based on densest packings ⋮ A geometric branch and bound method for robust maximization of convex functions ⋮ Nonparametric estimation of probabilistic sensitivity measures ⋮ Data-driven stochastic inversion via functional quantization ⋮ Space-filling orthogonal arrays of strength two ⋮ Least squares polynomial chaos expansion: a review of sampling strategies ⋮ Reliable crack detection in a rotor system with uncertainties via advanced simulation models based on kriging and polynomial chaos expansion ⋮ Connecting U-type designs before and after level permutations and expansions ⋮ The BLUE in continuous-time regression models with correlated errors ⋮ Memory-guided foraging and landscape design interact to determine ecosystem services ⋮ Optimal spatial monitoring of populations described by reaction-diffusion models ⋮ Analyzing stochastic computer models: a review with opportunities ⋮ Sparse Polynomial Chaos Expansions: Literature Survey and Benchmark ⋮ Screening: from tornado diagrams to effective dimensions ⋮ Augmented block designs for unreplicated trials ⋮ Numerical computation of triangular complex spherical designs with small mesh ratio ⋮ Cross-Validation--based Adaptive Sampling for Gaussian Process Models ⋮ Optimal designs for parameters of shifted Ornstein-Uhlenbeck sheets measured on monotonic sets ⋮ Performance analysis of greedy algorithms for minimising a maximum mean discrepancy
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Exploratory designs for computational experiments
- Nested maximin Latin hypercube designs
- Optimal designs which are efficient for lack of fit tests
- Cases for the nugget in modeling computer experiments
- Equidistant and \(D\)-optimal designs for parameters of Ornstein-Uhlenbeck process
- A class of Rényi information estimators for multidimensional densities
- Two-dimensional minimax Latin hypercube designs
- Kriging metamodeling in simulation: a review
- Construction of nested space-filling designs
- Sample estimate of the entropy of a random vector
- Bounds for eigenvalues using traces
- Eigenvalues of euclidean distance matrices
- Norm estimates for inverses of Euclidean distance matrices
- Mean squared prediction error in the spatial linear model with estimated covariance parameters
- On the estimation of entropy
- Interpolation of spatial data. Some theory for kriging
- Lower bounds for norms of inverses of interpolation matrices for radial basis functions
- Genetic algorithms and tabu search: Hybrids for optimization
- Model-oriented design of experiments
- On the entropic regularization method for solving min-max problems with applications
- Covering a rectangle with equal circles
- Lattice-based \(D\)-optimum design for Fourier regression
- Probability theory of classical Euclidean optimization problems
- DeWall: a fast divide and conquer Delaunay triangulation algorithm in \(E^d\).
- The design and analysis of computer experiments.
- Design and analysis of computer experiments. With comments and a rejoinder by the authors
- Optimal exact experimental designs with correlated errors through a simulated annealing algorithm
- Dense packings of equal spheres in a cube
- Asymptotics for Euclidean functionals with power-weighted edges
- Possible generalization of Boltzmann-Gibbs statistics.
- Spatial designs and properties of spatial correlation: effects on covariance estimation
- Spatial sampling design for parameter estimation of the covariance function
- Optimal experimental design and some related control problems
- Space-filling Latin hypercube designs for computer experiments
- An efficient algorithm for constructing optimal design of computer experiments
- Comparison of designs for computer experiments
- Norms of inverses and condition numbers for matrices associated with scattered data
- A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
- Optimal designs for parameter estimation of the Ornstein-Uhlenbeck process
- Bounds for Maximin Latin Hypercube Designs
- Equally spaced design points in polynomial regression: A comparison of systematic sampling methods with the optimal design of experiments
- The Equivalence of Two Extremum Problems
- A Finite Packing Problem
- The correct Kriging variance estimated by bootstrapping
- Maximin Latin Hypercube Designs in Two Dimensions
- Towards reconciling two asymptotic frameworks in spatial statistics
- Optimal orthogonal-array-based latin hypercubes
- Nonsmooth Coordination and Geometric Optimization via Distributed Dynamical Systems
- A comparison of equally spaced designs with different correlation structures in one and more dimensions
- Spatial designs when the observations are correlated
- Mean Squared Error of Estimation or Prediction Under a General Linear Model
- An Algorithm for the Construction of "D-Optimal" Experimental Designs
- Orthogonal Array-Based Latin Hypercubes
- The Bootstrap and Kriging Prediction Intervals
- Uniform Design: Theory and Application
- Estimating the Prediction Mean Squared Error in Gaussian Stochastic Processes with Exponential Correlation Structure
- Collecting Spatial Data
- Übersichtsarbeiten
- Scattered Data Approximation
- On the effect of covariance function estimation on the accuracy of kriging predictors
This page was built for publication: Design of computer experiments: space filling and beyond
