1969•Mathematics of ComputationRequires access

On the computation of the eigenvalues of a tridiagonal matrix

I. Gargantini

Abstract

A recent algorithm for the simultaneous approximation of all zeros of a polynomial is applied to the computation of the eigenvalues of a tridiagonal matrix. The method works in the presence of multiplicity and degeneracy and has been tested in a multitude of cases ; its practical limitation on a computer is the large number of locations required for matrices of high order.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 2 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

Key concepts: Tridiagonal matrix, Mathematics, Eigenvalues and eigenvectors, Computation, Applied mathematics, Matrix (chemical analysis), Multiplicity (mathematics), Polynomial matrix