00:00:00 / 00:00:00

Adaptive low-rank approximations for stochastic and parametric equations: a subspace point of view

By Anthony Nouy

Appears in collection : MoMaS Conference / Colloque MoMaS

Tensor methods have emerged as an indispensable tool for the numerical solution of high-dimensional problems in computational science, and in particular problems arising in stochastic and parametric analyses. In many practical situations, the approximation of functions of multiple parameters (or random variables) is made computationally tractable by using low-rank tensor formats. Here, we present some results on rank-structured approximations and we discuss the connection between best approximation problems in tree-based low-rank formats and the problem of finding optimal low-dimensional subspaces for the projection of a tensor. Then, we present constructive algorithms that adopt a subspace point of view for the computation of sub-optimal low-rank approximations with respect to a given norm. These algorithms are based on the construction of sequences of suboptimal but nested subspaces.

Keywords: high dimensional problems - tensor numerical methods - projection-based model order reduction - low-rank tensor formats - greedy algorithms - proper generalized decomposition - uncertainty quantification - parametric equations

Information about the video

Citation data

  • DOI 10.24350/CIRM.V.18630403
  • Cite this video Nouy, Anthony (19/11/2014). Adaptive low-rank approximations for stochastic and parametric equations: a subspace point of view. CIRM. Audiovisual resource. DOI: 10.24350/CIRM.V.18630403
  • URL https://dx.doi.org/10.24350/CIRM.V.18630403

Bibliography

Last related questions on MathOverflow

You have to connect your Carmin.tv account with mathoverflow to add question

Ask a question on MathOverflow




Register

  • Bookmark videos
  • Add videos to see later &
    keep your browsing history
  • Comment with the scientific
    community
  • Get notification updates
    for your favorite subjects
Give feedback