Subspace iteration accelrated by using Chebyshev polynomials for eigenvalue problems with symmetric matrices
International Journal for Numerical Methods in Engineering1976Vol. 10(4), pp. 935–944
Citations Over Time
Abstract
Abstract 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.
Related Papers
- → Numerical solution of time-varying delay systems by Chebyshev wavelets(2011)60 cited
- → A note on orthogonal polynomials described by Chebyshev polynomials(2020)6 cited
- → Some Special Polynomials(1995)1 cited
- Selectivity Estimation on Synopses Based on Chebyshev Polynomials(2009)
- → Discrete polynomials orthogonal with respect Sobolev-type inner product associated with Chebyshev polynomials orthogonal on a uniform grid(2015)