Comparison between reduced basis and stochastic collocation methods for elliptic problems (Q461211): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s10915-013-9764-2 / rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/jscic/ChenQR14 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10915-013-9764-2 / rank | |||
Normal rank | |||
Latest revision as of 18:13, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Comparison between reduced basis and stochastic collocation methods for elliptic problems |
scientific article |
Statements
Comparison between reduced basis and stochastic collocation methods for elliptic problems (English)
0 references
10 October 2014
0 references
stochastic elliptic problem
0 references
reduced basis method
0 references
stochastic collocation method
0 references
sparse grid
0 references
greedy algorithm
0 references
offline-online computational decomposition
0 references
convergence analysis
0 references
numerical experiment
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
