Predicting the output from a complex computer code when fast approximations are available (Q4949535): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q61856256, #quickstatements; #temporary_batch_1711234560214 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1977046327 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q61856256 / rank | |||
Normal rank | |||
Latest revision as of 02:07, 24 March 2024
scientific article; zbMATH DE number 1441430
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
