Two-Grid Finite Element Discretization Schemes Based on Shifted-Inverse Power Method for Elliptic Eigenvalue Problems

Yang, Yidu; Bi, Hai

doi:10.1137/100810241

Cited by 87 publications

(88 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Hence, it can be seen as a postprocessing technique and can take less CPU time compared to the one grid methods. To the best of our knowledge, some details of the two-grid scheme can be found in the works of Xu and Zhou [13], Chien and Jeng [14,15], Chen et al [7,16], Hu and Cheng [17], Yang et al [18,19], Huang et al [8], and Weng et al [20,21]. The two-space method is actually the iterative Galerkin method, which was first used for solving integral equation eigenvalue problems by Sloan [22] and differential equation eigenvalue problems by Lin and Xie [23].…”

Section: Introductionmentioning

confidence: 99%

An Efficient Algorithm with Stabilized Finite Element Method for the Stokes Eigenvalue Problem

Weng

Cai

2017

Mathematical Problems in Engineering

View full text Add to dashboard Cite

This paper provides a two-space stabilized mixed finite element scheme for the Stokes eigenvalue problem based on local Gauss integration. The two-space strategy contains solving one Stokes eigenvalue problem using the 1 − 1 finite element pair and then solving an additional Stokes problem using the 2 − 2 finite element pair. The postprocessing technique which increases the order of mixed finite element space by using the same mesh can accelerate the convergence rate of the eigenpair approximations. Moreover, our method can save a large amount of computational time and the corresponding convergence analysis is given. Finally, numerical results are presented to confirm the theoretical analysis.

show abstract

Section: Introductionmentioning

confidence: 99%

An Efficient Algorithm with Stabilized Finite Element Method for the Stokes Eigenvalue Problem

Weng

Cai

2017

Mathematical Problems in Engineering

View full text Add to dashboard Cite

show abstract

“…Furthermore, it also has been generalized to three-scale discretization [16] and multilevel discretization [24]. Recently, a new shifted-inverse power method based two-grid scheme was proposed in [21,43].To improve accuracy of eigenvalue approximation, many methods have been proposed. In [37], Shen and Zhou introduced a defect correction scheme based on averaging recovery, like a global L 2 projection and a Clément-type operator.…”

mentioning

confidence: 99%

mentioning

confidence: 99%

“…The first purpose is to introduce two superconvergent two-grid methods for eigenvalue problems. Our first algorithm is a combination of the shifted-inverse power based two-grid scheme [21,43] and polynomial preserving recovery enhancing technique [34]. It is worth to point out that the first algorithm can also be seen as post-processed two-grid scheme.…”

mentioning

confidence: 99%

“…Our method works for arbitrary domains and hence is more general. The second algorithm can be viewed as a combination of the two-grid scheme [21,43] and the two-space method [36,1]. It can be thought as a special hp method.…”

mentioning

confidence: 99%

See 2 more Smart Citations

Superconvergent Two-Grid Methods for Elliptic Eigenvalue Problems

2016

View full text Add to dashboard Cite

Abstract. Some numerical algorithms for elliptic eigenvalue problems are proposed, analyzed, and numerically tested. The methods combine advantages of the two-grid algorithm [J. Xu and A. Zhou, Math. Comp, 70(2001) To reduce the computational cost of eigenvalue problems, Xu and Zhou introduced a two-grid discretization scheme [42]. Later on, similar ideas were applied to non self-adjoint eigenvalue problems [22] and semilinear elliptic eigenvalue problems [11]. Furthermore, it also has been generalized to three-scale discretization [16] and multilevel discretization [24]. Recently, a new shifted-inverse power method based two-grid scheme was proposed in [21,43].To improve accuracy of eigenvalue approximation, many methods have been proposed. In [37], Shen and Zhou introduced a defect correction scheme based on averaging recovery, like a global L 2 projection and a Clément-type operator. In [34], Naga, Zhang, and Zhou used Polynomial Preserving Recovery to enhance eigenvalue approximation. In [40], Wu and Zhang further showed polynomial preserving recovery can even enhance eigenvalue approximation on adaptive meshes. The idea was further studied in [31,15]. Alternatively, Racheva and Andreev proposed a two-space method to achieve better eigenvalue approximation [36] and it was also applied to biharmonic eigenvalue problem [1].In this paper, we propose some fast and efficient solvers for elliptic eigenvalue problems. We combine ideas of the two-grid method, two-space method, shiftedinverse power method, and PPR recovery enhancement to design our new algorithms. The first purpose is to introduce two superconvergent two-grid methods for eigenvalue problems. Our first algorithm is a combination of the shifted-inverse power based two-

show abstract

A locking‐free shifted inverse iteration based on multigrid discretization for the elastic eigenvalue problem

Zhang

Yang

2021

Math Methods in App Sciences

Self Cite

View full text Add to dashboard Cite

show abstract

Two-Grid Finite Element Discretization Schemes Based on Shifted-Inverse Power Method for Elliptic Eigenvalue Problems

Cited by 87 publications

References 20 publications

An Efficient Algorithm with Stabilized Finite Element Method for the Stokes Eigenvalue Problem

An Efficient Algorithm with Stabilized Finite Element Method for the Stokes Eigenvalue Problem

Superconvergent Two-Grid Methods for Elliptic Eigenvalue Problems

A locking‐free shifted inverse iteration based on multigrid discretization for the elastic eigenvalue problem

Contact Info

Product

Resources

About