145 research outputs found
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
Scalable Quantum Computation of Highly Excited Eigenstates with Spectral Transforms
We propose a natural application of Quantum Linear Systems Problem (QLSP)
solvers such as the HHL algorithm to efficiently prepare highly excited
interior eigenstates of physical Hamiltonians in a variational manner. This is
enabled by the efficient computation of inverse expectation values, taking
advantage of the QLSP solvers' exponentially better scaling in problem size
without concealing exponentially costly pre/post-processing steps that usually
accompanies it. We detail implementations of this scheme for both
fault-tolerant and near-term quantum computers, analyse their efficiency and
implementability, and discuss applications and simulation results in many-body
physics and quantum chemistry that demonstrate its superior effectiveness and
scalability over existing approaches.Comment: 16 pages, 6 figure
Complexity Reduction in Density Functional Theory: Locality in Space and Energy
We present recent developments of the NTChem program for performing large
scale hybrid Density Functional Theory calculations on the supercomputer
Fugaku. We combine these developments with our recently proposed Complexity
Reduction Framework to assess the impact of basis set and functional choice on
its measures of fragment quality and interaction. We further exploit the all
electron representation to study system fragmentation in various energy
envelopes. Building off this analysis, we propose two algorithms for computing
the orbital energies of the Kohn-Sham Hamiltonian. We demonstrate these
algorithms can efficiently be applied to systems composed of thousands of atoms
and as an analysis tool that reveals the origin of spectral properties.Comment: Accepted Manuscrip
ELSI -- An open infrastructure for electronic structure solvers
Routine applications of electronic structure theory to molecules and periodic systems need to compute the electron density from given Hamiltonian and, in case of non-orthogonal basis sets, overlap matrices. System sizes can range from few to thousands or, in some examples, millions of atoms. Different discretization schemes (basis sets) and different system geometries (finite non-periodic vs. infinite periodic boundary conditions) yield matrices with different structures. The ELectronic Structure Infrastructure (ELSI) project provides an open-source software interface to facilitate the implementation and optimal use of high-performance solver libraries covering cubic scaling eigensolvers, linear scaling density-matrix-based algorithms, and other reduced scaling methods in between. In this paper, we present recent improvements and developments inside ELSI, mainly covering (1) new solvers connected to the interface, (2) matrix layout and communication adapted for parallel calculations of periodic and/or spin-polarized systems, (3) routines for density matrix extrapolation in geometry optimization and molecular dynamics calculations, and (4) general utilities such as parallel matrix I/O and JSON output. The ELSI interface has been integrated into four electronic structure code projects (DFTB+, DGDFT, FHI-aims, SIESTA), allowing us to rigorously benchmark the performance of the solvers on an equal footing. Based on results of a systematic set of large-scale benchmarks performed with Kohn–Sham density-functional theory and density-functional tight-binding theory, we identify factors that strongly affect the efficiency of the solvers, and propose a decision layer that assists with the solver selection process. Finally, we describe a reverse communication interface encoding matrix-free iterative solver strategies that are amenable, e.g., for use with planewave basis sets. Program summary: Program title: ELSI Interface CPC Library link to program files: http://dx.doi.org/10.17632/473mbbznrs.1 Licensing provisions: BSD 3-clause Programming language: Fortran 2003, with interface to C/C++ External routines/libraries: BLACS, BLAS, BSEPACK (optional), EigenExa (optional), ELPA, FortJSON, LAPACK, libOMM, MPI, MAGMA (optional), MUMPS (optional), NTPoly, ParMETIS (optional), PETSc (optional), PEXSI, PT-SCOTCH (optional), ScaLAPACK, SLEPc (optional), SuperLU_DIST Nature of problem: Solving the electronic structure from given Hamiltonian and overlap matrices in electronic structure calculations. Solution method: ELSI provides a unified software interface to facilitate the use of various electronic structure solvers including cubic scaling dense eigensolvers, linear scaling density matrix methods, and other approaches
Recommended from our members
Inexact and Nonlinear Extensions of the FEAST Eigenvalue Algorithm
Eigenvalue problems are a basic element of linear algebra that have a wide variety of applications. Common examples include determining the stability of dynamical systems, performing dimensionality reduction on large data sets, and predicting the physical properties of nanoscopic objects. Many applications require solving large dimensional eigenvalue problems, which can be very challenging when the required number of eigenvalues and eigenvectors is also large. The FEAST algorithm is a method of solving eigenvalue problems that allows one to calculate large numbers of eigenvalue/eigenvector pairs by using contour integration in the complex plane to divide the large number of desired pairs into many small groups; these small groups of eigenvalue/eigenvector pairs may then be simultaneously calculated independently of each other. This makes it possible to quickly solve eigenvalue problems that might otherwise be very difficult to solve efficiently.
The standard FEAST algorithm can only be used to solve eigenvalue problems that are linear, and whose matrices are small enough to be factorized efficiently (thus allowing linear systems of equations to be solved exactly). This limits the size and the scope of the problems to which the FEAST algorithm may be applied. This dissertation describes extensions of the standard FEAST algorithm that allow it to efficiently solve nonlinear eigenvalue problems, and eigenvalue problems whose matrices are large enough that linear systems of equations can only be solved inexactly
Recommended from our members
A Shift Selection Strategy for Parallel Shift-invert Spectrum Slicing in Symmetric Self-consistent Eigenvalue Computation
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
Recommended from our members
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
- …