首页> 外文期刊>The Journal of Chemical Physics >Efficient recursive implementation of the modified Broyden method and the direct inversion in the iterative subspace method: Acceleration of self-consistent calculations
【24h】

Efficient recursive implementation of the modified Broyden method and the direct inversion in the iterative subspace method: Acceleration of self-consistent calculations

机译:改进的Broyden方法的有效递归实现以及迭代子空间方法中的直接反演:自洽计算的加速

获取原文
获取原文并翻译 | 示例
           

摘要

An efficient recursive procedure to solve N-dimensional nonlinear equations using the modified Broyden method is described, This procedure is extended to include the direct inversion in the iterative subspace (DIIS) method to further improve the rate of convergence in iterative calculations. In the recursive procedures. the approximate solutions are constructed as linear combinations of n vectors of length N. The calculations are reduced to determine the appropriate coefficients of the linear combinations. The coefficients are evaluated through small matrix operations, the size of which are at most (n + 1) x (n + 1) except for the generation of a n x n matrix, where n is the iteration number. Storage is required only for the n vectors and the small matrices. The procedures described below can be applied to large systems. To examine the efficiency of the methods, some numerical results are presented in the context of self-consistent calculations of liquid structure using the reference interaction site model (RISM) integral equation and a molecule-site form of the Ornstein-Zernike integral equation. The results indicate that significant acceleration with respect to the Picard iteration method has been achieved by the recursive procedures: The converged solution is obtained in a very small number of iterations and in a fraction of the CPU time. Moreover, the extended method which includes the DIIS approach has further improved the rate of convergence. It also enables solutions to be obtained in an otherwise divergent case. (C) 1998 American Institute of Physics. [References: 29]
机译:描述了一种使用改进的Broyden方法求解N维非线性方程的有效递归过程。该过程被扩展为包括迭代子空间(DIIS)方法中的直接反演,以进一步提高迭代计算的收敛速度。在递归程序中。近似解被构造为长度为N的n个向量的线性组合。减少了计算以确定线性组合的适当系数。系数是通过小的矩阵运算来评估的,除了生成n x n矩阵(其中n是迭代数)外,矩阵运算的大小最多为(n + 1)x(n + 1)。仅对于n个向量和小矩阵需要存储。下述过程可应用于大型系统。为了检验该方法的有效性,在液体结构自洽计算的背景下,使用参考相互作用位点模型(RISM)积分方程和Ornstein-Zernike积分方程的分子位形式,给出了一些数值结果。结果表明,相对于Picard迭代方法,已经通过递归过程实现了显着的加速:收敛的解决方案以很少的迭代次数和很少的CPU时间获得。而且,包括DIIS方法在内的扩展方法进一步提高了收敛速度。它还可以在其他情况下获得解决方案。 (C)1998美国物理研究所。 [参考:29]

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号