NANANov 4, 2015

Low-rank tensor methods for model order reduction

arXiv:1511.0155550 citationsh-index: 30
Originality Synthesis-oriented
AI Analysis

For researchers and practitioners in computational science and engineering, this provides a comprehensive overview of low-rank tensor techniques for model reduction, though it is a review rather than a novel contribution.

This chapter reviews low-rank tensor methods for model order reduction, enabling fast evaluation of parameter-dependent models by replacing complex models with reduced-order approximations. It covers both sampling-based and projection-based approaches for computing low-rank approximations of vector-valued and multivariate functions.

Parameter-dependent models arise in many contexts such as uncertainty quantification, sensitivity analysis, inverse problems or optimization. Parametric or uncertainty analyses usually require the evaluation of an output of a model for many instances of the input parameters, which may be intractable for complex numerical models. A possible remedy consists in replacing the model by an approximate model with reduced complexity (a so called reduced order model) allowing a fast evaluation of output variables of interest. This chapter provides an overview of low-rank methods for the approximation of functions that are identified either with order-two tensors (for vector-valued functions) or higher-order tensors (for multivariate functions). Different approaches are presented for the computation of low-rank approximations, either based on samples of the function or on the equations that are satisfied by the function, the latter approaches including projection-based model order reduction methods. For multivariate functions, different notions of ranks and the corresponding low-rank approximation formats are introduced.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes