Journal article · 2009 · Open access
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 · Published 1 January 2009 · DOI 10.4310/cms.2009.v7.n3.a12
In brief
“Fast algorithm for extracting the diagonal of the inverse matrix with application to the electronic structure analysis of metallic systems” is a 2009 journal article by Roberto Car and 4 co-authors, published in Communications in Mathematical Sciences. OpenAlex counts 101 citations as of 16 November 2026, which puts it in the top 9% of works published in 2009 by citations. It is open access: the full text is free to read at Communications in Mathematical Sciences.
- Citations
- 101
- Most cited in
- 2017 (11)
- Field-weighted impact
- 6.70
- References
- 24
- Authors
- 5
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(N 3/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.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Car, R., Weinan, E., Lin, L., Lu, J., & Ying, L. (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
MLA 9
Car, Roberto, et al. “Fast algorithm for extracting the diagonal of the inverse matrix with application to the electronic structure analysis of metallic systems.” Communications in Mathematical Sciences, vol. 7, no. 3, 2009, pp. 755–777. https://doi.org/10.4310/cms.2009.v7.n3.a12.
Chicago
Car, Roberto, E Weinan, Lin Lin, Jianfeng Lu, and Lexing Ying. 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.
Harvard
Car, R. et al. (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), pp. 755–777. doi:10.4310/cms.2009.v7.n3.a12.
IEEE
R. Car, E. Weinan, L. Lin, J. Lu, and L. Ying, “Fast algorithm for extracting the diagonal of the inverse matrix with application to the electronic structure analysis of metallic systems,” Communications in Mathematical Sciences, vol. 7, no. 3, pp. 755–777, 2009, doi: 10.4310/cms.2009.v7.n3.a12.
BibTeX
@article{car2009fast,
title = {{Fast algorithm for extracting the diagonal of the inverse matrix with application to the electronic structure analysis of metallic systems}},
author = {Car, Roberto and Weinan, E and Lin, Lin and Lu, Jianfeng and Ying, Lexing},
journal = {Communications in Mathematical Sciences},
year = {2009},
volume = {7},
number = {3},
pages = {755--777},
doi = {10.4310/cms.2009.v7.n3.a12},
url = {https://doi.org/10.4310/cms.2009.v7.n3.a12}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2017 | 11 | |
| 2018 | 6 | |
| 2019 | 10 | |
| 2020 | 6 | |
| 2021 | 3 | |
| 2022 | 4 | |
| 2023 | 2 | |
| 2024 | 7 | |
| 2025 | 5 | |
| 2026 | 1 |
Its field-weighted citation impact is 6.70: it has been cited 6.70 times as often as the average work of the same field, type and year (1.00 is the world average).
Topic and keywords
Physical Sciences › Computer Science › Computational Theory and Mathematics › Matrix Theory and Algorithms
- hierarchical decomposition
- Schur complement
- electronic structure calculations
- metallic systems
- Kohn-Sham equations
- domain decomposition
- computational complexity reduction
Work with this paper
Most-cited papers in Computer Science
- ImageNet classification with deep convolutional neural networksAlex Krizhevsky, Ilya Sutskever, Geoffrey E. Hinton · Communications of the ACM · 2017 · 114,726 citations
- Long Short-Term MemorySepp Hochreiter, Jürgen Schmidhuber · Neural Computation · 1997 · 109,097 citations
- A Mathematical Theory of CommunicationClaude E. Shannon · Bell System Technical Journal · 1948 · 91,736 citations
- Deep learningYann LeCun, Yoshua Bengio, Geoffrey E. Hinton · Nature · 2015 · 90,226 citations
- Faster R-CNN: Towards Real-Time Object Detection with Region Proposal NetworksShaoqing Ren, Kaiming He, Ross Girshick and 1 more · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2016 · 74,143 citations
Questions about this paper
How do I cite this paper in APA style?
Car, R., Weinan, E., Lin, L., Lu, J., & Ying, L. (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
How many times has this paper been cited?
101 times, according to OpenAlex on 16 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
Yes. It is open access: read the free full text at Communications in Mathematical Sciences.
Who wrote this paper?
Roberto Car, E Weinan, Lin Lin, Jianfeng Lu, Lexing Ying.
What is the DOI of this paper?
10.4310/cms.2009.v7.n3.a12. The permanent link is https://doi.org/10.4310/cms.2009.v7.n3.a12.
Bibliographic data from OpenAlex (CC0), last checked 16 November 2026. ResearchGuru does not host this paper; the links go to the publisher or the repository that does.