In this paper, we consider the Galerkin and collocation methods for the eigenvalue problem of a compact integral operator with a smooth kernel using the Legendre polynomials of degree β€ n. We prove that the error bounds for eigenvalues are of the order O(n -2r ) and the gap between the spectral subs
A projection method for the computation of inner eigenvalues using high degree rational operators
β Scribed by W. Hackbusch; W. Kress
- Publisher
- Springer Vienna
- Year
- 2007
- Tongue
- English
- Weight
- 186 KB
- Volume
- 81
- Category
- Article
- ISSN
- 0010-485X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A projection method for computing the minimal eigenvalue of a symmetric and positive definite Toeplitz matrix is presented. It generalizes and accelerates the algorithm considered in [12] (W. Mackens, H. Voss, SIAM J. Matrix Anal. Appl. 18 (1997) Q-534). Global and cubic convergence is proved. Rand
Use of the spline function in Milne's method for eigenvalue problems of Sturm-Liouville-type linear equations is found to provide a high-speed method for calculating eigenvalues.
The Ewald method is applied to accelerate the evaluation of the Green's function (GF) of an infinite equispaced linear array of point sources with linear phasing. Only a few terms are needed to evaluate Ewald sums, which are cast in terms of error functions and exponential integrals, to high accurac