A parallel algorithm for determining all eigenvalues of large real symmetric tridiagonal matrices
type: Item
instance of: scholarly article
title: A parallel algorithm for determining all eigenvalues of large real symmetric tridiagonal matrices
zbMATH Open document ID: 0763.65020
DOI: 10.1016/0167-8191(92)90060-K
author: S. Singh
published in: Parallel Computing
publication date: 1993-01-17T00:00:00Z
review text: A method for determining all eigenvalues of large real symmetric tridiagonal matrices on multiprocessor systems with vector facilities is presented. The method is based on the Sturm sequence and uses bisection for isolating and extracting the eigenvalues. For the extraction bisection is accelerated by a superlinear convergent zero finder, the Pegasus method. Some new ideas are presented for weighting the values of the characteristic polynomial to avoid under- and overflow. The experiments are realized on SUPRENUM (with 16 processors) and CRAY Y- MP8/832 (with 8 processors).
Mathematics Subject Classification ID: 65F15
Mathematics Subject Classification ID: 65Y05
zbMATH DE Number: 98850
zbMATH Keywords: superlinear convergence
zbMATH Keywords: eigenvalues
zbMATH Keywords: large real symmetric tridiagonal matrices
zbMATH Keywords: multiprocessor systems
zbMATH Keywords: Sturm sequence
zbMATH Keywords: bisection
zbMATH Keywords: Pegasus method
reviewed by: Plamen Yalamov
describes a project that uses: EISPACK
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 98850