Predicting the output from a complex computer code when fast approximations are available (Q4949535)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Predicting the output from a complex computer code when fast approximations are available |
scientific article; zbMATH DE number 1441430
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Predicting the output from a complex computer code when fast approximations are available |
scientific article; zbMATH DE number 1441430 |
Statements
Predicting the output from a complex computer code when fast approximations are available (English)
0 references
16 December 2001
0 references
computer experiments
0 references
Gaussian processes
0 references
multi-level code
0 references
autoregressive model
0 references
uncertainty analysis
0 references
0.7971596717834473
0 references
0.7826852202415466
0 references
