Divide and Conquer Symmetric Tridiagonal Eigensolver for Multicore Architectures

Abstract : Computing eigenpairs of a symmetric matrix is a problem arising in many industrial applications, including quantum physics and finite-elements computation for automo-biles. A classical approach is to reduce the matrix to tridiagonal form before computing eigenpairs of the tridiagonal matrix. Then, a back-transformation allows one to obtain the final solution. Parallelism issues of the reduction stage have already been tackled in different shared-memory libraries. In this article, we focus on solving the tridiagonal eigenproblem, and we describe a novel implementation of the Divide and Conquer algorithm. The algorithm is expressed as a sequential task-flow, scheduled in an out-of-order fashion by a dynamic runtime which allows the programmer to play with tasks granularity. The resulting implementation is between two and five times faster than the equivalent routine from the INTEL MKL library, and outperforms the best MRRR implementation for many matrices.
Complete list of metadatas

https://hal.inria.fr/hal-01078356
Contributor : Gregoire Pichon <>
Submitted on : Thursday, June 18, 2015 - 9:36:14 AM
Last modification on : Thursday, December 13, 2018 - 6:48:05 PM
Long-term archiving on: Tuesday, April 25, 2017 - 7:48:39 AM

Identifiers

  • HAL Id : hal-01078356, version 3

Collections

Citation

Grégoire Pichon, Azzam Haidar, Mathieu Faverge, Jakub Kurzak. Divide and Conquer Symmetric Tridiagonal Eigensolver for Multicore Architectures. IEEE International Parallel & Distributed Processing Symposium (IPDPS 2015), May 2015, Hyderabad, India. ⟨hal-01078356v3⟩

Share

Metrics

Record views

656

Files downloads

658