Solving nonsymmetric eigenproblems on distributed memory concurrent computers

The design and implementation of a parallel nonsymmetric eigensolver is one of the most challenging problems in numerical linear algebra. This paper describes a distributed memory concurrent computer implementation of an algorithm based on the matrix sign function to "spectrally divide and conquer" the matrix. Performance and scalability results are also presented.<
>