Parallel spectral division using the matrix sign function for the generalized eigenproblem

Citation
S. Huss-lederman et al., Parallel spectral division using the matrix sign function for the generalized eigenproblem, INT J HI SP, 11(1), 2000, pp. 1-14
Citations number
25
Language
INGLESE
art.tipo
Article
Categorie Soggetti
Computer Science & Engineering
Journal title
INTERNATIONAL JOURNAL OF HIGH SPEED COMPUTING
ISSN journal
0129-0533 → ACNP
Volume
11
Issue
1
Year of publication
2000
Pages
1 - 14
Database
ISI
SICI code
0129-0533(200003)11:1<1:PSDUTM>2.0.ZU;2-P
Abstract
In this paper we demonstrate the parallelism of the spectral division using the matrix sign function for the generalized nonsymmetric eigenproblem. We employ the so-called generalized Newton iterative scheme in order to compu te the sign function of the matrix pair. A recent study showed a considerab le reduction (by 75%) in the computational cost of this iteration, making t his approach competitive when compared to the traditional QZ algorithm. The experimental results on an IBM SP3 multicomputer report the parallel pe rformance (efficiency around 60-80%) and scalability of this approach.