1988Unpublished venueOpen access

A hybrid hypercube algorithm for the symmetric tridiagonal eigenvalue problem

J. A. Jackson, Lorie M. Liebrock, Leopold Ziegler

Open full text 1 citations

Abstract

Two versions of an algorithm for finding the eigenvalues of symmetric, tridiagonal matrices are described. They are based on the use of the Sturm sequences and the bisection algorithm. The algorithms were implemented on the FPS T-Series. Some speedup factor results are presented.

Open-access reader

About this research paper

What this paper is about

Two versions of an algorithm for finding the eigenvalues of symmetric, tridiagonal matrices are described. They are based on the use of the Sturm sequences and the bisection algorithm. The algorithms were implemented on the FPS T-Series. Some speedup factor results are presented.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Two versions of an algorithm for finding the eigenvalues of symmetric, tridiagonal matrices are described. They are based on the use of the Sturm sequences and the bisection algorithm. The algorithms were implemented on the FPS T-Series. Some speedup factor results are presented.

Key concepts: Tridiagonal matrix, Hypercube, Eigenvalues and eigenvectors, Speedup, Algorithm, Bisection method, Tridiagonal matrix algorithm, Bisection

Related papers

Back to paper searchBrowse research topicsOriginal source
A hybrid hypercube algorithm for the symmetric tridiagonal eigenvalue problem — Research Paper | ScholarLens