In this paper, we construct a new parallel preconditioner, combining auxiliary space preconditioner(HX preconditioner) with nonoverlapping domain decomposition method, for solving the linear edge finite element discretization of H(curl) elliptic problem. We design the parallel algorithm in detail and make the parallel program based on MPI+OpenMP. Numerical experiment show that the corresponding PCG method has good algorithm scalability and parallel scalability.
. AN EFFICIENT PARALLEL PRECONDITIONER FOR SOLVING H(curl) ELLIPTIC PROBLEM AND PARALLEL IMPLEMENTATION[J]. Journal of Numerical Methods and Computer Applicat, 2012, (1): 48-58.
Falgout R D, Baker A, Chow E, Henson VE, Hill E, Jones J, Kolev T, Lee B, Painter J,Tong C and others. HYPRE: High performance preconditioner[OL]. https://computation.llnl.gov/casc/hypre/software.html.
Hiptmair R and Xu J. Nodal Auxiliary Space Preconditioning in H(curl) and H(div) spaces[J].SIAM J. Numer. Anal., 2007, 45: 2483-2509.
Hu Q, Shu S andWang J. Nonoverlapping Domain Decomposition Methods with Simplified CoarseSpaces for Solving Three-dimensional Elliptic Problems[J]. Math. Comp., 2010, 79(272): 2059-2078.
Hu Q and Zou J. A Non-overlapping Domain Decomposition Method for Maxwell’s Equations inThreee Dimensions[J]. SIAM J. Numer. Anal., 2003, 41: 1682-1708.
Hu Q and Zou J. Substructuring Preconditioners for Saddle-Point Problems Arising fromMaxwell’s Equations in Three Dimensions[J]. Math. Comp., 2004, 73: 35-61.
Toselli A. Dual-primal FETI algorithms for edge element approximations: three dimensional hfinite elements on shape-regular meshes[J]. IMA J. Numer. Anal., 2006, 73: 96-130.
Wang J, Shu S and Zhong L. Efficient parallel preconditioners for high-order finite element dis-cretizations of two kinds of H(D) elliptic problems[C]. Domain Decomposition Methods in Scienceand Engineering XIX Lecture Notes in Computational Science and Engineering, 2011, Volume 78,Part 2, 325-332.