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

连接 Kaporin 条件数与 Bregman 对数行列式散度

Connecting Kaporin's condition number and the Bregman log determinant divergence

Andreas A. Bock, Martin S. Andersen

AI总结:

本文建立了 Bregman 对数行列式散度与 Kaporin 条件数之间的理论联系,证明在特定条件下两者等价,并指出预条件子仅需常数缩放即可同时最小化二者。

摘要:

本文提出了将 Bregman 对数行列式矩阵散度与 Kaporin 条件数联系起来的一些理论结果。这些可被视为预条件子与给定矩阵之间的接近度量,我们展示了这两个函数在何种条件下重合。我们还给出了约束集的示例,在这些约束集上最小化这两个目标函数是等价的。我们关注的是预条件子为正定矩阵与低秩矩阵之和的情况,这在前一项工作中已得到发展。这些预条件子被构造为前述散度的最小化器,我们证明它们仅需一个常数缩放即可同时最小化 Kaporin 条件数。我们强调了与信息几何的联系,并对未来方向进行了评论。

英文摘要:

This paper presents some theoretical results relating the Bregman log determinant matrix divergence to Kaporin's condition number. These can be viewed as nearness measures between a preconditioner and a given matrix, and we show under which conditions these two functions coincide. We also give examples of constraint sets over which it is equivalent to minimise these two objectives. We focus on preconditioners that are the sum of a positive definite and low-rank matrix, which were developed in a previous work. These were constructed as minimisers of the aforementioned divergence, and we show that they are only a constant scaling from also minimising Kaporin's condition number. We highlight connections to information geometry and comment on future directions.

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

↑