Adaptive Eigenvalue Computation - Complexity Estimates

Details Adaptive Eigenvalue Computation - Complexity Estimates Adaptive Eigenvalue Computation - Complexity Estimates

2007-11-07

arxiv.org/abs/0711.1070v1

Mathematics

Numerical Analysis

submitted to Math. Comp

Scientific paper

This paper is concerned with the design and analysis of a fully adaptive eigenvalue solver for linear symmetric operators. After transforming the original problem into an equivalent one formulated on $\ell_2$, the space of square summable sequences, the problem becomes sufficiently well conditioned so that a gradient type iteration can be shown to reduce the error by some fixed factor per step. It then remains to realize these (ideal) iterations within suitable dynamically updated error tolerances. It is shown under which circumstances the adaptive scheme exhibits in some sense asymptotically optimal complexity.

Affiliated with

Also associated with

No associations

Rating

Adaptive Eigenvalue Computation - Complexity Estimates 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 Adaptive Eigenvalue Computation - Complexity Estimates, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Adaptive Eigenvalue Computation - Complexity Estimates will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-502542