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

一种无矩阵牛顿法

A Matrix-Free Newton Method

Uwe Naumann

AI总结:

本研究提出一种基于可逆稀疏局部雅可比矩阵分解的无矩阵牛顿法,可降低非线性方程组求解的计算成本,同时证明其推广问题为NP完全并给出近似求解算法组件。

摘要:

本文提出了一种用于求解含$n$个方程的非线性方程组的牛顿法改进方案。这种新的无矩阵方法依据微分链式法则,将残差的可逆雅可比矩阵分解为多个可逆的稀疏局部雅可比矩阵,并以此为基础构建。该方法的提出受带宽为$2m+1$(其中$m\ll n$)的局部雅可比矩阵场景启发,可实现$\mathcal{O}(\frac{n}{m})$量级的计算成本降低。针对三对角情形的运行时间实测结果验证了该方法的效果,显示计算成本降低了$\mathcal{O}(n)$量级。\n对该方法进行推广可得到组合优化层面的无矩阵牛顿步(Matrix-Free Newton Step)问题。我们证明了该问题是NP完全的,并提出了用于构建近似求解方法的算法组件。受伴随算法微分(adjoint Algorithmic Differentiation)启发,该新方法与伴随算法微分面临若干共同挑战,包括有向无环图反转(DAG Reversal)问题。此外,稀疏线性代数中的组合问题(如带宽问题或有向消元排序问题)也带来了更多挑战。

英文摘要:

A modification of Newton's method for solving systems of $n$ nonlinear equations is presented. The new matrix-free method relies on a given decomposition of the invertible Jacobian of the residual into invertible sparse local Jacobians according to the chain rule of differentiation. It is motivated in the context of local Jacobians with bandwidth $2m+1$ for $m\ll n$. A reduction of the computational cost by $\mathcal{O}(\frac{n}{m})$ can be observed. Supporting run time measurements are presented for the tridiagonal case showing a reduction of the computational cost by $\mathcal{O}(n).$ Generalization yields the combinatorial Matrix-Free Newton Step problem. We prove NP-completeness and we present algorithmic components for building methods for the approximate solution. Inspired by adjoint Algorithmic Differentiation, the new method shares several challenges for the latter including the DAG Reversal problem. Further challenges are due to combinatorial problems in sparse linear algebra such as Bandwidth or Directed Elimination Ordering.

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

↑