A parallel divide and conquer algorithm for the generalized real symmetric definite tridiagonal eigenproblem
Borges, Carlos F.
Gragg, William B.
MetadataShow full item record
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.
Approved for public release; distribution is unlimited.
NPS Report NumberNPS-MA-93-009
Showing items related by title, author, creator and subject.
Rhoden, Christopher A. (Monterey, California. Naval Postgraduate School, 1994-06);The Simplex algorithm, developed by George B. Dantzig in 1947 represents a quantum leap in the ability of applied scientists to solve complicated linear optimization problems. Subsequently, its utility in solving finite ...
Taylor, James G.; Neta, Beny (Monterey, California. Naval Postgraduate School, 2001-09); NPS-MA-01-001The goal of this study effort was to assess the ability of the Joint Conflict and Tactical Simulation (JCATS) to simulate the capabilities of non- lethal weapons (NLW) and to provide a product that can be incorporated into ...
De Kooter, Peter M. (Monterey, California. Naval Postgraduate School, 1997-03);As part of the existing acoustic transient localization program, a feasibility study was performed to apply existing algorithms to signals at higher carrier frequencies. The coherent matching, autocorrelation matching and ...