- Journal Home
- Volume 21 - 2024
- Volume 20 - 2023
- Volume 19 - 2022
- Volume 18 - 2021
- Volume 17 - 2020
- Volume 16 - 2019
- Volume 15 - 2018
- Volume 14 - 2017
- Volume 13 - 2016
- Volume 12 - 2015
- Volume 11 - 2014
- Volume 10 - 2013
- Volume 9 - 2012
- Volume 8 - 2011
- Volume 7 - 2010
- Volume 6 - 2009
- Volume 5 - 2008
- Volume 4 - 2007
- Volume 3 - 2006
- Volume 2 - 2005
- Volume 1 - 2004
Cited by
- BibTex
- RIS
- TXT
In this paper, we propose a type of adaptive multigrid method for eigenvalue problem based on the multilevel correction method and adaptive multigrid method. Different from the standard adaptive finite element method applied to eigenvalue problem, with our method we only need to solve a linear boundary value problem on each adaptive space and then correct the approximate solution by solving a low dimensional eigenvalue problem. Further, the involved boundary value problems are solved by some adaptive multigrid iteration steps. The proposed adaptive algorithm can reach the same accuracy as the standard adaptive finite element method for eigenvalue problem but evidently reduces the computational work. In addition, the corresponding convergence and optimal complexity analysis are derived theoretically and numerically, respectively.
}, issn = {2617-8710}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/ijnam/20346.html} }In this paper, we propose a type of adaptive multigrid method for eigenvalue problem based on the multilevel correction method and adaptive multigrid method. Different from the standard adaptive finite element method applied to eigenvalue problem, with our method we only need to solve a linear boundary value problem on each adaptive space and then correct the approximate solution by solving a low dimensional eigenvalue problem. Further, the involved boundary value problems are solved by some adaptive multigrid iteration steps. The proposed adaptive algorithm can reach the same accuracy as the standard adaptive finite element method for eigenvalue problem but evidently reduces the computational work. In addition, the corresponding convergence and optimal complexity analysis are derived theoretically and numerically, respectively.