Sparse data-driven quadrature rules via \(\ell^p\)-quasi-norm minimization (Q2134455)
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: Sparse data-driven quadrature rules via ^p-quasi-norm minimization |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sparse data-driven quadrature rules via \(\ell^p\)-quasi-norm minimization |
scientific article |
Statements
Sparse data-driven quadrature rules via \(\ell^p\)-quasi-norm minimization (English)
0 references
3 May 2022
0 references
sparse quadrature rules
0 references
\textsf{FOCUSS} algorithm
0 references
linear programming
0 references
parametrized integrals
0 references
parametrized PDEs
0 references
hyper-reduction
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.7564398050308228
0 references
0.755993127822876
0 references
0.7344524264335632
0 references
0.7343100905418396
0 references
