Probabilistic Bounds on the Extremal Eigenvalues and Condition Number by the Lanczos Algorithm

Authors:
  • JKJ. Kuczyński
    J. Kuczyński
  • HWH. Woźniakowski
    H. Woźniakowski

Abstract
The authors analyze the Lanczos algorithm with a random start for approximating the extremal eigenvalues of a symmetric positive definite matrix. They present some bounds on the Lebesgue measure (probability) of the sets of these starting vectors for which the Lanczos algorithm gives at the kth step satisfactory approximations to the largest and smallest eigenvalues. Combining these bounds gets similar estimates for the condition number of a matrix.

This publication has 8 references indexed in Scilit: