Estimating an eigenvector by the power method with a random start

SIAM Journal on Matrix Analysis and Applications

Volumn 18, Issue 4, 1997, Pages 913-937

  Del Corso, Gianna M ^a  

^a CNR   (Italy)

Author keywords

Eigenvectors; Power method; Random start; Randomized error

Indexed keywords

EID: 0031493847     PISSN: 08954798     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895479895296689     Document Type: Article

References (10)

1. I. S. GRADSHTEYN AND I. M. RYZHIK, Table of Integrals, Series, and Products, Academic Press, New York, 1994.
2. E. KOSTLAN, Complexity theory for numerical linear algebra, J. Comput. Appl. Math., 22 (1988), pp. 219-230.
3. E. KOSTLAN, Statistical complexity of dominant eigenvector calculation, J. Complexity, 7 (1991), pp. 371-379.
4. J. KUCZYŃSKI AND H. WOŹNIAKOWSKI, Estimating the largest eigenvalue by the power and Lanczos algorithms with a random start, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 1094-1122.
5. J. KUCZYŃSKI AND H. WOŹNIAKOWSKI, Probabilistic bounds on the extremal eigenvalues and condition number by the Lanczos algorithm, SIAM J. Matrix Anal. Appl., 15 (1994), pp. 672-691.
6. S. LANG, Analysis II, Addison-Wesley, Reading, MA, 1969.
7. B. N. PARLETT, The Symmetric Eigenvalue Problem, Prentice-Hall, Englewood Cliffs, NJ, 1980.
8. M. SHUB, The geometry and topology of dynamical systems and algorithms for numerical problems, in Proc. of the 1983 Beijing Symposium on Differential Geometry and Differential Equations, Liao Shantao, ed., Science Press, Beijing, China, 1986.
9. J. H. WILKINSON, The Algebraic Eigenvalue Problem, Oxford University Press, London, 1965.
10. P. E. WRIGHT, Statistical complexity of the power method for Markov chains, J. Complexity, 5 (1989), pp. 119-143.