Efficient Recursion Method for Inverting Overlap Matrix

Details Efficient Recursion Method for Inverting Overlap Matrix Efficient Recursion Method for Inverting Overlap Matrix

2001-06-04

arxiv.org/abs/cond-mat/0106048v1

Physics

Condensed Matter

17 pages and 4 figures

Scientific paper

10.1103/PhysRevB.64.195110

A new O(N) algorithm based on a recursion method, in which the computational effort is proportional to the number of atoms N, is presented for calculating the inverse of an overlap matrix which is needed in electronic structure calculations with the the non-orthogonal localized basis set. This efficient inverting method can be incorporated in several O(N) methods for diagonalization of a generalized secular equation. By studying convergence properties of the 1-norm of an error matrix for diamond and fcc Al, this method is compared to three other O(N) methods (the divide method, Taylor expansion method, and Hotelling's method) with regard to computational accuracy and efficiency within the density functional theory. The test calculations show that the new method is about one-hundred times faster than the divide method in computational time to achieve the same convergence for both diamond and fcc Al, while the Taylor expansion method and Hotelling's method suffer from numerical instabilities in most cases.

Affiliated with

Also associated with

No associations

Rating

Efficient Recursion Method for Inverting Overlap Matrix does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Efficient Recursion Method for Inverting Overlap Matrix, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient Recursion Method for Inverting Overlap Matrix will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-114786