Home → Magazine Archive → January 1973 (Vol. 16, No. 1) → Reduction of a band-symmetric generalized eigenvalue... → Abstract

Reduction of a band-symmetric generalized eigenvalue problem

By C. R. Crawford

Communications of the ACM, Vol. 16 No. 1, Pages 41-44
10.1145/361932.361943


Save PDF
An algorithm is described for reducing the generalized eigenvalue problem Ax = &lgr;Bx to an ordinary problem, in case A and B are symmetric band matrices with B positive definite. If n is the order of the matrix and m the bandwidth, the matrices A and B are partitioned into m-by-m blocks; and the algorithm is described in terms of these blocks. The algorithm reduces the generalized problem to an ordinary eigenvalue problem for a symmetric band matrix C whose bandwidth is the same as A and B. The algorithm is similar to those of Rutishauser and Schwartz for the reduction of symmetric matrices to band form. The calculation of C requires order n2m operation. The round-off error in the calculation of C is of the same order as the sum of the errors at each of the n/m steps of the algorithm, the latter errors being largely determined by the condition of B with respect to inversion.

The full text of this article is premium content

0 Comments

No entries found