✦ LIBER ✦

Convergence behavior of some multiconfiguration methods

✍ Scribed by A. Banerjee; F. Grein

Publisher: John Wiley and Sons
Year: 1976
Tongue: English
Weight: 434 KB
Volume: 10
Category: Article
ISSN: 0020-7608
DOI: 10.1002/qua.560100110

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

The optimization scheme of the “multiconfiguration method based on the generalized Brillouin theorem” (MCGBT) has been analysed and found to converge quadratically. Its rate of convergence has been compared with that of other optimization methods such as the first‐order Rayleigh‐Schrödinger perturbation, the steepest descent, the single vector diagonalization, the Newton‐Raphson, and the conventional SCF method. The convergence of the MCGBT scheme has been found to be superior to the convergence of the above mentioned schemes.

📜 SIMILAR VOLUMES

Improved convergence modification of the

Improved convergence modification of the orthogonal gradient multiconfiguration SCF method

✍ E. Yurtsever; D. Shillady 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 384 KB

The orthogwxd pmdicnt rnulti~onf~ur~ti~~~l method of Golebiewski, Hinze and Yurtsevcr has been modified to produce more rq?idly J symmrtric form c~frhc fcncralized t~ock (I-') matrix Test calculations using hlIND0/3 and GAUS70 integrals show/-" = I.25 F -0.25 IT+ to be more rapidly convergent thzm F

Convergence behavior of some orbital opt

Convergence behavior of some orbital optimization procedures

✍ Sankar Prasad Bhattacharyya; Debashis Mukherjee; Debendra Madhab Bhattacharyya; 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 365 KB

## Abstract Sources of occasional convergence problems in our recently proposed algorithm for orthonormality constrained orbital optimization in SCF calculation, as well as in the partly equivalent orthogonal gradient method, are traced and remedial measures are suggested. A simple scaling techniqu

Some methods of speeding up the converge

Some methods of speeding up the convergence of iteration methods

✍ B.T. Polyak 📂 Article 📅 1964 🏛 Elsevier Science ⚖ 951 KB

The rate of convergence of some gradient

The rate of convergence of some gradient methods

✍ V.M. Safro 📂 Article 📅 1976 🏛 Elsevier Science ⚖ 268 KB

On the convergence of some generalized i

On the convergence of some generalized iterative methods

✍ A. Hadjidimos; A. Psimarni; A. Yeyios 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 810 KB

Convergence behaviors of multisplitting

Convergence behaviors of multisplitting methods with relaxed parameters

✍ Guang-Hui Cheng; Ting-Zhu Huang; Yan-Fei Jing; Li-Tao Zhang 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 692 KB

In this paper, two multisplitting methods with K + 1 relaxed parameters are established for solving a linear system whose coefficient matrix is a large sparse M-matrix or H-matrix and the corresponding convergence behaviors are studied. Then the implementation of these two methods with ILU factoriza