Sparse approximation of multilinear problems with applications to kernel-based methods in UQ

Fabio Nobile, Raul Tempone, Sören Wolfers

Research output: Contribution to journalArticlepeer-review

3 Scopus citations


We provide a framework for the sparse approximation of multilinear problems and show that several problems in uncertainty quantification fit within this framework. In these problems, the value of a multilinear map has to be approximated using approximations of different accuracy and computational work of the arguments of this map. We propose and analyze a generalized version of Smolyak’s algorithm, which provides sparse approximation formulas with convergence rates that mitigate the curse of dimension that appears in multilinear approximation problems with a large number of arguments. We apply the general framework to response surface approximation and optimization under uncertainty for parametric partial differential equations using kernel-based approximation. The theoretical results are supplemented by numerical experiments.
Original languageEnglish (US)
Pages (from-to)247-280
Number of pages34
JournalNumerische Mathematik
Issue number1
StatePublished - Nov 16 2017

Bibliographical note

KAUST Repository Item: Exported on 2020-10-01
Acknowledged KAUST grant number(s): 2281
Acknowledgements: S. Wolfers and R. Tempone are members of the KAUST Strategic Research Initiative, Center for Uncertainty Quantification in Computational Sciences and Engineering. R. Tempone received support from the KAUST CRG3 Award Ref: 2281. F. Nobile received support from the Center for ADvanced MOdeling Science (CADMOS). We thank Abdul-Lateef Haji-Ali for many helpful discussions.


Dive into the research topics of 'Sparse approximation of multilinear problems with applications to kernel-based methods in UQ'. Together they form a unique fingerprint.

Cite this