Low-rank tensor methods for the approximate solution of second-order elliptic partial differential equations in high dimensions have recently attracted significant attention. A critical issue is to rigorously bound the error of such approximations, not with respect to a fixed finite dimensional discrete background problem, but with respect to the exact solution of the continuous problem. While the energy norm offers a natural error measure corresponding to the underlying operator considered as an isomorphism from the energy space onto its dual, this norm requires a careful treatment in its interplay with the tensor structure of the problem. In this paper we build on our previous work on energy norm-convergent subspace-based tensor schemes contriving, however, a modified formulation which now enforces convergence only in . In order to still be able to exploit the mapping properties of elliptic operators, a crucial ingredient of our approach is the development and analysis of a suitable asymmetric preconditioning scheme. We provide estimates for the computational complexity of the resulting method in terms of the solution error and study the practical performance of the scheme in numerical experiments. In both regards, we find that controlling solution errors in this weaker norm leads to substantial simplifications and to a reduction of the actual numerical work required for a certain error tolerance.
Accepté le :
DOI : 10.1051/m2an/2015071
Mots clés : low-rank tensor approximation, adaptive methods, high-dimensional elliptic problems, preconditioning, computational complexity
@article{M2AN_2016__50_4_1107_0, author = {Bachmayr, M. and Dahmen, W.}, title = {Adaptive low-rank methods for problems on {Sobolev} spaces with error control in $L_{2}$}, journal = {ESAIM: Mathematical Modelling and Numerical Analysis }, pages = {1107--1136}, publisher = {EDP-Sciences}, volume = {50}, number = {4}, year = {2016}, doi = {10.1051/m2an/2015071}, zbl = {1347.41031}, mrnumber = {3521714}, language = {en}, url = {http://www.numdam.org/articles/10.1051/m2an/2015071/} }
TY - JOUR AU - Bachmayr, M. AU - Dahmen, W. TI - Adaptive low-rank methods for problems on Sobolev spaces with error control in $L_{2}$ JO - ESAIM: Mathematical Modelling and Numerical Analysis PY - 2016 SP - 1107 EP - 1136 VL - 50 IS - 4 PB - EDP-Sciences UR - http://www.numdam.org/articles/10.1051/m2an/2015071/ DO - 10.1051/m2an/2015071 LA - en ID - M2AN_2016__50_4_1107_0 ER -
%0 Journal Article %A Bachmayr, M. %A Dahmen, W. %T Adaptive low-rank methods for problems on Sobolev spaces with error control in $L_{2}$ %J ESAIM: Mathematical Modelling and Numerical Analysis %D 2016 %P 1107-1136 %V 50 %N 4 %I EDP-Sciences %U http://www.numdam.org/articles/10.1051/m2an/2015071/ %R 10.1051/m2an/2015071 %G en %F M2AN_2016__50_4_1107_0
Bachmayr, M.; Dahmen, W. Adaptive low-rank methods for problems on Sobolev spaces with error control in $L_{2}$. ESAIM: Mathematical Modelling and Numerical Analysis , Tome 50 (2016) no. 4, pp. 1107-1136. doi : 10.1051/m2an/2015071. http://www.numdam.org/articles/10.1051/m2an/2015071/
Multilevel preconditioning and low rank tensor iteration for space-time simultaneous discretizations of parabolic PDEs. Numer. Linear Algebra Appl. 22 (2015) 317–337. | DOI | MR | Zbl
and ,M. Bachmayr, Adaptive Low-Rank Wavelet Methods and Applications to Two-Electron Schrödinger Equations. Ph.D. thesis, RWTH Aachen (2012).
M. Bachmayr and W. Dahmen, Adaptive low-rank methods: Problems on Sobolev spaces. Preprint arXiv:1407.4919 [math.NA] (2014). | MR
Adaptive near-optimal rank tensor approximation for high-dimensional operator equations. Found. Comput. Math. 15 (2015) 839–898. | DOI | MR | Zbl
and ,A projection method to solve linear systems in tensor format. Numer. Linear Algebra Appl. 20 (2013) 27–43. | DOI | MR | Zbl
and ,Approximation by exponential sums revisited. Appl. Comput. Harmon. Anal. 28 (2010) 131–149. | DOI | MR | Zbl
and ,A tensor approximation method based on ideal minimal residual formulations for the solution of high-dimensional problems. ESAIM: M2AN 48 (2014) 1777–1806. | DOI | Numdam | MR | Zbl
, and ,S.C. Brenner and L.R. Scott, The Mathematical Theory of Finite Element Methods. 3rd edition. Vol. 15 of Texts Appl. Math. Springer (2008) | MR | Zbl
Adaptive wavelet methods for elliptic operator equations: Convergence rates. Math. Comput. 70 (2001) 27–75. | DOI | MR | Zbl
, and ,Stability of multiscale transformations. J. Fourier Anal. Appl. 2 (1996) 341–361. | MR | Zbl
,W. Dahmen, R. DeVore, L. Grasedyck and E. Süli, Tensor-sparsity of solutions to high-dimensional elliptic partial differential equations. Found. Comput. Math. (2015) DOI: . | DOI | MR
An adaptive wavelet method for solving high-dimensional elliptic PDEs. Constr. Approx. 30 (2009) 423–455. | DOI | MR | Zbl
, and ,Alternating minimal energy methods for linear systems in higher dimensions. SIAM J. Sci. Comput. 36 (2014) A2248–A2271. | DOI | MR | Zbl
and ,Orthogonal polynomials and the construction of piecewise polynomial smooth wavelets. SIAM J. Math. Anal. 30 (1999) 1029–1056. | DOI | MR | Zbl
, and ,Existence and computation of low Kronecker-rank approximations for large linear systems of tensor product structure. Computing 72 (2004) 247–265. | DOI | MR | Zbl
,Hierarchical singular value decomposition of tensors. SIAM J. Matrix Anal. Appl. 31 (2010) 2029–2054. | DOI | MR | Zbl
,A literature survey of low-rank tensor approximation techniques. GAMM-Mitteilungen 36 (2013) 53–78. | DOI | MR | Zbl
, and .W. Hackbusch, Entwicklungen nach Exponentialsummen. Technical Report 4, MPI Leipzig (2005).
W. Hackbusch, Tensor Spaces and Numerical Tensor Calculus. Vol. 42 of Springer Series Comput. Math. Springer-Verlag Berlin Heidelberg (2012). | MR | Zbl
Low-rank Kronecker-product approximation to multi-dimensional nonlocal operators. Part I. Separable approximation of multi-variate functions. Computing 76 (2006) 177–202. | DOI | MR | Zbl
and ,A new scheme for the tensor representation. J. Fourier Anal. Appl. 15 (2009) 706–722. | DOI | MR | Zbl
and ,Tensor-structured preconditioners and approximate inverse of elliptic operators in . Constr. Approx. 30 (2009) 599–620. | DOI | MR | Zbl
,-quantics approximation of -d tensors in high-dimensional numerical modeling. Constr. Approx. 34 (2011) 257–280. | DOI | MR | Zbl
,Preconditioned low-rank methods for high-dimensional elliptic PDE eigenvalue problems. Comput. Methods Appl. Math. 11 (2011) 363–381. | DOI | MR | Zbl
and .D. Kressner and A. Uschmajew, On low-rank approximability of solutions to high-dimensional operator equations and eigenvalue problems. Preprint arXiv:1406.7026 [math.NA] (2014). | MR
Low-rank tensor methods with subspace correction for symmetric eigenvalue problems. SIAM J. Sci. Comput. 36 (2014) A2346–A2368. | DOI | MR | Zbl
, and ,Tensor-train decomposition. SIAM J. Sci. Comput. 33 (2011) 2295–2317. | DOI | MR | Zbl
,Breaking the curse of dimensionality, or how to use SVD in many dimensions. SIAM J. Scientific Comput. 31 (2009) 3744–3759. | DOI | MR | Zbl
and ,F. Stenger, Numerical Methods Based on Sinc and Analytic Functions. Vol. 20 of Springer Series Comput. Math. Springer-Verlag (1993). | MR | Zbl
Some mathematical notes on three-mode factor analysis. Psychometrika 31 (1966) 279–311. | DOI | MR
,Cité par Sources :