A parallel divide and conquer algorithm for the generalized real symmetric definite tridiagonal eigenproblem
Abstract
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.
Rights
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.NPS Report Number
NPS-MA-93-009Related items
Showing items related by title, author, creator and subject.
-
Linear optimization and image reconstruction
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 ... -
Implementation of a multi-robot coverage algorithm on a two-dimensional, grid-based environment
Huang, Jo-Wen (Monterey, California: Naval Postgraduate School, 2017-06);With the development and advancement in the technology of control and multi-robot systems, robot agents are likely to take over mine countermeasure (MCM) missions one day. The path planning coverage algorithm is an essential ... -
Motion planning and dynamic control of the Nomad 200 mobile robot in a laboratory environment
Tan, Ko-Cheng (Monterey, California. Naval Postgraduate School, 1996-06);Motion planning and control of a Nomad 200 mobile robot are studied in this thesis. The objective is to develop a motion planning and control algorithm that is able to move the robot from an initial configuration (position ...