On Large-Scale Diagonalization Techniques for the Anderson Model of Localization

DOI10.1137/050637649MaRDI QIDQ3440198zbMATH OpenOpenAlexFDO

Authors Olaf Schenk, Matthias Bollhöfer, R. A. Römer

Publication date 22 May 2007

Published in SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0508111

zbMATH Keywords

numerical examplesmaximum weighted matchingLanczos algorithmsymmetric indefinite matrixlarge-scale eigenvalue problemmultilevel preconditioningJacobi-Davidson algorithmAnderson model of localizationCullum-Willoughby implementationmultilevel incomplete \(LDL^{T}\) factorizations

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Graph algorithms (graph-theoretic aspects) (05C85) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Disordered systems (random Ising models, random Schrödinger operators, etc.) in equilibrium statistical mechanics (82B44)

Abstract: 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 the largest 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 $LD{L}^T$ 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 accelerative the computation of a large-scale eigenvalue problem corresponding to the Anderson model of localization by several orders of magnitude.

Recommendations

• On Large-Scale Diagonalization Techniques for the Anderson Model of Localization
• The Anderson Model of Localization: A Challenge for Modern Eigenvalue Methods
• Efficiently preconditioned inexact Newton methods for large symmetric eigenvalue problems
• Preconditioning the Lanczos Algorithm for Sparse Symmetric Eigenvalue Problems
• An extended basis inexact shift-invert Lanczos for the efficient solution of large-scale generalized eigenproblems

Cited in

(9)

• A note on the implementation of an interior-point algorithm for nonlinear optimization with inexact step computations
• scientific article; zbMATH DE number 5003177 (Why is no real title available?)
• Selecting radiotherapy dose distributions by means of constrained optimization problems
• Flow towards diagonalization for many-body-localization models: adaptation of the Toda matrix differential flow to random quantum spin chains
• A drift-diffusion-reaction model for excitonic photovoltaic bilayers: asymptotic analysis and a 2D HDG finite element scheme
• JADAMILU: a software code for computing selected eigenvalues of large sparse symmetric matrices
• A result complementary to Geršgorin's circle theorem
• On Large-Scale Diagonalization Techniques for the Anderson Model of Localization
• The Anderson Model of Localization: A Challenge for Modern Eigenvalue Methods

Describes a project that uses

Uses Software

• PARDISO

This page was built for publication: On Large-Scale Diagonalization Techniques for the Anderson Model of Localization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3440198)