arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1407.4919math.NAcs.NA
收藏

自适应低秩方法:Sobolev空间中的问题

Adaptive Low-Rank Methods: Problems on Sobolev Spaces

Markus Bachmayr, Wolfgang Dahmen

AI总结:

本文提出了一种基于子空间低秩张量格式的迭代求解器,用于高维二阶椭圆问题,通过自适应确定子空间和稀疏近似,克服了秩增长与精度控制的障碍,同时验证了方法在高维空间中的有效性。

摘要:

本文关注开发和分析一种基于子空间低秩张量格式的迭代求解器,用于高维二阶椭圆问题。子空间和对应稀疏近似均自适应确定。主要障碍是椭圆算子仅在未装备交叉范数的空间中为同构映射。为此,我们设计了一种预处理低秩张量表示的算子的方法。在标准数据假设下,我们证明了连续问题的解的收敛性并保证误差减少。此外,对于解具有特定低秩结构和稀疏表示的情况,我们推导了计算复杂度的界,包括迭代过程中可能产生的张量秩界。我们强调,这些解的假设不进入方案的制定,实际上方案能自动检测这些特性。我们的发现通过数值实验验证了该方法在高维空间中的实用性。

英文摘要:

This paper is concerned with the development and analysis of an iterative solver for high-dimensional second-order elliptic problems based on subspace-based low-rank tensor formats. Both the subspaces giving rise to low-rank approximations and corresponding sparse approximations of lower-dimensional tensor components are determined adaptively. A principal obstruction to a simultaneous control of rank growth and accuracy turns out to be the fact that the underlying elliptic operator is an isomorphism only between spaces that are not endowed with cross norms. Therefore, as central part of this scheme, we devise a method for preconditioning low-rank tensor representations of operators. Under standard assumptions on the data, we establish convergence to the solution of the continuous problem with a guaranteed error reduction. Moreover, for the case that the solution exhibits a certain low-rank structure and representation sparsity, we derive bounds on the computational complexity, including in particular bounds on the tensor ranks that can arise during the iteration. We emphasize that such assumptions on the solution do not enter in the formulation of the scheme, which in fact is shown to detect them automatically. Our findings are illustrated by numerical experiments that demonstrate the practical efficiency of the method in high spatial dimensions.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑