A projection method for computing the minimum eigenvalue of a symmetric positive definite Toeplitz matrix
โ Scribed by Wolfgang Mackens; Heinrich Voss
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 773 KB
- Volume
- 275-276
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
โฆ Synopsis
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. Randomly generated test problems up to dimension 1024 demonstrate the methods good global behaviour.
๐ SIMILAR VOLUMES
Let A be a positive definite, symmetric matrix. We wish to determine the largest eigenvalue, 1,. We consider the power method, i.e. that of choosing a vector v. and setting vk = Akvo; then the Rayleigh quotients Rk = (Auk, vk)/( ok, ok) usually converge to 21 as k -+ 03 (here (u, v) denotes their in