The BR Eigenvalue algorithm

G. A. Geist; G. W. Howell; D. S. Watkins

doi:10.1137/S0895479897317077

The BR Eigenvalue algorithm

G. A. Geist, G. W. Howell, D. S. Watkins

National Center for Computational Scienc

Research output: Contribution to journal › Article › peer-review

10 Scopus citations

Abstract

The BR algorithm, a new method for calculating the eigenvalues of an upper Hessenberg matrix, is introduced. It is a bulge-chasing algorithm like the QR algorithm, but, unlike the QR algorithm, it is well adapted to computing the eigenvalues of the narrow-band, nearly tridiagonal matrices generated by the look-ahead Lanczos process. This paper describes the BR algorithm and gives numerical evidence that it works well in conjunction with the Lanczos process. On the biggest problems run so far, the BR algorithm beats the QR algorithm by a factor of 30-60 in computing time and a factor of over 100 in matrix storage space.

Original language	English
Pages (from-to)	1083-1098
Number of pages	16
Journal	SIAM Journal on Matrix Analysis and Applications
Volume	20
Issue number	4
DOIs	https://doi.org/10.1137/S0895479897317077
State	Published - Jul 1999

Keywords

Eigenvalue computation
QR algorithm
Unsymmetric Lanczos process

Access to Document

10.1137/S0895479897317077

Cite this

@article{6032be7fdfdc441e9c6b25430e437e2e,

title = "The BR Eigenvalue algorithm",

abstract = "The BR algorithm, a new method for calculating the eigenvalues of an upper Hessenberg matrix, is introduced. It is a bulge-chasing algorithm like the QR algorithm, but, unlike the QR algorithm, it is well adapted to computing the eigenvalues of the narrow-band, nearly tridiagonal matrices generated by the look-ahead Lanczos process. This paper describes the BR algorithm and gives numerical evidence that it works well in conjunction with the Lanczos process. On the biggest problems run so far, the BR algorithm beats the QR algorithm by a factor of 30-60 in computing time and a factor of over 100 in matrix storage space.",

keywords = "Eigenvalue computation, QR algorithm, Unsymmetric Lanczos process",

author = "Geist, {G. A.} and Howell, {G. W.} and Watkins, {D. S.}",

year = "1999",

month = jul,

doi = "10.1137/S0895479897317077",

language = "English",

volume = "20",

pages = "1083--1098",

journal = "SIAM Journal on Matrix Analysis and Applications",

issn = "0895-4798",

publisher = "Society for Industrial and Applied Mathematics",

number = "4",

}

TY - JOUR

T1 - The BR Eigenvalue algorithm

AU - Geist, G. A.

AU - Howell, G. W.

AU - Watkins, D. S.

PY - 1999/7

Y1 - 1999/7

N2 - The BR algorithm, a new method for calculating the eigenvalues of an upper Hessenberg matrix, is introduced. It is a bulge-chasing algorithm like the QR algorithm, but, unlike the QR algorithm, it is well adapted to computing the eigenvalues of the narrow-band, nearly tridiagonal matrices generated by the look-ahead Lanczos process. This paper describes the BR algorithm and gives numerical evidence that it works well in conjunction with the Lanczos process. On the biggest problems run so far, the BR algorithm beats the QR algorithm by a factor of 30-60 in computing time and a factor of over 100 in matrix storage space.

AB - The BR algorithm, a new method for calculating the eigenvalues of an upper Hessenberg matrix, is introduced. It is a bulge-chasing algorithm like the QR algorithm, but, unlike the QR algorithm, it is well adapted to computing the eigenvalues of the narrow-band, nearly tridiagonal matrices generated by the look-ahead Lanczos process. This paper describes the BR algorithm and gives numerical evidence that it works well in conjunction with the Lanczos process. On the biggest problems run so far, the BR algorithm beats the QR algorithm by a factor of 30-60 in computing time and a factor of over 100 in matrix storage space.

KW - Eigenvalue computation

KW - QR algorithm

KW - Unsymmetric Lanczos process

UR - http://www.scopus.com/inward/record.url?scp=0033164068&partnerID=8YFLogxK

U2 - 10.1137/S0895479897317077

DO - 10.1137/S0895479897317077

M3 - Article

AN - SCOPUS:0033164068

SN - 0895-4798

VL - 20

SP - 1083

EP - 1098

JO - SIAM Journal on Matrix Analysis and Applications

JF - SIAM Journal on Matrix Analysis and Applications

IS - 4

ER -

The BR Eigenvalue algorithm

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this