arXiv · 1108.4509
Iterative diagonalization of symmetric matrices in mixed precision
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.
Explore related subjects
Keep this discovery
Eiji Tsuchida, Yoong-Kee Choe. 2011-08-23. Iterative diagonalization of symmetric matrices in mixed precision. https://arxiv.org/abs/1108.4509
Cite the original work for its findings. Save a collection to share your selection of sources.