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 the normal view instead:

scientific article; zbMATH DE number 7024982
Language Label Description Also known as
default for all languages
No label defined
    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
      0 references
      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

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references