Implicit partitioning methods for unknown parameter sets. In the context of the reduced basis method (Q904245)
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 6529418
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Implicit partitioning methods for unknown parameter sets. In the context of the reduced basis method |
scientific article; zbMATH DE number 6529418 |
Statements
Implicit partitioning methods for unknown parameter sets. In the context of the reduced basis method (English)
0 references
13 January 2016
0 references
In this paper, the author generalizes the partitioning concepts developed for deterministic and compact parameter domains to arbitrary, possibly unknown parameter sets. Moreover, the author shows some new implicit partitioning methods which also outperform the existing methods for wide classes of problems even in the setting of known parameter domains. Finally, they give some numerical examples and compare the different methods.
0 references
model reduction
0 references
reduced basis method
0 references
empirical interpolation method
0 references
parametrized partial differential equations
0 references
adaptive partitioning
0 references
0 references
0 references
0 references
0 references
0.7905949950218201
0 references
0.7613247632980347
0 references
0.7600703239440918
0 references
0.7547879219055176
0 references
