A substructuring preconditioner with vertex-related interface solvers for elliptic-type equations in three dimensions
- 68 Downloads
In this paper, we propose a variant of the substructuring preconditioner for solving three-dimensional elliptic-type equations with strongly discontinuous coefficients. In the proposed preconditioner, we use the simplest coarse solver associated with the finite element space induced by the coarse partition and construct inexact interface solvers based on overlapping domain decomposition with small overlaps. This new preconditioner has an important merit: its construction and efficiency do not depend on the concrete form of the considered elliptic-type equations. We apply the proposed preconditioner to solve the linear elasticity problems and Maxwell’s equations in three dimensions. Numerical results show that the convergence rate of PCG method with the preconditioner is nearly optimal, and also robust with respect to the (possibly large) jumps of the coefficients in the considered equations.
KeywordsDomain decomposition Substructuring preconditioner Linear elasticity problems Maxwell’s equations PCG iteration Convergence rate
Mathematics Subject Classification (2010)65N30 65N55
Unable to display preview. Download preview PDF.
- 10.Chen, X., Hu, Q.: Inexact solvers for saddle-point system arising from domain decomposition of linear elatcity problems in three dimensions. Int. J. Numer. Anal. Model. 8(1), p156–173 (2011)Google Scholar
- 14.Dohrmann, C., Widlund, O.: A BDDC Algorithm with Deluxe Scaling for Three-Dimensional H(curl) Problems, Comm. Pure Appl Math. https://doi.org/10.1002/cpa.21574 (2015)
- 19.Dubois, O., Gander, M.: Optimized Schwarz methods for a diffusion problem with discontinuous coefficient, to appear in Numerical AlgorithmsGoogle Scholar
- 31.Hu, Q., Shu, S., Zou, J.: A substructuring preconditioner of three-dimensional Maxwell’s equations. In: Bank, R., Holst, M., Widlund, O., Xu, J. (eds.) Domain Decomposition Methods in Science and Engineering XX (No. 91 in Lecture Notes in Computational Science and Engineering). Proceedings of the Twentieth International Conference on Domain Decomposition Methods, held at the University of California at San Diego, CA, February 9-13, 2011, pp. 73–84. Springer, Heidelberg-Berlin (2013)Google Scholar
- 35.Karypis, G.: METIS a Software Package for Partitioning Unstructured Graphs, Partitioning Meshes, and Computing Fill-Reducing Orderings of Sparse Matrices Version 5.1.0. University of Minnesota, Department of Computer Science and Engineering, Minneapolis, MN (2013)Google Scholar
- 43.Mandel, J., Dohrmann, C.: Convergence of a balancing domain decomposition by constraints and energy minimization, Numer Linear Algebra Appl. (2003)Google Scholar
- 47.Si, H.: TetGen, A Quality Tetrahedral Mesh Generator and 3D Delaunay Triangulator, Version 1.5.Google Scholar
- 55.Xu, J., Zou, J.: Some non-overlapping domain decomposition methods, SIAM Review, 24 (1998)Google Scholar