Year: 2011
East Asian Journal on Applied Mathematics, Vol. 1 (2011), Iss. 2 : pp. 187–196
Abstract
The multishift QR algorithm is efficient for computing all the eigenvalues of a dense, large-scale, non-Hermitian matrix. The major part of this algorithm can be performed by matrix-matrix multiplications and is therefore suitable for modern processors with hierarchical memory. A variant of this algorithm was recently proposed which can execute more computational parts by matrix-matrix multiplications. The algorithm is especially appropriate for recent coprocessors which contain many processor-elements such as the CSX600. However, the performance of the algorithm highly depends on the setting of parameters such as the numbers of shifts and divisions in the algorithm. Optimal settings are different depending on the matrix size and computational environments. In this paper, we construct a performance model to predict a setting of parameters which minimizes the execution time of the algorithm. Experimental results with the CSX600 coprocessor show that our model can be used to find the optimal setting.
You do not have full access to this article.
Already a Subscriber? Sign in as an individual or via your institution
Journal Article Details
Publisher Name: Global Science Press
Language: English
DOI: https://doi.org/10.4208/eajam.300510.250311a
East Asian Journal on Applied Mathematics, Vol. 1 (2011), Iss. 2 : pp. 187–196
Published online: 2011-01
AMS Subject Headings:
Copyright: COPYRIGHT: © Global Science Press
Pages: 10
Keywords: Eigenvalues multishift QR algorithm bulge-chasing performance modeling.