12,827 research outputs found
An a posteriori verification method for generalized real-symmetric eigenvalue problems in large-scale electronic state calculations
An a posteriori verification method is proposed for the generalized
real-symmetric eigenvalue problem and is applied to densely clustered
eigenvalue problems in large-scale electronic state calculations. The proposed
method is realized by a two-stage process in which the approximate solution is
computed by existing numerical libraries and is then verified in a moderate
computational time. The procedure returns intervals containing one exact
eigenvalue in each interval. Test calculations were carried out for organic
device materials, and the verification method confirms that all exact
eigenvalues are well separated in the obtained intervals. This verification
method will be integrated into EigenKernel (https://github.com/eigenkernel/),
which is middleware for various parallel solvers for the generalized eigenvalue
problem. Such an a posteriori verification method will be important in future
computational science.Comment: 15 pages, 7 figure
A Shift Selection Strategy for Parallel Shift-invert Spectrum Slicing in Symmetric Self-consistent Eigenvalue Computation
© 2020 ACM. The central importance of large-scale eigenvalue problems in scientific computation necessitates the development of massively parallel algorithms for their solution. Recent advances in dense numerical linear algebra have enabled the routine treatment of eigenvalue problems with dimensions on the order of hundreds of thousands on the world's largest supercomputers. In cases where dense treatments are not feasible, Krylov subspace methods offer an attractive alternative due to the fact that they do not require storage of the problem matrices. However, demonstration of scalability of either of these classes of eigenvalue algorithms on computing architectures capable of expressing massive parallelism is non-trivial due to communication requirements and serial bottlenecks, respectively. In this work, we introduce the SISLICE method: a parallel shift-invert algorithm for the solution of the symmetric self-consistent field (SCF) eigenvalue problem. The SISLICE method drastically reduces the communication requirement of current parallel shift-invert eigenvalue algorithms through various shift selection and migration techniques based on density of states estimation and k-means clustering, respectively. This work demonstrates the robustness and parallel performance of the SISLICE method on a representative set of SCF eigenvalue problems and outlines research directions that will be explored in future work
Three real-space discretization techniques in electronic structure calculations
A characteristic feature of the state-of-the-art of real-space methods in
electronic structure calculations is the diversity of the techniques used in
the discretization of the relevant partial differential equations. In this
context, the main approaches include finite-difference methods, various types
of finite-elements and wavelets. This paper reports on the results of several
code development projects that approach problems related to the electronic
structure using these three different discretization methods. We review the
ideas behind these methods, give examples of their applications, and discuss
their similarities and differences.Comment: 39 pages, 10 figures, accepted to a special issue of "physica status
solidi (b) - basic solid state physics" devoted to the CECAM workshop "State
of the art developments and perspectives of real-space electronic structure
techniques in condensed matter and molecular physics". v2: Minor stylistic
and typographical changes, partly inspired by referee comment
Hybrid preconditioning for iterative diagonalization of ill-conditioned generalized eigenvalue problems in electronic structure calculations
The iterative diagonalization of a sequence of large ill-conditioned
generalized eigenvalue problems is a computational bottleneck in quantum
mechanical methods employing a nonorthogonal basis for {\em ab initio}
electronic structure calculations. We propose a hybrid preconditioning scheme
to effectively combine global and locally accelerated preconditioners for rapid
iterative diagonalization of such eigenvalue problems. In partition-of-unity
finite-element (PUFE) pseudopotential density-functional calculations,
employing a nonorthogonal basis, we show that the hybrid preconditioned block
steepest descent method is a cost-effective eigensolver, outperforming current
state-of-the-art global preconditioning schemes, and comparably efficient for
the ill-conditioned generalized eigenvalue problems produced by PUFE as the
locally optimal block preconditioned conjugate-gradient method for the
well-conditioned standard eigenvalue problems produced by planewave methods
Parallel eigensolvers in plane-wave Density Functional Theory
We consider the problem of parallelizing electronic structure computations in
plane-wave Density Functional Theory. Because of the limited scalability of
Fourier transforms, parallelism has to be found at the eigensolver level. We
show how a recently proposed algorithm based on Chebyshev polynomials can scale
into the tens of thousands of processors, outperforming block conjugate
gradient algorithms for large computations
Two-level Chebyshev filter based complementary subspace method: pushing the envelope of large-scale electronic structure calculations
We describe a novel iterative strategy for Kohn-Sham density functional
theory calculations aimed at large systems (> 1000 electrons), applicable to
metals and insulators alike. In lieu of explicit diagonalization of the
Kohn-Sham Hamiltonian on every self-consistent field (SCF) iteration, we employ
a two-level Chebyshev polynomial filter based complementary subspace strategy
to: 1) compute a set of vectors that span the occupied subspace of the
Hamiltonian; 2) reduce subspace diagonalization to just partially occupied
states; and 3) obtain those states in an efficient, scalable manner via an
inner Chebyshev-filter iteration. By reducing the necessary computation to just
partially occupied states, and obtaining these through an inner Chebyshev
iteration, our approach reduces the cost of large metallic calculations
significantly, while eliminating subspace diagonalization for insulating
systems altogether. We describe the implementation of the method within the
framework of the Discontinuous Galerkin (DG) electronic structure method and
show that this results in a computational scheme that can effectively tackle
bulk and nano systems containing tens of thousands of electrons, with chemical
accuracy, within a few minutes or less of wall clock time per SCF iteration on
large-scale computing platforms. We anticipate that our method will be
instrumental in pushing the envelope of large-scale ab initio molecular
dynamics. As a demonstration of this, we simulate a bulk silicon system
containing 8,000 atoms at finite temperature, and obtain an average SCF step
wall time of 51 seconds on 34,560 processors; thus allowing us to carry out 1.0
ps of ab initio molecular dynamics in approximately 28 hours (of wall time).Comment: Resubmitted version (version 2
- …