Comparison between reduced basis and stochastic collocation methods for elliptic problems (Q461211)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6353558
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Comparison between reduced basis and stochastic collocation methods for elliptic problems |
scientific article; zbMATH DE number 6353558 |
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
0.8029778599739075
0 references
0.7890816330909729
0 references
0.7665109038352966
0 references
0.76301109790802
0 references
