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

全Broyden类拟牛顿更新的紧凑表示

Compact representation of the full Broyden class of quasi-Newton updates

University of California, Merced(加州大学默塞德分校);Wake Forest University(维克森林大学)

Omar DeGuchy, Jennifer B. Erway, Roummel F. Marcia

AI总结:

本文提出全Broyden类拟牛顿更新矩阵的紧凑表示,允许每步更新为秩一或秩二。通过数值实验验证了该表示的有效性,并展示了如何计算其逆矩阵及线性系统求解算法。

摘要:

本文提出了属于Broyden类的拟牛顿更新矩阵的紧凑表示,其中每个更新可以是秩一或秩二。该工作扩展了仅针对秩二Broyden类的先前结果。本文不假设每次迭代使用相同的Broyden更新,而是每次迭代可以使用不同的Broyden类成员。数值实验表明,紧凑表示的实用实现能够准确表示Broyden类更新矩阵。此外,我们展示了如何计算这些矩阵的逆以及使用Broyden类成员求解线性系统的方法。通过数值实验,我们证明所提出的线性求解器能够高效且准确地求解Broyden类矩阵的线性系统。作为这项工作的直接结果,现在可以高效计算任何有限内存Broyden类成员的特征值,从而计算条件数并进行灵敏度分析。

英文摘要:

In this paper, we present the compact representation for matrices belonging to the the Broyden class of quasi-Newton updates, where each update may be either rank-one or rank-two. This work extends previous results solely for the restricted Broyden class of rank-two updates. In this article, it is not assumed the same Broyden update is used each iteration; rather, different members of the Broyden class may be used each iteration. Numerical experiments suggest that a practical implementation of the compact representation is able to accurately represent matrices belonging to the Broyden class of updates. Furthermore, we demonstrate how to compute the compact representation for the inverse of these matrices, as well as a practical algorithm for solving linear systems with members of the Broyden class of updates. We demonstrate through numerical experiments that the proposed linear solver is able to efficiently solve linear systems with members of the Broyden class of matrices to high accuracy. As an immediate consequence of this work, it is now possible to efficiently compute the eigenvalues of any limited-memory member of the Broyden class of matrices, allowing for the computation of condition numbers and the ability perform sensitivity analysis.

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

↑