174 research outputs found

    On large-scale diagonalization techniques for the Anderson model of localization

    Get PDF
    We propose efficient preconditioning algorithms for an eigenvalue problem arising in quantum physics, namely the computation of a few interior eigenvalues and their associated eigenvectors for large-scale sparse real and symmetric indefinite matrices of the Anderson model of localization. We compare the Lanczos algorithm in the 1987 implementation by Cullum and Willoughby with the shift-and-invert techniques in the implicitly restarted Lanczos method and in the Jacobi–Davidson method. Our preconditioning approaches for the shift-and-invert symmetric indefinite linear system are based on maximum weighted matchings and algebraic multilevel incomplete LDLT factorizations. These techniques can be seen as a complement to the alternative idea of using more complete pivoting techniques for the highly ill-conditioned symmetric indefinite Anderson matrices. We demonstrate the effectiveness and the numerical accuracy of these algorithms. Our numerical examples reveal that recent algebraic multilevel preconditioning solvers can accelerate the computation of a large-scale eigenvalue problem corresponding to the Anderson model of localization by several orders of magnitude

    Author index for volumes 101–200

    Get PDF

    Symbolic Algorithm for Inverting General k-Tridiagonal Interval Matrices

    Get PDF
    The k-tridiagonal matrices have received much attention in recent years. Many different algorithms have been proposed to improve the efficiency of k-tridiagonal matrix estimation. A novel method based on interval analysis has been identified to improve the efficiency of the calculation. This paper presents efficient and reliable computational algorithms for determining the determinant and inverse of general k-tridiagonal interval matrices built on generalized interval arithmetic. This study is based on the Doolittle LU factorization of the interval matrix. Finally, examples are presented to illustrate the algorithms

    A single-mode quantum transport in serial-structure geometric scatterers

    Full text link
    We study transport in quantum systems consisting of a finite array of N identical single-channel scatterers. A general expression of the S matrix in terms of the individual-element data obtained recently for potential scattering is rederived in this wider context. It shows in particular how the band spectrum of the infinite periodic system arises in the limit NN\to\infty. We illustrate the result on two kinds of examples. The first are serial graphs obtained by chaining loops or T-junctions. A detailed discussion is presented for a finite-periodic "comb"; we show how the resonance poles can be computed within the Krein formula approach. Another example concerns geometric scatterers where the individual element consists of a surface with a pair of leads; we show that apart of the resonances coming from the decoupled-surface eigenvalues such scatterers exhibit the high-energy behavior typical for the delta' interaction for the physically interesting couplings.Comment: 36 pages, a LaTeX source file with 2 TeX drawings, 3 ps and 3 jpeg figures attache

    Solution of partial differential equations on vector and parallel computers

    Get PDF
    The present status of numerical methods for partial differential equations on vector and parallel computers was reviewed. The relevant aspects of these computers are discussed and a brief review of their development is included, with particular attention paid to those characteristics that influence algorithm selection. Both direct and iterative methods are given for elliptic equations as well as explicit and implicit methods for initial boundary value problems. The intent is to point out attractive methods as well as areas where this class of computer architecture cannot be fully utilized because of either hardware restrictions or the lack of adequate algorithms. Application areas utilizing these computers are briefly discussed

    Decay properties of spectral projectors with applications to electronic structure

    Full text link
    Motivated by applications in quantum chemistry and solid state physics, we apply general results from approximation theory and matrix analysis to the study of the decay properties of spectral projectors associated with large and sparse Hermitian matrices. Our theory leads to a rigorous proof of the exponential off-diagonal decay ("nearsightedness") for the density matrix of gapped systems at zero electronic temperature in both orthogonal and non-orthogonal representations, thus providing a firm theoretical basis for the possibility of linear scaling methods in electronic structure calculations for non-metallic systems. We further discuss the case of density matrices for metallic systems at positive electronic temperature. A few other possible applications are also discussed.Comment: 63 pages, 13 figure

    Studies in Rheology: Molecular Simulation and Theory

    Get PDF
    With an enormous advance in the capability of computers during the last fewdecades, the computer simulation has become an important tool for scientific researches in many areas such as physics, chemistry, biology, and so on. In particular, moleculardynamics (MD) simulations have been proven to be of a great help in understanding the rheology of complex fluids from the fundamental microscopic viewpoint. There are two important standard flows in rheology: shear flow and elongational flow. While there exist suitable nonequilibrium MD (NEMD) algorithms of shear flows, such as the Lees-Edwards purely boundary-driven algorithm and the so-called SLLOD algorithm as a field-driven algorithm, a proper NEMD algorithm for elongational flow has been lacking. The main difficulty of simulating elongational flow lies in the limited simulation time available due to the contraction of one or two dimensions dictated by itskinematics. This problem, however, has been partially resolved by Kraynik and Reinelt’s ingenious discovery of the temporal and spatial periodicity of lattice vectors in planar elongational flow (PEF). Although there have been a few NEMD simulations of PEF using their idea, another serious defect has recently been reported when using the SLLOD algorithm in PEF: for adiabatic systems, the total linear momentum of the system in the contracting direction grows exponentially with time, which eventually leads to an aphysical phase transition.This problem has been completely resolved by using the so-called ‘proper-SLLOD’ or ‘p-SLLOD’ algorithm, whose development has been one of the mainaccomplishments of this study. The fundamental correctness of the p-SLLOD algorithm has been demonstrated quite thoroughly in this work through detailed theoretical analyses together with direct simulation results. Both theoretical and simulation works achieved in this research are expected to play a significant role in advancing the knowledge of rheology, as well as that of NEMD simulation itself for other types of flow in general. Another important achievement in this work is the demonstration of the possibility of predicting a liquid structure in nonequilibrium states by employing a concept of ‘hypothetical’ nonequilibrium potentials. The methodology developed in this work has been shown to have good potential for further developments in this field

    Turbo charging time-dependent density-functional theory with Lanczos chains

    Get PDF
    We introduce a new implementation of time-dependent density-functional theory which allows the \emph{entire} spectrum of a molecule or extended system to be computed with a numerical effort comparable to that of a \emph{single} standard ground-state calculation. This method is particularly well suited for large systems and/or large basis sets, such as plane waves or real-space grids. By using a super-operator formulation of linearized time-dependent density-functional theory, we first represent the dynamical polarizability of an interacting-electron system as an off-diagonal matrix element of the resolvent of the Liouvillian super-operator. One-electron operators and density matrices are treated using a representation borrowed from time-independent density-functional perturbation theory, which permits to avoid the calculation of unoccupied Kohn-Sham orbitals. The resolvent of the Liouvillian is evaluated through a newly developed algorithm based on the non-symmetric Lanczos method. Each step of the Lanczos recursion essentially requires twice as many operations as a single step of the iterative diagonalization of the unperturbed Kohn-Sham Hamiltonian. Suitable extrapolation of the Lanczos coefficients allows for a dramatic reduction of the number of Lanczos steps necessary to obtain well converged spectra, bringing such number down to hundreds (or a few thousands, at worst) in typical plane-wave pseudopotential applications. The resulting numerical workload is only a few times larger than that needed by a ground-state Kohn-Sham calculation for a same system. Our method is demonstrated with the calculation of the spectra of benzene, C60_{60} fullerene, and of chlorofyll a.Comment: 15 pages, 7 figures, to be pdflatex + bibte
    corecore