This report summarizes the results of our project {open_quotes}Numerical Methods for the Unsymmetric Tridiagonal Eigenvalue Problem{close_quotes}. It was funded by both by a DOE grant (No. DE-FG02-92ER25122, 6/1/92-5/31/94, $100,000) and by an NSF Research Initiation Award (No. CCR-9109785, 7/1/91-6/30/93, $46,564.) The publications resulting from that project during the DOE funding period are listed below. Two other journal papers and two other conference papers were produced during the NSF funding period. Most of the listed conference papers are early or partial versions of the listed journal papers
The paper discusses the following topics: attractions of the real tridiagonal case, relative eigenva...
Abstract: A solution is given for a problem on eigenvalues of some symmetric tridiagonal matrices su...
SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Kar...
Several relative condition numbers that exploit tridiagonal form are derived. Some of them use tridi...
. This paper describes programs to reduce a nonsymmetric matrix to tridiagonal form, compute the eig...
AbstractWe apply a novel approach to approximate within ϵ to all the eigenvalues of an n × n symmetr...
The computation of the eigenvalue decomposition of matrices is one of the most investigated problems...
We consider the solution of the homogeneous equation (J \Gamma I)x = 0 where J is a tridiagonal mat...
An algorithm based on the Ehrlich--Aberth iteration is presented for the computation of the zeros of...
A divide-and-conquer method is developed for solving the generalized eigenvalue problem Ax = Bx, whe...
For the eigenvalues of a symmetric tridiagonal matrix T, the most accurate algorithms deliver approx...
A solution is given for a problem on eigenvalues of some symmetric tridiagonal matrices suggested by...
The computation of the eigenvalue decomposition of symmetricmatrices is one of the most investigated...
[出版社版]rights: 日本応用数理学会 rights: 本文データは学協会の許諾に基づきCiNiiから複製したものである relation: IsVersionOf: http://ci.nii...
We present new algorithms that accelerate the bisection method for the symmetric tridiagonal eigenva...
The paper discusses the following topics: attractions of the real tridiagonal case, relative eigenva...
Abstract: A solution is given for a problem on eigenvalues of some symmetric tridiagonal matrices su...
SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Kar...
Several relative condition numbers that exploit tridiagonal form are derived. Some of them use tridi...
. This paper describes programs to reduce a nonsymmetric matrix to tridiagonal form, compute the eig...
AbstractWe apply a novel approach to approximate within ϵ to all the eigenvalues of an n × n symmetr...
The computation of the eigenvalue decomposition of matrices is one of the most investigated problems...
We consider the solution of the homogeneous equation (J \Gamma I)x = 0 where J is a tridiagonal mat...
An algorithm based on the Ehrlich--Aberth iteration is presented for the computation of the zeros of...
A divide-and-conquer method is developed for solving the generalized eigenvalue problem Ax = Bx, whe...
For the eigenvalues of a symmetric tridiagonal matrix T, the most accurate algorithms deliver approx...
A solution is given for a problem on eigenvalues of some symmetric tridiagonal matrices suggested by...
The computation of the eigenvalue decomposition of symmetricmatrices is one of the most investigated...
[出版社版]rights: 日本応用数理学会 rights: 本文データは学協会の許諾に基づきCiNiiから複製したものである relation: IsVersionOf: http://ci.nii...
We present new algorithms that accelerate the bisection method for the symmetric tridiagonal eigenva...
The paper discusses the following topics: attractions of the real tridiagonal case, relative eigenva...
Abstract: A solution is given for a problem on eigenvalues of some symmetric tridiagonal matrices su...
SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Kar...