Thumbnail
Access Restriction
Subscribed

Author Appel, Klaus
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Abstract It is often desired to solve eigenvalue problems of the type (A - λ1)C = 0 or (A - λB)C = 0 repeatedly for similar values of the matrix elements Aij, where A and B are Hermitean or real symmetric matrices. Among the various methods to find all eigenvalues and eigenvectors, Jacobi's method of two-dimensional rotations [1] has been very popular for its numerical stability, although it is comparatively time-consuming. The purpose of this note is to show how existing subroutines can be used to reduce substantially the computing time, if approximate eigenvectors are known from the previous solution of a similar problem.
Description Affiliation: Univ. of Uppsala, Uppsala, Sweden (Appel, Klaus)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 5
Issue Number 7
Page Count 1
Starting Page 381
Ending Page 381


Open content in new tab

   Open content in new tab
Source: ACM Digital Library