arXiv Analytics

Sign in

arXiv:2506.19584 [math.NA]AbstractReferencesReviewsResources

Sparse and low-rank approximations of parametric elliptic PDEs: the best of both worlds

Markus Bachmayr, Huqing Yang

Published 2025-06-24Version 1

A new approximation format for solutions of partial differential equations depending on infinitely many parameters is introduced. By combining low-rank tensor approximation in a selected subset of variables with a sparse polynomial expansion in the remaining parametric variables, it addresses in particular classes of elliptic problems where a direct polynomial expansion is inefficient, such as those arising from random diffusion coefficients with short correlation length. A convergent adaptive solver is proposed and analyzed that maintains quasi-optimal ranks of approximations and at the same time yields optimal convergence rates of spatial discretizations without coarsening. The results are illustrated by numerical tests.

Related articles: Most relevant | Search more
arXiv:1607.04444 [math.NA] (Published 2016-07-15)
Parametric PDEs: Sparse or Low-Rank Approximations?
arXiv:1502.03117 [math.NA] (Published 2015-02-10)
Kolmogorov widths and low-rank approximations of parametric elliptic PDEs
arXiv:1902.07455 [math.NA] (Published 2019-02-20)
FFT-based homogenisation accelerated by low-rank approximations