预处理程序
Krylov子空间
雅可比矩阵与行列式
数学
牛顿法
广义最小残差法
最优化中的牛顿法
应用数学
拟牛顿法
基质(化学分析)
算法
非线性系统
数学优化
迭代法
局部收敛
物理
复合材料
量子力学
材料科学
作者
Stefania Bellavia,Daniele Bertaccini,Benedetta Morini
摘要
Newton–Krylov methods, a combination of Newton-like methods and Krylov subspace methods for solving the Newton equations, often need adequate preconditioning in order to be successful. Approximations of the Jacobian matrices are required to form preconditioners, and this step is very often the dominant cost of Newton–Krylov methods. Therefore, working with preconditioners may destroy the “Jacobian-free” (or matrix-free) setting where the single Jacobian-vector product can be provided without forming and storing the element of the true Jacobian. In this paper, we propose and analyze a preconditioning technique for sequences of nonsymmetric Jacobian matrices based on the update of an earlier preconditioner. The proposed strategy can be implemented in a matrix-free manner. Numerical experiments on popular test problems confirm the effectiveness of the approach in comparison with the standard ILU-preconditioned Newton–Krylov approaches.
科研通智能强力驱动
Strongly Powered by AbleSci AI