Estimating the number of eigenvalues located in a given interval of a large sparse Hermitian matrix is an important problem in certain applications, and it is a prerequisite of eigensolvers based on a divide-andconquer paradigm. Often, an exact count is not necessary, and methods based on stochastic estimates can be utilized to yield rough approximations. This paper examines a number of techniques tailored to this specific task. It reviews standard approaches and explores new ones based on polynomial and rational approximation filtering combined with a stochastic procedure. We also discuss how the latter method is particularly wellsuited for the FEAST eigensolver.ESTIMATING EIGENVALUE COUNTS 675 count OEa; b in OEa; b. While this method yields an exact count, it requires two complete LDL T factorizations, and this can be quite expensive for realistic eigenproblems.This paper discusses two alternative methods that provide only an estimate for OEa; b , but which are relatively inexpensive. Both methods work by estimating the trace of the spectral projector P associated with the eigenvalues inside the interval OEa; b. This spectral projector is expanded in two different ways, and its trace is computed by resorting to stochastic trace estimators, for example, [10,11]. The first method utilizes filtering techniques based on Chebyshev polynomials. The resulting projector is expanded as a polynomial function of A. In the second method, the projector is constructed by integrating the resolvent of the eigenproblem along a contour in the complex plane enclosing the interval OEa; b. In this case, the projector is approximated by a rational function of A.For each of the aforementioned methods, we present various implementations depending on the nature of the eigenproblem (generalized versus standard) and cost considerations. Thus, in the polynomial expansion case, we propose a barrier-type filter when dealing with a standard eigenproblem and two high/low pass filters in the case of generalized eigenproblems. In the rational expansion case, we have the choice of using an LU factorization or a Krylov subspace method to solve linear systems. The optimal implementation of each method used for the eigenvalue count depends on the situation at hand and involves compromises between cost and accuracy. While it is not the aim of this paper to explore detailed analysis of these techniques, we will discuss various possibilities and provide illustrative examples.The polynomial and rational expansion methods are motivated by two distinct approaches recently suggested in the context of electronic structure calculations: (i) spectrum slicing and (ii) Cauchy integral eigen-projection. In the spectrum slicing techniques [1], the eigenpairs are computed by dividing the spectrum in many small subintervals, called 'slices' or 'windows'. For each window, a barrier function is approximated by Chebyshev-Jackson polynomials in order to select only the portion of the spectrum in the slice. In this method, it is important to determine an approximate c...
We derive a novel computational scheme for functional Renormalization Group (fRG) calculations for interacting fermions on 2D lattices. The scheme is based on the exchange parametrization fRG for the two-fermion interaction, with additional insertions of truncated partitions of unity. These insertions decouple the fermionic propagators from the exchange propagators and lead to a separation of the underlying equations. We demonstrate that this separation is numerically advantageous and may pave the way for refined, large-scale computational investigations even in the case of complex multiband systems. Furthermore, on the basis of speedup data gained from our implementation, it is shown that this new variant facilitates efficient calculations on a large number of multi-core CPUs. We apply the scheme to the t,t ′ Hubbard model on a square lattice to analyze the convergence of the results with the bond length of the truncation of the partition of unity. In most parameter areas, a fast convergence can be observed. Finally, we compare to previous results in order to relate our approach to other fRG studies.
We analyze the FEAST method for computing selected eigenvalues and eigenvectors of large sparse matrix pencils. After establishing the close connection between FEAST and the well-known Rayleigh-Ritz method, we identify several critical issues that influence convergence and accuracy of the solver: the choice of the starting vector space, the stopping criterion, how the inner linear systems impact the quality of the solution, and the use of FEAST for computing eigenpairs from multiple intervals. We complement the study with numerical examples, and hint at possible improvements to overcome the existing problems.
Mathematical operators whose transformation rules constitute the building blocks of a multi-linear algebra are widely used in physics and engineering applications where they are very often represented as tensors. In the last century, thanks to the advances in tensor calculus, it was possible to uncover new research fields and make remarkable progress in the existing ones, from electromagnetism to the dynamics of fluids and from the mechanics of rigid bodies to quantum mechanics of many atoms. By now, the formal mathematical and geometrical properties of tensors are well defined and understood; conversely, in the context of scientific and high-performance computing, many tensorrelated problems are still open. In this paper, we address the problem of efficiently computing contractions among two tensors of arbitrary dimension by using kernels from the highly optimized BLAS library. In particular, we establish precise conditions to determine if and when GEMM, the kernel for matrix products, can be used. Such conditions take into consideration both the nature of the operation and the storage scheme of the tensors, and induce a classification of the contractions into three groups. For each group, we provide a recipe to guide the users towards the most effective use of BLAS.
Density Functional Theory (DFT) is one of the most used ab initio theoretical frameworks in materials science. It derives the ground state properties of a multi-atomic ensemble directly from the computation of its one-particle density n(r). In DFT-based simulations the solution is calculated through a chain of successive self-consistent cycles; in each cycle a series of coupled equations (Kohn-Sham) translates to a large number of generalized eigenvalue problems whose eigenpairs are the principal means for expressing n(r). A simulation ends when n(r) has converged to the solution within the required numerical accuracy. This usually happens after several cycles, resulting in a process calling for the solution of many sequences of eigenproblems. In this paper, the authors report evidence showing unexpected correlations between adjacent eigenproblems within each sequence. By investigating the numerical properties of the sequences of generalized eigenproblems it is shown that the eigenvectors undergo an "evolution" process. At the same time it is shown that the Hamiltonian matrices exhibit a similar evolution and manifest a specific pattern in the information they carry. Correlation between eigenproblems within a sequence is of capital importance: information extracted from the simulation at one step of the sequence could be used to compute the solution at the next step. Although they are not explored in this work, the implications could be manifold: from increasing the performance of material simulations, to the development of an improved iterative solver, to modifying the mathematical foundations of the DFT computational paradigm in use, thus opening the way to the investigation of new materials.
One of the greatest efforts of computational scientists is to translate the mathematical model describing a class of physical phenomena into large and complex codes. Many of these codes face the difficulty of implementing the mathematical operations in the model in terms of low level optimized kernels offering both performance and portability. Legacy codes suffer from the additional curse of rigid design choices based on outdated performance metrics (e.g. minimization of memory footprint). Using a representative code from the Materials Science community, we propose a methodology to restructure the most expensive operations in terms of an optimized combination of dense linear algebra (BLAS3) kernels. The resulting algorithm guarantees an increased performance and an extended life span of this code, enabling larger scale simulations.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
334 Leonard St
Brooklyn, NY 11211
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.