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

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 $LDL^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 accelerate the computation of a large-scale eigenvalue problem corresponding to the Anderson model of localization by several orders of magnitude.

[1]  J. Cullum,et al.  Lanczos algorithms for large symmetric eigenvalue computations , 1985 .

[2]  Olaf Schenk,et al.  The effects of unsymmetric matrix permutations and scalings in semiconductor device and circuit simulation , 2004, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[3]  Vipin Kumar,et al.  A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..

[4]  E. N. Economou,et al.  Scaling properties in highly anisotropic systems , 1997 .

[5]  Edmond Chow,et al.  Crout Versions of ILU for General Sparse Matrices , 2003, SIAM J. Sci. Comput..

[6]  J. Bunch,et al.  Some stable methods for calculating inertia and solving symmetric linear systems , 1977 .

[7]  Rudolf A. Römer,et al.  The Anderson Model of Localization: A Challenge for Modern Eigenvalue Methods , 1999, SIAM J. Sci. Comput..

[8]  E. Ng,et al.  Predicting structure in nonsymmetric sparse matrix factorizations , 1993 .

[9]  Olaf Schenk,et al.  Weighted Matchings for Preconditioning Symmetric Indefinite Linear Systems , 2006, SIAM J. Sci. Comput..

[10]  B. Parlett.  The Symmetric Eigenvalue Problem , 1981 .

[11]  Eleftherios N. Economou,et al.  Fractal Character of Eigenstates in Disordered Systems , 1984 .

[12]  P. Arbenz,et al.  Multilevel preconditioned iterative eigensolvers for Maxwell eigenvalue problems , 2005 .

[13]  R. A. Römer,et al.  The two-dimensional Anderson model of localization with random hopping , 1997 .

[14]  Iain S. Duff,et al.  The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices , 1999, SIAM J. Matrix Anal. Appl..

[15]  M. Schreiber,et al.  Use of cluster computing for the Anderson model of localization , 2002 .

[16]  Gerard L. G. Sleijpen,et al.  Jacobi-Davidson Style QR and QZ Algorithms for the Reduction of Matrix Pencils , 1998, SIAM J. Sci. Comput..

[17]  Y. Saad,et al.  GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems , 1986 .

[18]  P. Marko,et al.  ABSENCE OF DIFFUSION IN CERTAIN RANDOM LATTICES , 2008 .

[19]  M. Schreiber,et al.  Phase diagram of the three-dimensional Anderson model of localization with random hopping , 1999, cond-mat/9908255.

[20]  Uwe Grimm,et al.  Electronic states in topologically disordered systems , 1998 .

[21]  Olaf Schenk,et al.  Matching-based preprocessing algorithms to the solution of saddle-point problems in large-scale nonconvex interior-point optimization , 2007, Comput. Optim. Appl..

[22]  Olaf Schenk,et al.  Inertia-Revealing Preconditioning For Large-Scale Nonconvex Constrained Optimization , 2008, SIAM J. Sci. Comput..

[23]  Iain S. Duff,et al.  Strategies for Scaling and Pivoting for Sparse Symmetric Indefinite Problems , 2005, SIAM J. Matrix Anal. Appl..

[24]  M. Schreiber,et al.  Multifractal analysis of the metal-insulator transition in anisotropic systems , 1996, cond-mat/9609276.

[25]  Yousef Saad,et al.  Iterative methods for sparse linear systems , 2003 .

[26]  B. Kramer,et al.  Localization: theory and experiment , 1993 .

[27]  J. Bunch.  Partial Pivoting Strategies for Symmetric Matrices , 1972 .

[28]  Yvan Notay,et al.  JADAMILU: a software code for computing selected eigenvalues of large sparse symmetric matrices , 2007, Comput. Phys. Commun..

[29]  Danny C. Sorensen,et al.  Implicit Application of Polynomial Filters in a k-Step Arnoldi Method , 1992, SIAM J. Matrix Anal. Appl..

[30]  Jack J. Dongarra,et al.  A proposal for an extended set of Fortran Basic Linear Algebra Subprograms , 1985, SGNM.

[31]  M. Benzi.  Preconditioning techniques for large linear systems: a survey , 2002 .

[32]  James Demmel,et al.  A Supernodal Approach to Sparse Partial Pivoting , 1999, SIAM J. Matrix Anal. Appl..

[33]  Aoki.  Fractal dimensionality of wave functions at the mobility edge: Quantum fractal in the Landau levels. , 1986, Physical review. B, Condensed matter.

[34]  Gene H. Golub,et al.  Matrix computations , 1983 .

[35]  Andreas Stathopoulos,et al.  Nearly Optimal Preconditioned Methods for Hermitian Eigenproblems under Limited Memory. Part I: Seeking One Eigenvalue , 2007, SIAM J. Sci. Comput..

[36]  John K. Reid,et al.  The Multifrontal Solution of Indefinite Sparse Symmetric Linear , 1983, TOMS.

[37]  Michael Schreiber,et al.  The Anderson transition: New numerical results for the critical exponents , 1990 .

[38]  M. Schreiber,et al.  Three-dimensional Anderson model of localization with binary random potential , 2003 .

[39]  J. H. Wilkinson,et al.  AN ESTIMATE FOR THE CONDITION NUMBER OF A MATRIX , 1979 .

[40]  Roland W. Freund,et al.  A QMR-based interior-point algorithm for solving linear programs , 1997, Math. Program..

[41]  Gene H. Golub,et al.  Numerical solution of saddle point problems , 2005, Acta Numerica.

[42]  Gianaurelio Cuniberti,et al.  Charge transport in DNA-based devices , 2004, cond-mat/0403640.

[43]  A. George,et al.  An Implementation of Gaussian Elimination with Partial Pivoting for Sparse Systems , 1985 .

[44]  Tobias Brandes,et al.  Critical dynamics and multifractal exponents at the Anderson transition in 3d disordered systems , 1996 .

[45]  M. Saunders,et al.  Solution of Sparse Indefinite Systems of Linear Equations , 1975 .

[46]  David S. Dodson,et al.  Issues relating to extension of the Basic Linear Algebra Subprograms , 1985, SGNM.

[47]  M. Schreiber,et al.  Energy-level statistics at the metal-insulator transition in anisotropic systems , 1999, cond-mat/9909210.

[48]  Olaf Schenk,et al.  Solving unsymmetric sparse systems of linear equations with PARDISO , 2004, Future Gener. Comput. Syst..

[49]  Eleftherios N. Economou,et al.  Off-diagonal disorder in one-dimensional systems , 1981 .

[50]  Chao Yang,et al.  ARPACK users' guide - solution of large-scale eigenvalue problems with implicitly restarted Arnoldi methods , 1998, Software, environments, tools.

[51]  Michele Benzi,et al.  Preconditioning Highly Indefinite and Nonsymmetric Matrices , 2000, SIAM J. Sci. Comput..

[52]  Patrick R. Amestoy,et al.  An Approximate Minimum Degree Ordering Algorithm , 1996, SIAM J. Matrix Anal. Appl..

[53]  Yvan Notay,et al.  Inner iterations in eigenvalue solvers , 2005 .

[54]  Gerard L. G. Sleijpen,et al.  A Jacobi-Davidson Iteration Method for Linear Eigenvalue Problems , 1996, SIAM J. Matrix Anal. Appl..

[55]  Michael Schreiber,et al.  Localization of electronic states in 2D disordered systems , 1992 .

[56]  R. Freund,et al.  Software for simplified Lanczos and QMR algorithms , 1995 .

[57]  Michael Schreiber,et al.  Numerical investigations of scaling at the Anderson transition , 2002 .

[58]  Rudolf A. Römer,et al.  On Large-Scale Diagonalization Techniques for the Anderson Model of Localization , 2006, SIAM J. Sci. Comput..

[59]  A. Neumaier,et al.  A NEW PIVOTING STRATEGY FOR GAUSSIAN ELIMINATION , 1996 .

[60]  Yousef Saad,et al.  Multilevel Preconditioners Constructed From Inverse-Based ILUs , 2005, SIAM J. Sci. Comput..

[61]  James Demmel,et al.  SuperLU_DIST: A scalable distributed-memory sparse direct solver for unsymmetric linear systems , 2003, TOMS.

[62]  O. Schenk,et al.  ON FAST FACTORIZATION PIVOTING METHODS FOR SPARSE SYMMETRI C INDEFINITE SYSTEMS , 2006 .

[63]  R. Geus.  The Jacobi-Davidson algorithm for solving large sparse symmetric eigenvalue problems with application to the design of accelerator cavities , 2002 .