A parallel divide and conquer algorithm for the generalized real symmetric definite tridiagonal eigenproblem
By: by Carlos F. Borges, William B. Gragg
Contributors: Gragg, William B.; Naval Postgraduate School (U.S.). Dept. of Mathematics
Publisher: Naval Postgraduate School; Available from National Technical Information Service
Published: 1992
Place of publication: Monterey, Calif; Springfield, Va
Language: eng
Number of pages: 19
Subjects: EIGENVECTORS; ALGORITHMS
Other titles: NPS-MA-93-009.
Description: 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.
Notes: Cover title.

"NPS-MA-93-009."

"Technical report for period September 1992 - December 1992."

AD A262 297.

Includes bibliographical references (p. 18-19).

GM  3/20/01

aq/  /aq cc:9116 09/04/97