Sparse approximation of multilinear problems with applications to kernel-based methods in UQ (Q1749442)
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 approximation of multilinear problems with applications to kernel-based methods in UQ |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sparse approximation of multilinear problems with applications to kernel-based methods in UQ |
scientific article |
Statements
Sparse approximation of multilinear problems with applications to kernel-based methods in UQ (English)
0 references
16 May 2018
0 references
This paper develops a general framework for the sparse approximation of multilinear problems using Smolyak's algorithm. The obtained complexity bounds are, up to logarithmic factors, independent of the number of inputs. It is demonstrated that the framework can be used to construct and analyze fast kernel-based algorithms for several problems in uncertainty quantification. The results, which are backed by numerical tests, generalize previous work on sparse wavelet approximation and on the analysis of multilevel algorithms.
0 references
multilinear problems
0 references
sparse approximation
0 references
kernel-based methods
0 references
uncertainty quantification
0 references
Smolyak's algorithm
0 references
0 references
0 references
0 references
0 references
0 references
0.7937822937965393
0 references
0.7730369567871094
0 references
0.773026704788208
0 references
0.7669990062713623
0 references
0.7656145691871643
0 references
