skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: A projected preconditioned conjugate gradient algorithm for computing many extreme eigenpairs of a Hermitian matrix [A projected preconditioned conjugate gradient algorithm for computing a large eigenspace of a Hermitian matrix]

Abstract

Here, we present an iterative algorithm for computing an invariant subspace associated with the algebraically smallest eigenvalues of a large sparse or structured Hermitian matrix A. We are interested in the case in which the dimension of the invariant subspace is large (e.g., over several hundreds or thousands) even though it may still be small relative to the dimension of A. These problems arise from, for example, density functional theory (DFT) based electronic structure calculations for complex materials. The key feature of our algorithm is that it performs fewer Rayleigh–Ritz calculations compared to existing algorithms such as the locally optimal block preconditioned conjugate gradient or the Davidson algorithm. It is a block algorithm, and hence can take advantage of efficient BLAS3 operations and be implemented with multiple levels of concurrency. We discuss a number of practical issues that must be addressed in order to implement the algorithm efficiently on a high performance computer.

Authors:
 [1];  [1];  [2]
  1. Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States)
  2. Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
Publication Date:
Research Org.:
Lawrence Livermore National Laboratory (LLNL), Livermore, CA (United States)
Sponsoring Org.:
USDOE Office of Science (SC), Basic Energy Sciences (BES)
OSTI Identifier:
1325863
Alternate Identifier(s):
OSTI ID: 1556219
Report Number(s):
LLNL-JRNL-695289
Journal ID: ISSN 0021-9991
Grant/Contract Number:  
AC52-07NA27344; AC02-05CH11231
Resource Type:
Journal Article: Accepted Manuscript
Journal Name:
Journal of Computational Physics
Additional Journal Information:
Journal Volume: 290; Journal Issue: C; Journal ID: ISSN 0021-9991
Publisher:
Elsevier
Country of Publication:
United States
Language:
English
Subject:
75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND SUPERFLUIDITY; 97 MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE; preconditioned eigenvalue solvers; density functional theory based electronic structure calculations

Citation Formats

Vecharynski, Eugene, Yang, Chao, and Pask, John E. A projected preconditioned conjugate gradient algorithm for computing many extreme eigenpairs of a Hermitian matrix [A projected preconditioned conjugate gradient algorithm for computing a large eigenspace of a Hermitian matrix]. United States: N. p., 2015. Web. doi:10.1016/j.jcp.2015.02.030.
Vecharynski, Eugene, Yang, Chao, & Pask, John E. A projected preconditioned conjugate gradient algorithm for computing many extreme eigenpairs of a Hermitian matrix [A projected preconditioned conjugate gradient algorithm for computing a large eigenspace of a Hermitian matrix]. United States. https://doi.org/10.1016/j.jcp.2015.02.030
Vecharynski, Eugene, Yang, Chao, and Pask, John E. 2015. "A projected preconditioned conjugate gradient algorithm for computing many extreme eigenpairs of a Hermitian matrix [A projected preconditioned conjugate gradient algorithm for computing a large eigenspace of a Hermitian matrix]". United States. https://doi.org/10.1016/j.jcp.2015.02.030. https://www.osti.gov/servlets/purl/1325863.
@article{osti_1325863,
title = {A projected preconditioned conjugate gradient algorithm for computing many extreme eigenpairs of a Hermitian matrix [A projected preconditioned conjugate gradient algorithm for computing a large eigenspace of a Hermitian matrix]},
author = {Vecharynski, Eugene and Yang, Chao and Pask, John E.},
abstractNote = {Here, we present an iterative algorithm for computing an invariant subspace associated with the algebraically smallest eigenvalues of a large sparse or structured Hermitian matrix A. We are interested in the case in which the dimension of the invariant subspace is large (e.g., over several hundreds or thousands) even though it may still be small relative to the dimension of A. These problems arise from, for example, density functional theory (DFT) based electronic structure calculations for complex materials. The key feature of our algorithm is that it performs fewer Rayleigh–Ritz calculations compared to existing algorithms such as the locally optimal block preconditioned conjugate gradient or the Davidson algorithm. It is a block algorithm, and hence can take advantage of efficient BLAS3 operations and be implemented with multiple levels of concurrency. We discuss a number of practical issues that must be addressed in order to implement the algorithm efficiently on a high performance computer.},
doi = {10.1016/j.jcp.2015.02.030},
url = {https://www.osti.gov/biblio/1325863}, journal = {Journal of Computational Physics},
issn = {0021-9991},
number = C,
volume = 290,
place = {United States},
year = {Wed Feb 25 00:00:00 EST 2015},
month = {Wed Feb 25 00:00:00 EST 2015}
}

Journal Article:

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

Save / Share:

Works referenced in this record:

Large-scale ab initio calculations based on three levels of parallelization
journal, April 2008


Elemental: A New Framework for Distributed Memory Dense Matrix Computations
journal, February 2013


Architecture of Qbox: A scalable first-principles molecular dynamics code
journal, January 2008


Some metric inequalities in the space of matrices
journal, January 1955


QUANTUM ESPRESSO: a modular and open-source software project for quantum simulations of materials
journal, September 2009


A Trace Minimization Algorithm for the Generalized Eigenvalue Problem
journal, December 1982


Inhomogeneous Electron Gas
journal, November 1964


The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints
journal, December 1961


A spectrum slicing method for the Kohn–Sham problem
journal, March 2012


The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
journal, March 1960


ABINIT: First-principles approach to material and nanosystem properties
journal, December 2009


Block Locally Optimal Preconditioned Eigenvalue Xolvers (BLOPEX) in Hypre and PETSc
journal, January 2007


Tight-binding models and density-functional theory
journal, June 1989


Convex programming in Hilbert space
journal, January 1964


The ELPA library: scalable parallel eigenvalue solutions for electronic structure theory and computational science
journal, May 2014


Toward the Optimal Preconditioned Eigensolver: Locally Optimal Block Preconditioned Conjugate Gradient Method
journal, January 2001


A Trace Minimization Algorithm for the Generalized Eigenvalue Problem
journal, December 1982


A Simultaneous Iteration Algorithm for Real Matrices
journal, June 1981


The trace minimization method for the symmetric generalized eigenvalue problem
journal, November 2000


Self-Consistent Equations Including Exchange and Correlation Effects
journal, November 1965


A brief introduction to the ABINIT software package
journal, January 2005


Works referencing / citing this record:

Prediction of atomization energy using graph kernel and active learning
journal, January 2019


Convergence theory for preconditioned eigenvalue solvers in a nutshell
text, January 2014