.png){kind=icon}
.png){kind=icon}
Return
A full multigrid method for eigenvalue problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jcp.2016.07.009.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, a full (nested) multigrid scheme is proposed to solve eigenvalue problems. The idea here is to use a correction method to transform the eigenvalue problem solving to a series of corresponding boundary value problem solving and eigenvalue problems defined on a very low-dimensional finite element space. The boundary value problems which are defined on a sequence of multilevel finite element spaces can be solved by some multigrid iteration steps. The computational work of this new scheme can reach the same optimal order as solving the corresponding boundary value problem by the full multigrid method. Therefore, this type of full multigrid method improves the overfull efficiency of the eigenvalue problem solving. (C) 2016 Elsevier Inc. All rights reserved.
Keywords:
Eigenvalue problem
Full multigrid method
Multilevel correction
Finite element method
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.8
Papers:
1.5W
Citations:
7.4W
Organization
View more organizations