Location of Repository

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\ud 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\ud 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\ud by several orders of magnitude

Topics:
QC

Publisher: Society for Industrial and Applied Mathematics

Year: 2006

OAI identifier:
oai:wrap.warwick.ac.uk:346

Provided by:
Warwick Research Archives Portal Repository

- (1998). A fast and high quality multilevel scheme for partitioning irregular graphs,
- (1999). A Fast Maximum-Weight-Bipartite-Matching Algorithm for Reducing Pivoting in Sparse Gaussian Elimination,
- (1996). A Jacobi–Davidson iteration for linear eigenvalue problems,
- (1996). A new pivoting strategy for Gaussian elimination,
- (1985). A proposal for an extended set of Fortran basic linear algebra subprograms,
- (1997). A QMR-based interior-point algorithm for solving linear programs,
- (1999). A supernodal approach to sparse partial pivoting,
- (1958). Absence of diﬀusion in certain random lattices,
- (1996). An approximate minimum degree ordering algorithm,
- (1979). An estimate for the condition number of a matrix,
- (1985). An implementation of Gaussian elimination with partial pivoting for sparse systems,
- (1996). Critical dynamics and multifractal exponents at the Anderson transition in 3d disordered systems,
- (2003). Crout versions of ILU for general sparse matrices,
- (1998). Electronic states in topologically disordered systems,
- (2000). Energy-level statistics at the metal-insulator transition in anisotropic systems,
- (2004). Felice, Charge transport in DNA-based devices,i n Long-Range Charge Transfer
- (1984). Fractal character of eigenstates in disordered systems,
- (1986). Fractal dimensionality of wave functions at the mobility edge: Quantum fractal in the Landau levels,
- (1986). GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems,
- (1992). Implicit application of polynomial ﬁlters in a k-step Arnoldi method,
- (2005). Inner Iterations in Eigenvalue Solvers,
- (1985). Issues relating to extension of the basic linear algebra subprograms,
- (2003). Iterative Methods for Sparse Linear Systems,
- (1998). Jacobi–Davidson style QR and QZ algorithms for the reduction of matrix pencils,
- (1985). Lanczos Algorithms for Large Symmetric Eigenvalue Computations, Volume 1: Theory, Birkh¨ auser
- (1985). Lanczos Algorithms for Large Symmetric Eigenvalue Computations, Volume 2: Programs, Birkh¨ auser
- (1992). Localization of electronic states in 2D disordered systems,
- (1993). Localization: Theory and experiment,
- (1997). Multifractal analysis of the metal-insulator transition in anisotropic systems,
- (2005). Multilevel preconditioned iterative eigensolvers for Maxwell eigenvalue problems,
- (2006). Multilevel preconditioners constructed from inverse-based ILUs,
- (2005). Nearly Optimal Preconditioned Methods for Hermitian Eigenproblems under Limited Memory. Part I: Seeking One Eigenvalue,
- (2003). Numerical investigations of scaling at the Anderson transition, in The Anderson Transition and Its Ramiﬁcations—Localisation, Quantum Interference,
- (2005). Numerical solution of saddle point problems,
- (1981). Oﬀ-diagonal disorder in one-dimensional systems,
- (2004). On Fast Factorization Pivoting Methods for Symmetric Indeﬁ-nite Systems,
- (1974). Partial pivoting strategies for symmetric matrices,
- (1999). Phase diagram of the three-dimensional Anderson model of localization with random hopping,
- (2000). Preconditioning highly indeﬁnite and nonsymmetric matrices,
- (2002). Preconditioning techniques for large linear systems: A survey,
- (1993). Predicting structure in nonsymmetric sparse matrix factorizations,
- (1997). Scaling properties in highly anisotropic systems,
- (1995). Software for simpliﬁed Lanczos and QMR algorithms,
- (1975). Solution of sparse indeﬁnite systems of linear equations,
- (2004). Solving unsymmetric sparse systems of linear equations with PARDISO,
- (1977). Some stable methods for calculating inertia and solving symmetric linear systems,
- (2004). Strategies for Scaling and Pivoting for Sparse Symmetric Indeﬁnite Problems,
- (2003). SuperLU DIST: A scalable distributed-memory sparse direct solver for unsymmetric linear systems,
- (2002). Symmetric weighted matching for indeﬁnite systems, talk presented at the Householder Symposium XV,
- (1999). The Anderson model of localization: A challenge for modern eigenvalue methods,
- (1990). The Anderson transition: New numerical results for the critical exponents,
- (1999). The design and use of algorithms for permuting large entries to the diagonal of sparse matrices,
- (2004). The eﬀects of unsymmetric matrix permutations and scalings in semiconductor device and circuit simulation,
- (2004). The Iterative Eigensolver Template Library,
- (2002). The Jacobi–Davidson Algorithm for Solving Large Sparse Symmetric Eigenvalue Problems with Application to the Design of Accelerator Cavities,
- (1983). The multifrontal solution of indeﬁnite sparse symmetric linear equations,
- (1980). The Symmetric Eigenvalue Problem, Prentice-Hall,
- (1998). The two-dimensional Anderson model of localization with random hopping,
- (2003). Three-dimensional Anderson model of localization with binary random potential,
- (2002). Use of cluster computing for the Anderson model of localization,
- (2006). Weighted matchings for preconditioning symmetric indeﬁnite linear systems,

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.