A multidimensional data-driven sparse identification technique: the sparse proper generalized decomposition (Q1723001)
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: A multidimensional data-driven sparse identification technique: the sparse proper generalized decomposition |
scientific article; zbMATH DE number 7024982
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A multidimensional data-driven sparse identification technique: the sparse proper generalized decomposition |
scientific article; zbMATH DE number 7024982 |
Statements
A multidimensional data-driven sparse identification technique: the sparse proper generalized decomposition (English)
0 references
19 February 2019
0 references
Summary: Sparse model identification by means of data is especially cumbersome if the sought dynamics live in a high dimensional space. This usually involves the need for large amount of data, unfeasible in such a high dimensional settings. This well-known phenomenon, coined as the curse of dimensionality, is here overcome by means of the use of separate representations. We present a technique based on the same principles of the Proper Generalized Decomposition that enables the identification of complex laws in the low-data limit. We provide examples on the performance of the technique in up to ten dimensions.
0 references
0 references
0 references
0.8675877
0 references
0.86693174
0 references
0.85757685
0 references
0.85324806
0 references
0.85005575
0 references
0.84939295
0 references
0.8484298
0 references
0.8477647
0 references