PARALLEL SPECTRAL DIVISION USING THE MATRIX SIGN FUNCTION FOR THE GENERALIZED EIGENPROBLEM
Steven Huss‐Lederman, Enrique S. Quintana–Ort́ı, Xiaobai Sun et al. · International Journal of High Speed Computing · 2000
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 compute the sign function of the matrix pair. A recent study showed a considerable reduction (by 75%) in the computational cost of this iteration, making this approach competitive when compared to the traditional QZ algorithm.The experimental results on an IBM SP3 multicomputer report the parallel performance (efficiency around 60–80%) and scalability of this approach.
Cited by 9 works. doi:10.1142/s0129053300000084
Authors
References
- An Algorithm for Generalized Matrix Eigenvalue Problems
- Rank revealing QR factorizations
- Linear model reduction and solution of the algebraic Riccati equation by use of the sign function†
- Rank-revealing 𝑄𝑅 factorizations and the singular value decomposition
- Computing rank-revealing QR factorizations of dense matrices
- The Spectral Decomposition of Nonsymmetric Matrices on Distributed Memory Parallel Computers
- A generalization of the matrix-sign-function solution for algebraic Riccati equations
- An inverse free parallel spectral divide and conquer algorithm for nonsymmetric eigenproblems
- On stabilization methods of descriptor systems
- Solving stable generalized Lyapunov equations with the matrix sign function