Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Statistics
  • Help & Advice
University of Warwick

The Library

  • Login

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

Tools
- Tools
+ Tools

Schenk, Olaf, Bollhoefer, Matthias and Roemer, Rudolf A.. (2008) On large-scale diagonalization techniques for the Anderson model of localization. SIAM Review, Vol.50 (No.1). pp. 91-112. ISSN 0036-1445

Full text not available from this repository.
Official URL: http://dx.doi.org/10.1137/070707002

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 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 ill 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 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 by several orders of magnitude.

Item Type: Journal Article
Subjects: Q Science > QA Mathematics
Q Science > QC Physics
Divisions: Faculty of Science > Physics
Faculty of Science > Centre for Scientific Computing
Library of Congress Subject Headings (LCSH): Anderson model, Eigenvalues, Algorithms, Matrices
Journal or Publication Title: SIAM Review
Publisher: SIAM Publications
ISSN: 0036-1445
Date: March 2008
Volume: Vol.50
Number: No.1
Number of Pages: 22
Page Range: pp. 91-112
Identification Number: 10.1137/070707002
Status: Peer Reviewed
Publication Status: Published
Version or Related Resource: Schenk, O., et al. (2007). On large-scale diagonalization techniques for the Anderson model of localization. Proceedings in Applied Mathematics and Mechanics, 7(1), pp. 1021003-1021004 ; Schenk, O., Bollhöfer, M. and Römer R.A. (2006). On large-scale diagonalization techniques for the Anderson model of localization. SIAM Journal on Scientific Computing, 28(3), pp.963-983
Related URLs:
  • Related item in WRAP
  • Related item in WRAP
URI: http://wrap.warwick.ac.uk/id/eprint/30449

Data sourced from Thomson Reuters' Web of Knowledge

Request changes to a record

Actions (login required)

View Item View Item
twitter

Email us: publications@warwick.ac.uk
Contact Details
About Us