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

一种新的Krylov子空间方法用于近似大规模矩阵函数的Fréchet导数

A novel Krylov subspace method for approximating Fréchet derivatives of large-scale matrix functions

EPFL(洛桑联邦理工学院)

Daniel Kressner, Peter Oehme

AI总结:

本文提出了一种改进的Arnoldi算法,用于更有效地计算大规模矩阵函数的Fréchet导数,以提升收敛性分析和数值性能。

摘要:

我们提出了一种新的Krylov子空间方法,用于近似$ L_f(A, E) \vc{b} $,即大规模矩阵函数$f(A)$的Fréchet导数$L_f(A, E)$在方向$E$上的矩阵向量积,这在涉及矩阵函数的灵敏度分析中自然出现,例如网络中的中心性度量。它也出现在基于梯度的优化问题中,例如当将演化方程拟合到观测解轨迹时。原则上,已知的恒等式$$ f\left( \begin{bmatrix} A & E \ 0 & A \end{bmatrix} \right) \begin{bmatrix} 0 \ \vc{b} \end{bmatrix} = \begin{bmatrix} L_f(A, E) \vc{b} \ f(A) \vc{b} \end{bmatrix}, $$允许直接应用任何标准的Krylov子空间方法,如Arnoldi算法,来解决此任务。然而,这带来了主要的缺点,即涉及的块三角矩阵具有不利的谱特性,这阻碍了收敛性分析,并在一定程度上也影响了实际收敛性。为了避免这些困难,我们提出了一种Arnoldi算法的新型修改方法,旨在更好地保持块三角结构。从而,这使得可以将修改后的算法的收敛性与$ f^\prime $在$ A $的数值域上的最佳多项式逼近进行界。几个数值实验展示了我们的发现。

英文摘要:

We present a novel Krylov subspace method for approximating $L_f(A, E) \vc{b}$, the matrix-vector product of the Fréchet derivative $L_f(A, E)$ of a large-scale matrix function $f(A)$ in direction $E$, a task that arises naturally in the sensitivity analysis of quantities involving matrix functions, such as centrality measures for networks. It also arises in the context of gradient-based methods for optimization problems that feature matrix functions, e.g., when fitting an evolution equation to an observed solution trajectory. In principle, the well-known identity \[ f\left( \begin{bmatrix} A & E \\ 0 & A \end{bmatrix} \right) \begin{bmatrix} 0 \\ \vc{b} \end{bmatrix} = \begin{bmatrix} L_f(A, E) \vc{b} \\ f(A) \vc{b} \end{bmatrix}, \] allows one to directly apply any standard Krylov subspace method, such as the Arnoldi algorithm, to address this task. However, this comes with the major disadvantage that the involved block triangular matrix has unfavorable spectral properties, which impede the convergence analysis and, to a certain extent, also the observed convergence. To avoid these difficulties, we propose a novel modification of the Arnoldi algorithm that aims at better preserving the block triangular structure. In turn, this allows one to bound the convergence of the modified method by the best polynomial approximation of the derivative $f^\prime$ on the numerical range of $A$. Several numerical experiments illustrate our findings.

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

↑