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]

doi:10.1016/j.jcp.2015.02.030

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]

Full Record
Other Related Research

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:

Vecharynski, Eugene ^[1]; Yang, Chao ^[1]; Pask, John E. ^[2]

Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States)
Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)

Publication Date:: 2015-02-25

Research Org.:: Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)

Sponsoring Org.:: USDOE Office of Science (SC), Basic Energy Sciences (BES) (SC-22)

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:: 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.

Copy to clipboard


                    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.  doi:10.1016/j.jcp.2015.02.030.

Copy to clipboard


                    Vecharynski, Eugene, Yang, Chao, and Pask, John E. Wed .  
        "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.  doi:10.1016/j.jcp.2015.02.030.  https://www.osti.gov/servlets/purl/1325863.

Copy to clipboard


                    
@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},

  journal      = {Journal of Computational Physics},

  number       = C,

  volume       = 290,

  place        = {United States},

  year         = {2015},

  month        = {2}

}

Copy to clipboard

Journal Article:

Free Publicly Available Full Text

Accepted Manuscript (Publisher)

Accepted Manuscript (DOE)

Publisher's Version of Record

DOI: 10.1016/j.jcp.2015.02.030

Other availability

Search WorldCat to find libraries that may hold this journal

Citation Metrics:

Cited by: 7 works

Citation information provided by
Web of Science

Save / Share:

Export Metadata

Save to My Library

Similar records in OSTI.GOV collections:

A projected preconditioned conjugate gradient algorithm for computing many extreme eigenpairs of a Hermitian matrix

Journal Article Vecharynski, Eugene, E-mail: eugene.vecharynski@gmail.com ; Yang, Chao ; Pask, John E. - Journal of Computational Physics

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 blockmore »« less
DOI: 10.1016/J.JCP.2015.02.030
A Robust and Efficient Implementation of LOBPCG

Journal Article Duersch, Jed A. ; Shao, Meiyue ; Yang, Chao ; ... - SIAM Journal on Scientific Computing

Locally Optimal Block Preconditioned Conjugate Gradient (LOBPCG) is widely used to compute eigenvalues of large sparse symmetric matrices. The algorithm can suffer from numerical instability if it is not implemented with care. This is especially problematic when the number of eigenpairs to be computed is relatively large. In this paper we propose an improved basis selection strategy based on earlier work by Hetmaniuk and Lehoucq as well as a robust convergence criterion which is backward stable to enhance the robustness. Here, we also suggest several algorithmic optimizations that improve performance of practical LOBPCG implementations. Numerical examples confirm that our approachmore »« less
DOI: 10.1137/17M1129830

Full Text Available
Polynomial preconditioning for conjugate gradient methods

Technical Report Ashby, S.F.

The solution of a linear system of equations, Ax = b, arises in many scientific applications. If A is large and sparse, an iterative method is required. When A is hermitian positive definite (hpd), the conjugate gradient method of Hestenes and Stiefel is popular. When A is hermitian indefinite (hid), the conjugate residual method may be used. If A is ill-conditioned, these methods may converge slowly, in which case a preconditioner is needed. In this thesis we examine the use of polynomial preconditioning in CG methods for both hermitian positive definite and indefinite matrices. Such preconditioners are easy to employmore »« less
Efficient modified Jacobi relaxation for minimizing the energy functional

Journal Article Park, C.H. ; Lee, I. ; Chang, K.J. - Physical Review, B: Condensed Matter; (United States)

We present an efficient scheme of diagonalizing large Hamiltonian matrices in a self-consistent manner. In the framework of the preconditioned conjugate gradient minimization of the energy functional, we replace the modified Jacobi relaxation for preconditioning and use for band-by-band minimization the restricted-block Davidson algorithm, in which only the previous wave functions and the relaxation vectors are included additionally for subspace diagonalization. Our scheme is found to be comparable with the preconditioned conjugate gradient method for both large ordered and disordered Si systems, while it is more rapidly converged for systems with transition-metal elements.
DOI: 10.1103/PhysRevB.47.15996
A subspace preconditioning algorithm for eigenvector/eigenvalue computation

Conference Bramble, J.H. ; Knyazev, A.V. ; Pasciak, J.E.

We consider the problem of computing a modest number of the smallest eigenvalues along with orthogonal bases for the corresponding eigen-spaces of a symmetric positive definite matrix. In our applications, the dimension of a matrix is large and the cost of its inverting is prohibitive. In this paper, we shall develop an effective parallelizable technique for computing these eigenvalues and eigenvectors utilizing subspace iteration and preconditioning. Estimates will be provided which show that the preconditioned method converges linearly and uniformly in the matrix dimension when used with a uniform preconditioner under the assumption that the approximating subspace is close enoughmore » to the span of desired eigenvectors.« less
DOI: 10.1007/BF02127702

Full Text Available

Similar Records