Design, Tuning and Evaluation of Parallel Multilevel ILU Preconditioners
High Performance Computing for Computational Science - VECPAR 2008
Saving flops in LU based shift-and-invert strategy
Journal of Computational and Applied Mathematics
Face image relighting using locally constrained global optimization
ECCV'10 Proceedings of the 11th European conference on Computer vision: Part IV
An Interior-Point Algorithm for Large-Scale Nonlinear Optimization with Inexact Step Computations
SIAM Journal on Scientific Computing
Potential of General Purpose Graphic Processing Unit for Energy Management System
International Journal of Distributed Systems and Technologies
VSP--a quantum-electronic simulation framework
Journal of Computational Electronics
| Hi-index | 0.00 |
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.