1996 Reports

Estimating a largest eigenvector by polynomial algorithms with a random start

Leyk, Z.; Wozniakowski, Henryk

In 7 and 8

the power and Lanczos algorithms with random start for estimating the largest eigenvalue of an n x n large symmetric positive definite matrix were analyzed.
In this paper we continue this study by estimating an eigenvector corresponding to the largest eigenvalue.
We analyze polynomial algorithms using Krylov information for two error criteria the randomized error and the randomized residual error.