Reduced Basis Methods: From Low-Rank Matrices To Low-Rank Tensors

We propose a novel combination of the reduced basis method with low-rank tensor techniques for the efficient solution of parameter-dependent linear systems in the case of several parameters. This combination, called rbTensor, consists of three ingredients. First, the underlying parameter-dependent operator is approximated by an explicit affine representation in a low-rank tensor format. Second, a standard greedy strategy is used to construct a problem-dependent reduced basis. Third, the associated reduced parametric system is solved for all parameter values on a tensor grid simultaneously via a low-rank approach. This allows us to explicitly represent and store an approximate solution for all parameter values at a time. Once this approximation is available, the computation of output functionals and the evaluation of statistics of the solution become a cheap online task, without requiring the solution of a linear system.


Published in:
Siam Journal On Scientific Computing, 38, 4, A2045-A2067
Year:
2016
Publisher:
Philadelphia, Siam Publications
ISSN:
1064-8275
Keywords:
Laboratories:




 Record created 2016-11-21, last modified 2019-12-05


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)