Numerical Methods for Solving the Hartree-Fock Equations of Diatomic Molecules II. (16th March 2016)

• Record Type: Journal Article
• Authors: Morrison, John C.; Steffen, Kyle; Pantoja, Blake; Nagaiya, Asha; Kobus, Jacek; Ericsson, Thomas
• Is Part Of: Communications in computational physics. Volume 19:Number 3(2016:Mar.)
• Page Start: 632
• Page End: 647
• Publication Date: 2016-03-16
• Subjects: 65N35, -- 65N22, -- 65F10; Pair equation, -- Hartree-Fock equation, -- domain decomposition, -- Hermite splines, -- highorder finite differences, -- successive over-relaxation; Mathematical physics -- Data processing -- Periodicals; Physics -- Data processing -- Periodicals; 530.150285
• DOI: 10.4208/cicp.101114.170615a
• Languages: English
• ISSNs: 1815-2406

Abstract

Abstract: In order to solve the partial differential equations that arise in the Hartree- Fock theory for diatomicmolecules and inmolecular theories that include electron correlation, one needs efficient methods for solving partial differential equations. In this article, we present numerical results for a two-variablemodel problem of the kind that arises when one solves the Hartree-Fock equations for a diatomic molecule. We compare results obtained using the spline collocation and domain decomposition methods with third-order Hermite splines to results obtained using the more-established finite difference approximation and the successive over-relaxation method. The theory of domain decomposition presented earlier is extended to treat regions that are divided into an arbitrary number of subregions by families of lines parallel to the two coordinate axes. While the domain decomposition method and the finite difference approach both yield results at the micro-Hartree level, the finite difference approach with a 9- point difference formula produces the same level of accuracy with fewer points. The domain decompositionmethod has the strength that it can be applied to problemswith a large number of grid points. The time required to solve a partial differential equation for a fine grid with a large number of points goes down as the number of partitions increases. The reason for this is that the length of time necessary for solving a set of linear equations in each subregion is very much dependent upon the number of equations. Even though a finer partition of the region has more subregions, the time for solving the set of linear equations in each subregion is very much smaller. This feature of the theory may well prove to be a decisive factor for solving the two-electron pair equation, which – for a diatomic molecule – involves solving partial differential equations with five independent variables. The domain decomposition theory also makes it possible to study complex molecules by dividing them into smaller fragments that are calculated independently. Since the domain decomposition approachmakes it possible to decompose the variable space into separate regions in which the equations are solved independently, this approach is well-suited to parallel computing.