A domain decomposition preconditioner for \(p\)-FEM discretizations of two-dimensional elliptic problems (Q2487960): Difference between revisions

The paper is devoted to the \(p\)-version of the finite element method (FEM) for solving uniformly elliptic 2D boundary value problems in a domain \( \Omega ,\) decomposed into quadrilaterals \(R_{s},s=1,\dots,n_{i}\). The finite element space is \(M:=\{u\in H_{0}^{1}(\Omega ),u\circ \Phi _{s}| _{R_{s}}\in Q_{p}\}\), where \(Q_{p}=\{x^{i},y^{j}\}_{i,j=0}^{p}\), \(\Phi _{s}:\Re _{2}\longrightarrow R_{s}\), \(\Re _{2}=(-1,1)^{2}\) is the reference element. The Galerkin projection of the considered Dirichlet problem leads to the system of the linear FE equations \(Au_{p}=f_{p},\) where \(A\)\ is \(3\times 3\) block diagonal matrix. An inexact domain-decomposition preconditioner for it is proposed, which includes a preconditioner for \(A_{i}= \text{blockdiag}[A_{R_{s}}]{_{s=1}^{n_{i}}}\sim \text{blockdiag}[A_{\Re _{2}}],\) a preconditioner for the Schur complement and an extension operator from the edges of the quadrilateral into its interior. Multigrid and wavelet preconditioners for \(A_{i}\) are proposed, investigated, tested numerically and compared. The speed-up and the efficiency of the parallelized solving procedure on a parallel computer with 1,2,4,8,16,32 processors is measured and shown.