A geometric convergence theory for the preconditioned steepest descent iteration

Details A geometric convergence theory for the preconditioned steepest descent iteration A geometric convergence theory for the preconditioned steepest descent iteration

2011-08-11

arxiv.org/abs/1108.2365v1

Mathematics

Numerical Analysis

17 pages, 6 figures

Scientific paper

Preconditioned gradient iterations for very large eigenvalue problems are efficient solvers with growing popularity. However, only for the simplest preconditioned eigensolver, namely the preconditioned gradient iteration (or preconditioned inverse iteration) with fixed step size, sharp non-asymptotic convergence estimates are known and these estimates require an ideally scaled preconditioner. In this paper a new sharp convergence estimate is derived for the preconditioned steepest descent iteration which combines the preconditioned gradient iteration with the Rayleigh-Ritz procedure for optimal line search convergence acceleration. The new estimate always improves that of the fixed step size iteration. The practical importance of this new estimate is that arbitrarily scaled preconditioners can be used. The Rayleigh-Ritz procedure implicitly computes the optimal scaling.

Affiliated with

Also associated with

No associations

Rating

A geometric convergence theory for the preconditioned steepest descent iteration does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A geometric convergence theory for the preconditioned steepest descent iteration, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A geometric convergence theory for the preconditioned steepest descent iteration will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-275836