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

带块相对误差控制的$\boldsymbol{\u210b}^2$-矩阵自适应乘法

Adaptive multiplication of $\mathcal{H}^2$-matrices with block-relative error control

Steffen Börm

AI总结:

针对非局部算子离散化得到的大型稠密矩阵处理需求,提出一种带块相对误差控制的$\u210b^2$-矩阵乘法算法,借助专用树结构实现严格误差控制,支撑更高级的矩阵运算。

摘要:

非局部算子(例如偏微分方程的解算子或积分算子)的离散化会产生大型稠密矩阵。$\u210b^2$-矩阵利用这些矩阵中的局部低秩结构,提供高效的数据稀疏近似,使我们能够高效处理大型矩阵,例如对于局部秩为$k$的$n$维矩阵,将存储需求降至$\u210b(n k)$,并将矩阵-向量乘法的复杂度降至$\u210b(n k)$次运算。\n为了执行更高级的运算,例如构建高效预处理器或计算矩阵函数,我们需要以$\u210b^2$-矩阵为输入并再次用$\u210b^2$-矩阵近似结果的算法,理想情况下精度可控。在本文中,我们提出一种算法,用于近似两个$\u210b^2$-矩阵的乘积,并保证结果子矩阵的块相对误差估计。该算法使用专门的树结构在中间步骤表示精确乘积,从而使我们能够应用数学上严格的误差控制策略。

英文摘要:

The discretization of non-local operators, e.g., solution operators of partial differential equations or integral operators, leads to large densely populated matrices. $\mathcal{H}^2$-matrices take advantage of local low-rank structures in these matrices to provide an efficient data-sparse approximation that allows us to handle large matrices efficiently, e.g., to reduce the storage requirements to $\mathcal{O}(n k)$ for $n$-dimensional matrices with local rank $k$, and to reduce the complexity of the matrix-vector multiplication to $\mathcal{O}(n k)$ operations. In order to perform more advanced operations, e.g., to construct efficient preconditioners or evaluate matrix functions, we require algorithms that take $\mathcal{H}^2$-matrices as input and approximate the result again by $\mathcal{H}^2$-matrices, ideally with controllable accuracy. In this manuscript, we introduce an algorithm that approximates the product of two $\mathcal{H}^2$-matrices and guarantees block-relative error estimates for the submatrices of the result. It uses specialized tree structures to represent the exact product in an intermediate step, thereby allowing us to apply mathematically rigorous error control strategies.

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

↑