Premium
Subspace iteration accelrated by using Chebyshev polynomials for eigenvalue problems with symmetric matrices
Author(s) -
Yamamoto Yoshiyuki,
Ohtsubo Hideomi
Publication year - 1976
Publication title -
international journal for numerical methods in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.421
H-Index - 168
eISSN - 1097-0207
pISSN - 0029-5981
DOI - 10.1002/nme.1620100418
Subject(s) - mathematics , chebyshev polynomials , eigenvalues and eigenvectors , subspace topology , acceleration , rate of convergence , convergence (economics) , chebyshev filter , chebyshev iteration , orthogonal polynomials , mathematical analysis , computer science , physics , computer network , channel (broadcasting) , classical mechanics , quantum mechanics , economics , economic growth
Bathe's algorithm of subspace iteration for the solution of the eigenvalue problem with symmetric matrices is improved by incorporating an acceleration technique using Chebyshev polynomials. This method of acceleration is particularly effective for this kind of iteration. The rate of convergence of the iteration scheme presented is considerably improved when compared with the original one, and satisfactory rates of convergence can be obtained for a wider range of eigenvalues.