A Domain Decomposition Method for Nonconforming Finite Element Approximations of Eigenvalue Problems

Abstract

Since the nonconforming finite elements (NFEs) play a significant role in approximating PDE eigenvalues from below, this paper develops a new and parallel two-level preconditioned Jacobi-Davidson (PJD) method for solving the large scale discrete eigenvalue problems resulting from NFE discretization of 2mth $(m=1,2)$ order elliptic eigenvalue problems. Combining a spectral projection on the coarse space and an overlapping domain decomposition (DD), a parallel preconditioned system can be solved in each iteration. A rigorous analysis reveals that the convergence rate of our two-level PJD method is optimal and scalable. Numerical results supporting our theory are given.

Keywords

PDE eigenvalue problems / Nonconforming finite elements (NFEs) / Preconditioned Jacobi-Davidson (PJD) method / Overlapping domain decomposition (DD) / 65N30 / 65N55

References

[1] Adams, R.: Sobolev Spaces, Pure and Applied Mathematics, vol. 65. Academic Press [Harcourt Brace Jovanovich, Publishers], New York (1975)

[2] Babuška I, Osborn J. Finite element-Galerkin approximation of the eigenvalues and eigenvectors of selfadjoint problems. Math. Comput.. 1989, 52(186): 275-297

[3] Boffi D. Finite element approximation of eigenvalue problems. Acta Numer.. 2010, 19: 1-120

[4] Brenner S. A two-level additive Schwarz preconditioner for nonconforming plate elements. Numer. Math.. 1996, 72(4): 419-447

[5] Brenner S. Two-level additive Schwarz preconditioners for nonconforming finite element methods. Math. Comput.. 1996, 65(215): 897-921

[6] Chen H, Xie H, Fei X. A full multigrid method for eigenvalue problems. J. Comput. Phys.. 2016, 322: 747-759

[7] Evans, L.: Partial Differential Equations, 2nd edn, vol. 19. American Mathematical Society, Providence (2010)

[8] Hu J, Huang Y. The correction operator for the canonical interpolation operator of the Adini element and the lower bounds of eigenvalues. Sci. China Math.. 2012, 55(1): 187-196

[9] Hu J, Huang Y, Lin Q. Lower bounds for eigenvalues of elliptic operators: by nonconforming finite element methods. J. Sci. Comput.. 2014, 61(1): 196-221

[10] Hu J, Huang Y, Shen Q. The lower/upper bound property of approximate eigenvalues by nonconforming finite element methods for elliptic operators. J. Sci. Comput.. 2014, 58(3): 574-591

[11] Hu J, Huang Y, Shen Q. Constructing both lower and upper bounds for the eigenvalues of elliptic operators by nonconforming finite element methods. Numer. Math.. 2015, 131(2): 273-302

[12] Liang, Q., Wang, W., Xu, X.: A two-level block preconditioned Jacobi-Davidson method for multiple and clustered eigenvalues of elliptic operators. arxiv: 2203.06327 (2023)

[13] Rannacher R. Nonconforming finite element methods for eigenvalue problems in linear plate theory. Numer. Math.. 1979, 33(1): 23-42

[14] Sarkis, M.: Partition of unity coarse spaces and Schwarz methods with harmonic overlap. In: Recent Developments in Domain Decomposition Methods, pp. 77–94. Springer, Berlin, Heidelberg (2002)

[15] Sleijpen GLG, Van der Vorst HA. A Jacobi-Davidson iteration method for linear eigenvalue problems. SIAM Rev.. 2000, 42(2): 267-293

[16] Toselli, A., Widlund, O.: Domain decomposition methods-algorithms and theory. In: Springer Series in Computational Mathematics, vol. 34, Springer, Berlin, Heidelberg (2005)

[17] Wang W, Xu XJ. A two-level overlapping hybrid domain decomposition method for eigenvalue problems. SIAM J. Numer. Anal.. 2018, 56(1): 344-368

[18] Wang W, Xu XJ. On the convergence of a two-level preconditioned Jacobi-Davidson method for eigenvalue problems. Math. Comput.. 2019, 88(319): 2295-2324

[19] Xie H. A multigrid method for eigenvalue problem. J. Comput. Phys.. 2014, 274: 550-561

[20] Xie H. A type of multilevel method for the Steklov eigenvalue problem. IMA J. Numer. Anal.. 2014, 34(2): 592-608

[21] Xu F, Xie H, Zhang N. A parallel augmented subspace method for eigenvalue problems. SIAM J. Sci. Comput.. 2020, 42(5): A2655-A2677

[22] Xu J, Zhou A. A two-grid discretization scheme for eigenvalue problems. Math. Comput.. 2001, 70(233): 17-25

[23] Yang Y. A posteriori error estimates in Adini finite element for eigenvalue problems. J. Comput. Math.. 2000, 18: 413-418

[24] Yang Y. Two-grid discretization schemes of the nonconforming FEM for eigenvalue problems. J. Comput. Math.. 2009, 27(6): 748-763

[25] Yang Y, Bi H. Two-grid finite element discretization schemes based on shifted-inverse power method for elliptic eigenvalue problems. SIAM J. Numer. Anal.. 2011, 49(4): 1602-1624

[26] Yang Y, Bi H, Han J, Yu Y. The shifted-inverse iteration based on the multigrid discretizations for eigenvalue problems. SIAM J. Sci. Comput.. 2015, 37(6): A2583-A2606

[27] Yang Y, Lin Q, Bi H, Li Q. Eigenvalue approximations from below using Morley elements. Adv. Comput. Math.. 2012, 36(3): 443-450

[28] Yang Y, Zhang Z, Lin F. Eigenvalue approximation from below using non-conforming finite elements. Sci. China Math.. 2010, 53(1): 137-150

[29] Zhai Q, Xie H, Zhang R, Zhang Z. Acceleration of weak Galerkin methods for the Laplacian eigenvalue problem. J. Sci. Comput.. 2019, 79(2): 914-934

[30] Zhao, T., Hwang, F.-N., Cai, X.-C.: A domain decomposition based Jacobi-Davidson algorithm for quantum dot simulation. In: Domain Decomposition Methods in Science and Engineering XXII, pp. 415–423. Springer, New York (2016)

[31] Zhao T, Hwang F-N, Cai X-C. Parallel two-level domain decomposition based Jacobi-Davidson algorithms for pyramidal quantum dot simulation. Comput. Phys. Commun.. 2016, 204: 74-81

RIGHTS & PERMISSIONS

Shanghai University