Randomized error estimation for eigenvalue approximation

Calcolo

Volumn 37, Issue 1, 2000, Pages 21-46

  Del Corso, G M ^a  

^a CNR Consiglio Nazionale delle Ricerche   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ERRORS; MATRIX ALGEBRA; NUMBER THEORY;

EIGENVALUE APPROXIMATIONS; EIGENVALUE ESTIMATIONS; EIGENVALUES AND EIGENVECTORS; EIGENVECTOR ESTIMATION; NORMAL MATRIX; PAPER ANALYSIS; POSITIVE-DEFINITE MATRICES; POWERS METHOD; RANDOMIZED ALGORITHMS; REAL SYMMETRIC MATRIX;

EIGENVALUES AND EIGENFUNCTIONS;

EID: 24944474509     PISSN: 00080624     EISSN: None     Source Type: Journal    
DOI: 10.1007/s100920050002     Document Type: Article

References (21)

1. Del Corso, G.M.: Estimating an eigenvector by the power method with a random start. SIAM J. Matrix Anal. Appl. 18(4), 913-937 (1997)
2. Del Corso, G.M., Manzini, G.: On the randomized error of polynomial methods for eigenvector and eigenvalue estimates. J. Complexity 13, 419-456 (1997)
3. Del Corso, G.M., Manzini, G.: On the randomized error of polynomial methods for eigenvector and eigenvalue estimates: Numerical tests. Technical Report B4-97-01. Pisa: Istituto di Matematica Computazionale, CNR 1997
4. Dixon, J.D.: Estimating extremal eigenvalues and condition numbers of matrices. SIAM J. Numer. Anal. 20, 812-814 (1983)
5. Golub, G.H., Van Loan, C.F.: Matrix Computations. Baltimore: Johns Hopkins University Press 1989
6. Gradshteyn, I.S., Ryzhik, I.M.: Table of integrals, series, and products. Fifth edition. Boston: Academic Press 1994
7. Kahan, W., Parlett, B.N.: How far should you go with Lanczos process? In: Bunch, J.R., Rose, D.,J. (eds.): Sparse matrix computations., New York: Academic Press 1976, pp. 131-144
8. Kaniel, S.: Estimates for some computational techniques in linear algebra. Math. Comp. 20, 369-378 (1966)
9. Kostlan, E.: Complexity theory of numerical linear algebra. J. Comput. Appl. Math. 22, 219-230 (1988)
10. Kostlan, E.: Statistical complexity of dominant eigenvector calculation. J. Complexity 7, 371-379 (1991)
11. Kuczyński, J., Woźniakowski, H.: Estimating the largest eigenvalue by the power and Lanczos algorithms with a random start. SIAM J. Matrix Anal. Appl. 13, 1094-1122 (1992)
12. Kuczyński, J., Woźniakowski, H.: Probabilistic bounds on the extremal eigenvalues and condition number by the Lanczos algorithm. SIAM J. Matrix Anal. Appl. 15, 672-691 (1994)
13. Leyk, Z., Woźniakowski, H.: Estimating a largest eigenvector by Lanczos and polynomial algorithms with a random start. Numer. Linear Algebra Appl. 5(3), 147-164 (1998)
14. Paige, C.C.: Computational variants of the Lanczos method for the eigenproblem. J. Inst. Math. Appl. 10, 373-381 (1972)
15. Parlett, B.N.: The symmetric eigenvalue problem. Englewood Cliffs: Prentice-Hall 1980
16. Saad, Y.: On the rates of convergence of the Lanczos and the block-Lanczos methods. SIAM J. Numer. Anal. 17, 687-706 (1980)
17. Saad, Y.: Numerical methods for large eigenvalue problems. Manchester: Manchester University Press 1992
18. Shub, M.: The geometry and topology of dynamical systems and algorithms for numerical problems. In: Liao Shantao, Chern, S.S. (eds): Proc. of the 1983 Beijing symposium on differential geometry and differential equations. Beijing: Science Press 1986
19. Traub, J.F., Wasilkowski, G.W., Woźniakowski, H.: Information-based complexity. Boston: Academic Press 1988
20. Wilkinson, J.H.: The algebraic eigenvalue problem. Oxford: Clarendon Press 1965
21. Wright, P.E.: Statistical complexity of the power method for Markov chains. J. Complexity 5, 119-143 (1989)