The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
RECURSIVE CO-KRIGING MODEL FOR DESIGN OF COMPUTER EXPERIMENTS WITH MULTIPLE LEVELS OF FIDELITY
Open accessAbstract
We consider in this paper the problem of building a fast-running approximation-also called surrogate model-of a complex computer code.The co-kriging based surrogate model is a promising tool to build such an approximation when the complex computer code can be run at different levels of accuracy.We present here an original approach to perform a multi-fidelity co-kriging model which is based on a recursive formulation.We prove that the predictive mean and the variance of the presented approach are identical to the ones of the original co-kriging model.However, our new approach allows to obtain original results.First, closed-form formulas for the universal co-kriging predictive mean and variance are given.Second, a fast cross-validation procedure for the multi-fidelity co-kriging model is introduced.Finally, the proposed approach has a reduced computational complexity compared to the previous one.The multi-fidelity model is successfully applied to emulate a hydrodynamic simulator.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Gaussian Processes for Machine Learning
Rasmussen, C. E., & Williams, C. K. I. (2005) · doi:10.7551/mitpress/3206.001.0001 · Cited by 11,705
Jeffreys, H., Moran, P. A. P., & Chatfield, C. (1922) · Nature · doi:10.1093/oso/9780198503682.001.0001 · Cited by 7,878
Design and Analysis of Computer Experiments
Sacks, J., Welch, W. J., Mitchell, T. J., & Wynn, H. P. (1989) · Statistical Science · doi:10.1214/ss/1177012413 · Cited by 6,919
Bayesian calibration of computer models
Kennedy, M. C., & O'Hagan, A. (2001) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/1467-9868.00294 · Cited by 4,222
Recovery of inter-block information when block sizes are unequal
PATTERSON, H. D., & THOMPSON, R. (1971) · Biometrika · doi:10.1093/biomet/58.3.545 · Cited by 4,058
Large Sample Properties of Simulations Using Latin Hypercube Sampling
Stein, M. (1987) · Technometrics · doi:10.1080/00401706.1987.10488205 · Cited by 2,471
A statistical approach to some basic mine valuation problems on the Witwatersrand
Krige, D. G. (1951) · Journal of the Southern African Institute of Mining and Metallurgy · Cited by 2,409
Stein, M. L. (1999) · Springer Series in Statistics · doi:10.1007/978-1-4612-1494-6 · Cited by 2,348
The Design and Analysis of Computer Experiments
Santner, T. J., Williams, B. J., & Notz, W. I. (2003) · Springer Series in Statistics · doi:10.1007/978-1-4757-3799-8 · Cited by 2,170
Predicting the output from a complex computer code when fast approximations are available
Kennedy, M. (2000) · Biometrika · doi:10.1093/biomet/87.1.1 · Cited by 1,605
Design and Modeling for Computer Experiments
Fang, K.-T., Li, R., & Sudjianto, A. (2005) · Chapman & Hall/CRC eBooks · doi:10.1201/9781420034899 · Cited by 1,138
Multi-fidelity optimization via surrogate modelling
Forrester, A. I. J., Sóbester, A., & Keane, A. J. (2007) · Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.2007.1900 · Cited by 1,018
Matrix Algebra from a Statistician's Perspective
Ziegel, E. R., & Harville, D. A. (1998) · Technometrics · doi:10.2307/1270666 · Cited by 880
Currin, C., Mitchell, T., Morris, M., & Ylvisaker, D. (1991) · Journal of the American Statistical Association · doi:10.1080/01621459.1991.10475138 · Cited by 753
A Framework for Validation of Computer Models
Bayarri, M. J., Berger, J. O., Paulo, R., Sacks, J., Cafeo, J. A., Cavendish, J., Lin, C.-H., & Tu, J. (2007) · Technometrics · doi:10.1198/004017007000000092 · Cited by 655
Combining Field Data and Computer Simulations for Calibration and Prediction
Higdon, D., Kennedy, M., Cavendish, J. C., Cafeo, J. A., & Ryne, R. D. (2004) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827503426693 · Cited by 623
Shewry, M. C., & Wynn, H. P. (1987) · Journal of Applied Statistics · doi:10.1080/02664768700000020 · Cited by 603
Matrix Algebra From a Statistician's Perspective
Harville, D. A. (1998) · Technometrics · doi:10.1080/00401706.1998.10485214 · Cited by 528
Diagnostics for Gaussian Process Emulators
Bastos, L. S., & O’Hagan, A. (2009) · Technometrics · doi:10.1198/tech.2009.08019 · Cited by 387
Bayesian Hierarchical Modeling for Integrating Low-Accuracy and High-Accuracy Experiments
Qian, P. Z. G., & Wu, C. F. J. (2008) · Technometrics · doi:10.1198/004017008000000082 · Cited by 336
Kriging and cross‐validation for massive spatial data
Zhang, H., & Wang, Y. (2009) · Environmetrics · doi:10.1002/env.1023 · Cited by 109
A method to improve design reliability using optimal Latin hypercube sampling
Stocki, R. (2005) · DOAJ (DOAJ: Directory of Open Access Journals) · Cited by 100
Cumming, J. A., & Goldstein, M. (2009) · Technometrics · doi:10.1198/tech.2009.08015 · Cited by 71
Craig, P. S., Goldstein, M., Seheult, A. H., & Smith, J. A. (1998) · Journal of the Royal Statistical Society Series D (The Statistician) · doi:10.1111/1467-9884.00115 · Cited by 59
CONSTRUCTION OF NESTED SPACE-FILLING DESIGNSPreprint
Qian, P. Z. G., Ai, M., & Wu, C. (n.d.) · Cited by 51
Cited by
Machine learning of linear differential equations using Gaussian processes
Raissi, M., Perdikaris, P., & Karniadakis, G. E. (2017) · Journal of Computational Physics · doi:10.1016/j.jcp.2017.07.050 · Cited by 584
Recent Advances in Bayesian Optimization
Wang, X., Jin, Y., Schmitt, S., & Olhofer, M. (2023) · ACM Computing Surveys · doi:10.1145/3582078 · Cited by 477
Nonlinear information fusion algorithms for data-efficient multi-fidelity modelling
Perdikaris, P., Raissi, M., Damianou, A., Lawrence, N. D., & Karniadakis, G. E. (2017) · Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.2016.0751 · Cited by 448
Liu, H., Ong, Y.-S., & Cai, J. (2018) · Structural and Multidisciplinary Optimization · doi:10.1007/s00158-017-1739-8 · Cited by 444
Review of multi-fidelity models
Giselle Fernández-Godino, M., & Lawrence Livermore National Laboratory, L. (2023) · Advances in Computational Science and Engineering · doi:10.3934/acse.2023015 · Cited by 368
Metadata
- Authors
- Le Gratiet, L., & Garnier, J.
- Venue
- International Journal for Uncertainty Quantification
- Publisher
- Begell House
- Published
- 2014
- Volume
- 4
- Issue
- 5
- Pages
- 365-386
- ISSN
- 2152-5080 (ISSN-L)
- OpenAlex
- W1972777769
- Cited by
- 388
- References
- 25
- FWCI
- 10.23
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.