arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2408.04128math.NAcs.NA
收藏

基于非零对角线模式的分裂方法用于计算矩阵函数

Exploiting the nonzero diagonal pattern in matrix function computations

Sharif University of Technology(谢里夫理工大学);Bergische Universität Wuppertal(伍珀塔尔大学)

Majed Hamadi, Nezam Mahdavi-Amiri, Marcel Schweitzer

AI总结:

本文提出基于非零对角线模式的分裂方法,用于高效计算稀疏矩阵函数及Toeplitz矩阵函数,通过稀疏近似提升计算效率。

摘要:

我们考虑近似矩阵函数f(A)的任务,其中A是一个矩阵,其中只有相对少量的(不一定是连续的)次对角线和上对角线包含非零条目。通过低次多项式p近似f,可以得到f(A)的稀疏近似,这可以高效处理(而一般情况下,f(A)是一个密集矩阵,即使A是稀疏的)。我们的方法基于仔细检查p(A)中非零条目可能出现的位置,并识别影响这些条目的A中的条目。特别是,我们说明了这种方法如何用于高效近似f(A)的迹,并识别这种方法与已建立(随机)探测方法用于迹估计的关系。另一个应用领域,我们的方法特别有效的是计算Toeplitz矩阵的函数。在此,研究p(A)的稀疏模式允许我们将整个矩阵多项式计算减少到单个小规模子矩阵的计算,从而得到一个能够异常高效扩展到大问题规模的算法。

英文摘要:

We consider the task of approximating a matrix function $f(A)$, where $A$ is a matrix in which only a relatively small number of (not necessarily consecutive) sub- and superdiagonals contain nonzero entries. Approximating $f$ by a low-degree polynomial $p$ allows us to obtain sparse approximations to $f(A)$, which one can efficiently work with (while, in general, $f(A)$ is a dense matrix, even when $A$ is sparse). Our approach is based on carefully inspecting the locations where nonzeros can occur in $p(A)$, and identifying the entries in $A$ that influence them. In particular, we illustrate how this approach can be used for efficiently approximating the trace of $f(A)$ and identify how this approach is related to established (stochastic) probing methods for trace estimation. Another application area in which our approach works particularly well is the computation of functions of Toeplitz matrices. Here, studying the sparsity pattern of $p(A)$ allows us to reduce the computation of the whole matrix polynomial to that of a single small-scale submatrix, yielding an algorithm that scales exceptionally well to large problem sizes.

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

↑