Downloads & Free Reading Options - Results

We develop a parallel divide and conquer algorithm, by extension, for the generalized real symmetric definite tridiagonal eigenproblem. The algorithm employs techniques first proposed by Gu and Eisenstat to prevent loss of orthogonality in the computed eigenvectors for the modification algorithm. We examine numerical stability and adapt the insightful error analysis of Gu and Eisenstat to the arrow case. The algorithm incorporates an elegant zero finder with global monotone cubic convergence that has performed well in numerical experiments. A complete set of tested matlab routines implementing the algorithm is available on request from the authors.