Fast algorithm for extracting the diagonal of the inverse matrix with application to the electronic structure analysis of metallic systems

91Citations
Citations of this article
73Readers
Mendeley users who have this article in their library.

Abstract

We propose an algorithm for extracting the diagonal of the inverse matrices arising from electronic structure calculation. The proposed algorithm uses a hierarchical decomposition of the computational domain. It first constructs hierarchical Schur complements of the interior points for the blocks of the domain in a bottom-up pass and then extracts the diagonal entries efficiently in a top-down pass by exploiting the hierarchical local dependence of the inverse matrices. The overall cost of our algorithm is O(N3/2) for a two dimensional problem with N degrees of freedom. Numerical results in electronic structure calculation illustrate the efficiency and accuracy of the proposed algorithm. © 2009 International Press.

Cite

CITATION STYLE

APA

Lin, L., Lu, J., Ying, L., Car, R., & E, W. (2009). Fast algorithm for extracting the diagonal of the inverse matrix with application to the electronic structure analysis of metallic systems. Communications in Mathematical Sciences, 7(3), 755–777. https://doi.org/10.4310/cms.2009.v7.n3.a12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free