Divide and conquer: an incremental sparsity promoting compressive sampling approach for polynomial chaos expansions (Q2309799)
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: Divide and conquer: an incremental sparsity promoting compressive sampling approach for polynomial chaos expansions |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Divide and conquer: an incremental sparsity promoting compressive sampling approach for polynomial chaos expansions |
scientific article |
Statements
Divide and conquer: an incremental sparsity promoting compressive sampling approach for polynomial chaos expansions (English)
0 references
6 April 2020
0 references
compressive sampling
0 references
polynomial chaos expansion
0 references
uncertainty quantification
0 references
sparse approximation
0 references
Legendre polynomials
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.809234619140625
0 references
0.8045528531074524
0 references
0.7858299612998962
0 references
0.7813522219657898
0 references
0.7732764482498169
0 references
