A convergence proof of an iterative subspace method for eigenvalues problems

From MaRDI portal





A bound on the rate of convergence for Davidson type algorithms is given. Theoretical results proving convergence rates are shown. The use of multigrid as a preconditioner for the iterative subspace method and the advantages of implicit restarts are investigated. A new algorithm for calculating some other eigenvalues and their eigenvectors is described. For the entire collection see [Zbl 0857.00037].











This page was built for publication: A convergence proof of an iterative subspace method for eigenvalues problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4336111)