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

DOI10.1137/050637649zbMath1116.65046arXivmath/0508111OpenAlexW2217462822MaRDI QIDQ3440198

Olaf Schenk, Matthias Bollhöfer, Rudolf 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 examplesLanczos algorithmsymmetric indefinite matrixmaximum weighted matchinglarge-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) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Disordered systems (random Ising models, random Schrödinger operators, etc.) in equilibrium statistical mechanics (82B44) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

A note on the implementation of an interior-point algorithm for nonlinear optimization with inexact step computations ⋮ Selecting radiotherapy dose distributions by means of constrained optimization problems ⋮ 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

Uses Software

• PARDISO