Sparse approximation of multilinear problems with applications to kernel-based methods in UQ
KAUST DepartmentApplied Mathematics and Computational Science Program
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
KAUST Grant Number2281
Online Publication Date2017-11-16
Print Publication Date2018-05
Permanent link to this recordhttp://hdl.handle.net/10754/626181
MetadataShow full item record
AbstractWe 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.
CitationNobile F, Tempone R, Wolfers S (2017) Sparse approximation of multilinear problems with applications to kernel-based methods in UQ. Numerische Mathematik. Available: http://dx.doi.org/10.1007/s00211-017-0932-4.
SponsorsS. 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.