Iterative diagonalization of symmetric matrices in mixed precision
arXiv:1108.4509
Abstract
Diagonalization of a large matrix is the computational bottleneck in many applications such as electronic structure calculations. We show that a speedup of over 30% can be achieved by exploiting 32-bit floating point operations, while keeping 64-bit accuracy. Moreover, most of the computationally expensive operations are performed by level-3 BLAS/LAPACK routines in our implementation, thus leading to optimal performance on most platforms. Further improvement can be made by using problem-specific preconditioners which take into account nondiagonal elements.
arXiv comment10 pages, 7 figures
References in corpus (6)
- The SIESTA method for ab initio order-N materials simulation
- Efficient index handling of multidimensional periodic boundary conditions
- Phonons and related properties of extended systems from density-functional perturbation theory
- Ensemble density-functional theory for ab-initio molecular dynamics of metals and finite-temperature insulators
- Accelerating Scientific Computations with Mixed Precision Algorithms
- Calculations on millions of atoms with DFT: Linear scaling shows its potential