The Anderson Model of Localization: A Challenge for Modern Eigenvalue Methods
This paper concerns methods for computing a few (5-10) interior eigenvalues and associated eigenvectors of a family of structured large sparse real symmetric indefinite matrices with off-diagonal entries equal to the off-diagonal entries of the 7-point central difference approximation of the three-dimensional Poisson equation on the unit cube with periodic boundary conditions and with suitably chosen random numbers (different for different matrices of the family) as main diagonal entries. It is shown experimentally for the present problem that the Lancos algorithm in the implementation of \textit{J. Cullum} and \textit{R. A. Willoughby} [Lanczos algorithms for large symmetric eigenvalue computations. Vol. 1: Theory; Vol. 2: Programs (1985; Zbl 0574.65028)] is faster and more memory efficient than a sparse hybrid tridiagonalization method as well as the implicitly restarted Arnoldi method coupled with polynomial acceleration and in shift-and-invert mode with several direct and invert solvers.
- On Large-Scale Diagonalization Techniques for the Anderson Model of Localization
- On Large-Scale Diagonalization Techniques for the Anderson Model of Localization
- Computing interior eigenvalues of large matrices
- scientific article; zbMATH DE number 2069268
- Claculating interior eigenvalues and eigenvectors with an implicitly restarted and a filter diagonalization method
- Two-grid methods for Hermitian positive definite linear systems connected with an order relation
- Principal eigenvector localization and centrality in networks: revisited
- Eigensystem multiscale analysis for Anderson localization in energy intervals
- On Large-Scale Diagonalization Techniques for the Anderson Model of Localization
- O(N) algorithms for disordered systems
- scientific article; zbMATH DE number 737032 (Why is no real title available?)
- A numerical and symbolical approximation of the nonlinear Anderson model
- The spectra of large Toeplitz band matrices with a randomly perturbed entry
- On Large-Scale Diagonalization Techniques for the Anderson Model of Localization
- A new approach for determining the time step when propagating with the Lanczos algorithm
- Spectral approximation of banded Laurent matrices with localized random perturbations
This page was built for publication: The Anderson Model of Localization: A Challenge for Modern Eigenvalue Methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4702356)