DOE PAGES title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: A sparse matrix–vector multiplication based algorithm for accurate density matrix computations on systems of millions of atoms

Abstract

Here we present an efficient sparse matrix–vector (SpMV) based method to compute the density matrix P from a given Hamiltonian in electronic structure computations. Our method is a hybrid approach based on Chebyshev–Jackson approximation theory and matrix purification methods like the second order spectral projection purification (SP2). Recent methods to compute the density matrix scale as O(N) in the number of floating point operations but are accompanied by large memory and communication overhead, and they are based on iterative use of the sparse matrix–matrix multiplication kernel (SpGEMM), which is known to be computationally irregular. In addition to irregularity in the sparse Hamiltonian H, the nonzero structure of intermediate estimates of P depends on products of H and evolves over the course of computation. On the other hand, an expansion of the density matrix P in terms of Chebyshev polynomials is straightforward and SpMV based; however, the resulting density matrix may not satisfy the required constraints exactly. In this paper, we analyze the strengths and weaknesses of the Chebyshev–Jackson polynomials and the second order spectral projection purification (SP2) method, and propose to combine them so that the accurate density matrix can be computed using the SpMV computational kernel only, and withoutmore » having to store the density matrix P. Our method accomplishes these objectives by using the Chebyshev polynomial estimate as the initial guess for SP2, which is followed by using sparse matrix–vector multiplications (SpMVs) to replicate the behavior of the SP2 algorithm for purification. We demonstrate the method on a tight-binding model system of an oxide material containing more than 3 million atoms. In addition, we also present the predicted behavior of our method when applied to near-metallic Hamiltonians with a wide energy spectrum.« less

Authors:
ORCiD logo [1];  [1]
  1. University of Illinois at Urbana-Champaign, IL (United States)
Publication Date:
Research Org.:
Univ. of Illinois at Urbana-Champaign, IL (United States)
Sponsoring Org.:
USDOE National Nuclear Security Administration (NNSA)
OSTI Identifier:
1538209
Alternate Identifier(s):
OSTI ID: 1547122
Grant/Contract Number:  
NA0002374
Resource Type:
Accepted Manuscript
Journal Name:
Computer Physics Communications
Additional Journal Information:
Journal Volume: 227; Journal Issue: C; Journal ID: ISSN 0010-4655
Publisher:
Elsevier
Country of Publication:
United States
Language:
English
Subject:
42 ENGINEERING; matrix purification; kernel polynomial; density matrix

Citation Formats

Ghale, Purnima, and Johnson, Harley T. A sparse matrix–vector multiplication based algorithm for accurate density matrix computations on systems of millions of atoms. United States: N. p., 2018. Web. doi:10.1016/j.cpc.2018.02.008.
Ghale, Purnima, & Johnson, Harley T. A sparse matrix–vector multiplication based algorithm for accurate density matrix computations on systems of millions of atoms. United States. https://doi.org/10.1016/j.cpc.2018.02.008
Ghale, Purnima, and Johnson, Harley T. Thu . "A sparse matrix–vector multiplication based algorithm for accurate density matrix computations on systems of millions of atoms". United States. https://doi.org/10.1016/j.cpc.2018.02.008. https://www.osti.gov/servlets/purl/1538209.
@article{osti_1538209,
title = {A sparse matrix–vector multiplication based algorithm for accurate density matrix computations on systems of millions of atoms},
author = {Ghale, Purnima and Johnson, Harley T.},
abstractNote = {Here we present an efficient sparse matrix–vector (SpMV) based method to compute the density matrix P from a given Hamiltonian in electronic structure computations. Our method is a hybrid approach based on Chebyshev–Jackson approximation theory and matrix purification methods like the second order spectral projection purification (SP2). Recent methods to compute the density matrix scale as O(N) in the number of floating point operations but are accompanied by large memory and communication overhead, and they are based on iterative use of the sparse matrix–matrix multiplication kernel (SpGEMM), which is known to be computationally irregular. In addition to irregularity in the sparse Hamiltonian H, the nonzero structure of intermediate estimates of P depends on products of H and evolves over the course of computation. On the other hand, an expansion of the density matrix P in terms of Chebyshev polynomials is straightforward and SpMV based; however, the resulting density matrix may not satisfy the required constraints exactly. In this paper, we analyze the strengths and weaknesses of the Chebyshev–Jackson polynomials and the second order spectral projection purification (SP2) method, and propose to combine them so that the accurate density matrix can be computed using the SpMV computational kernel only, and without having to store the density matrix P. Our method accomplishes these objectives by using the Chebyshev polynomial estimate as the initial guess for SP2, which is followed by using sparse matrix–vector multiplications (SpMVs) to replicate the behavior of the SP2 algorithm for purification. We demonstrate the method on a tight-binding model system of an oxide material containing more than 3 million atoms. In addition, we also present the predicted behavior of our method when applied to near-metallic Hamiltonians with a wide energy spectrum.},
doi = {10.1016/j.cpc.2018.02.008},
journal = {Computer Physics Communications},
number = C,
volume = 227,
place = {United States},
year = {Thu Feb 15 00:00:00 EST 2018},
month = {Thu Feb 15 00:00:00 EST 2018}
}

Journal Article:

Citation Metrics:
Cited by: 3 works
Citation information provided by
Web of Science

Save / Share:

Works referenced in this record:

The kernel polynomial method
journal, March 2006

  • Weiße, Alexander; Wellein, Gerhard; Alvermann, Andreas
  • Reviews of Modern Physics, Vol. 78, Issue 1
  • DOI: 10.1103/RevModPhys.78.275

Electron states in α -quartz: A self-consistent pseudopotential calculation
journal, April 1977


Densities of States of Mega-Dimensional Hamiltonian Matrices
journal, August 1994


Electronic structure calculations for plane-wave codes without diagonalization
journal, April 1999


Praktische Verfahren der Gleichungsauflösung .
journal, January 1929

  • Mises, R. V.; Pollaczek-Geiringer, H.
  • ZAMM - Zeitschrift für Angewandte Mathematik und Mechanik, Vol. 9, Issue 2
  • DOI: 10.1002/zamm.19290090206

Quantifying the breakdown of the Born–Oppenheimer approximation in surface chemistry
journal, January 2011

  • Rahinov, Igor; Cooper, Russell; Matsiev, Daniel
  • Physical Chemistry Chemical Physics, Vol. 13, Issue 28
  • DOI: 10.1039/c1cp20356h

Graph-based linear scaling electronic structure theory
journal, June 2016

  • Niklasson, Anders M. N.; Mniszewski, Susan M.; Negre, Christian F. A.
  • The Journal of Chemical Physics, Vol. 144, Issue 23
  • DOI: 10.1063/1.4952650

Daubechies wavelets as a basis set for density functional pseudopotential calculations
journal, July 2008

  • Genovese, Luigi; Neelov, Alexey; Goedecker, Stefan
  • The Journal of Chemical Physics, Vol. 129, Issue 1
  • DOI: 10.1063/1.2949547

DFTB+, a Sparse Matrix-Based Implementation of the DFTB Method
journal, July 2007

  • Aradi, B.; Hourahine, B.; Frauenheim, Th.
  • The Journal of Physical Chemistry A, Vol. 111, Issue 26
  • DOI: 10.1021/jp070186p

Kernel Polynomial Approximations for Densities of States and Spectral Functions
journal, March 1996

  • Silver, R. N.; Roeder, H.; Voter, A. F.
  • Journal of Computational Physics, Vol. 124, Issue 1
  • DOI: 10.1006/jcph.1996.0048

Self-consistent-field calculations using Chebyshev-filtered subspace iteration
journal, November 2006

  • Zhou, Yunkai; Saad, Yousef; Tiago, Murilo L.
  • Journal of Computational Physics, Vol. 219, Issue 1
  • DOI: 10.1016/j.jcp.2006.03.017

Theoretical investigation of carbon defects and diffusion in α-quartz
journal, August 2001


Simplified LCAO Method for the Periodic Potential Problem
journal, June 1954


Randomized algorithms for estimating the trace of an implicit symmetric positive semi-definite matrix
journal, April 2011


The SIESTA method for ab initio order- N materials simulation
journal, March 2002

  • Soler, José M.; Artacho, Emilio; Gale, Julian D.
  • Journal of Physics: Condensed Matter, Vol. 14, Issue 11
  • DOI: 10.1088/0953-8984/14/11/302

Linear scaling electronic structure methods
journal, July 1999


Transmission, photoconductivity, and the experimental band gap of thermally grown Si O 2 films
journal, March 1979


Density-matrix electronic-structure method with linear system-size scaling
journal, April 1993


Sparse matrix multiplication: The distributed block-compressed sparse row library
journal, May 2014


Dielectric-Barrier Discharges: Their History, Discharge Physics, and Industrial Applications
journal, March 2003

  • Kogelschatz, Ulrich
  • Plasma Chemistry and Plasma Processing, Vol. 23, Issue 1, p. 1-46
  • DOI: 10.1023/A:1022470901385

Linear Scaling Constrained Density Functional Theory in CONQUEST
journal, March 2011

  • Sena, Alex M. P.; Miyazaki, Tsuyoshi; Bowler, David R.
  • Journal of Chemical Theory and Computation, Vol. 7, Issue 4
  • DOI: 10.1021/ct100601n

Self-consistent-charge density-functional tight-binding method for simulations of complex materials properties
journal, September 1998

  • Elstner, M.; Porezag, D.; Jungnickel, G.
  • Physical Review B, Vol. 58, Issue 11, p. 7260-7268
  • DOI: 10.1103/PhysRevB.58.7260

Coarse-graining Kohn–Sham Density Functional Theory
journal, January 2013

  • Suryanarayana, Phanish; Bhattacharya, Kaushik; Ortiz, Michael
  • Journal of the Mechanics and Physics of Solids, Vol. 61, Issue 1
  • DOI: 10.1016/j.jmps.2012.09.002

Spectrum-splitting approach for Fermi-operator expansion in all-electron Kohn-Sham DFT calculations
journal, January 2017


Locality of the Density Matrix in Metals, Semiconductors, and Insulators
journal, March 1999


Parallel Sparse Matrix-Matrix Multiplication and Indexing: Implementation and Experiments
journal, January 2012

  • Buluç, Aydin; Gilbert, John R.
  • SIAM Journal on Scientific Computing, Vol. 34, Issue 4
  • DOI: 10.1137/110848244

Canonical purification of the density matrix in electronic-structure theory
journal, November 1998


Analytic Properties of Bloch Waves and Wannier Functions
journal, August 1959


Trace resetting density matrix purification in O(N) self-consistent-field theory
journal, May 2003

  • Niklasson, Anders M. N.; Tymczak, C. J.; Challacombe, Matt
  • The Journal of Chemical Physics, Vol. 118, Issue 19
  • DOI: 10.1063/1.1559913

Linear-scaling subspace-iteration algorithm with optimally localized nonorthogonal wave functions for Kohn-Sham density functional theory
journal, March 2009


Electronic energy-band structure of α quartz
journal, September 1978


Some Recent Advances in Density Matrix Theory
journal, April 1960


An Optimized Sparse Approximate Matrix Multiply for Matrices with Decay
journal, January 2013

  • Bock, Nicolas; Challacombe, Matt
  • SIAM Journal on Scientific Computing, Vol. 35, Issue 1
  • DOI: 10.1137/120870761

Chebyshev expansion methods for electronic structure calculations on large molecular systems
journal, December 1997

  • Baer, Roi; Head-Gordon, Martin
  • The Journal of Chemical Physics, Vol. 107, Issue 23
  • DOI: 10.1063/1.474158