arXiv Analytics

Sign in

arXiv:1409.7944 [math.NA]AbstractReferencesReviewsResources

A Full Multigrid Method for Eigenvalue Problems

Hehu Xie

Published 2014-09-28Version 1

In this paper, a full (nested) multigrid scheme is proposed to solve eigenvalue problems. The idea here is to use the multilevel correction method to transform the solution of eigenvalue problem to a series of solutions of the corresponding boundary value problems and eigenvalue problems defined on the coarsest finite element space. The boundary value problems which are define on a sequence of multilevel finite element space can be solved by some multigrid iteration steps. Besides the multigrid iteration, all other efficient iteration methods for solving boundary value problems can serve as linear problem solver. The computational work of this new scheme can reach optimal order the same as solving the corresponding source problem. Therefore, this type of iteration scheme improves the efficiency of eigenvalue problem solving.

Comments: 14vpages and 6 figures. arXiv admin note: substantial text overlap with arXiv:1409.2923, arXiv:1401.5378
Categories: math.NA
Subjects: 65N30, 65N25, 65L15, 65B99
Related articles: Most relevant | Search more
arXiv:1409.2923 [math.NA] (Published 2014-09-09)
A Cascadic Multigrid Method for Eigenvalue Problem
arXiv:2410.13358 [math.NA] (Published 2024-10-17)
Subspace method based on neural networks for eigenvalue problems
arXiv:1611.05677 [math.NA] (Published 2016-11-17)
A Full Multigrid Method For Semilinear Elliptic Equation