A parallel divide and conquer algorithm for the generalized real symmetric definite tridiagonal eigenproblem - Info and Reading Options

The Open Library:

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.

Search for “A parallel divide and conquer algorithm for the generalized real symmetric definite tridiagonal eigenproblem” downloads:

Visit our Downloads Search page to see if downloads are available.

Borrow "A parallel divide and conquer algorithm for the generalized real symmetric definite tridiagonal eigenproblem" Online:

Check on the availability of online borrowing. Please note that online borrowing has copyright-based limitations and that the quality of ebooks may vary.

• Is Online Borrowing Available: Yes
• Preview Status: full
• Check if available: The Open Library & The Internet Archive

Find “A parallel divide and conquer algorithm for the generalized real symmetric definite tridiagonal eigenproblem” in Libraries Near You:

Read or borrow “A parallel divide and conquer algorithm for the generalized real symmetric definite tridiagonal eigenproblem” from your local library.

• The WorldCat Libraries Catalog: Find a copy of “A parallel divide and conquer algorithm for the generalized real symmetric definite tridiagonal eigenproblem” at a library near you.