A full multigrid method for nonlinear eigenvalue problems

From MaRDI portal
Publication:341406

DOI10.1007/S11425-015-0234-XzbMATH Open1354.65236arXiv1502.04657OpenAlexW3098469295MaRDI QIDQ341406FDOQ341406


Authors: ShangHui Jia, Hehu Xie, ManTing Xie, Fei Xu Edit this on Wikidata


Publication date: 16 November 2016

Published in: Science China. Mathematics (Search for Journal in Brave)

Abstract: This paper is to introduce a type of full multigrid method for the nonlinear eigenvalue problem. The main idea is to transform the solution of nonlinear eigenvalue problem into a series of solutions of the corresponding linear boundary value problems on the sequence of finite element spaces and nonlinear eigenvalue problems on the coarsest finite element space. The linearized boundary value problems are solved by some multigrid iterations. Besides the multigrid iteration, all other efficient iteration methods for solving boundary value problems can serve as the linear problem solver. We will prove that the computational work of this new scheme is truly optimal, the same as solving the linear corresponding boundary value problem. In this case, this type of iteration scheme certainly improves the overfull efficiency of solving nonlinear eigenvalue problems. Some numerical experiments are presented to validate the efficiency of the new method.


Full work available at URL: https://arxiv.org/abs/1502.04657




Recommendations




Cites Work


Cited In (40)





This page was built for publication: A full multigrid method for nonlinear eigenvalue problems

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