SearcharxivSearch

arXiv subjects

Shuhai Zhao

Publications and source records attributed to Shuhai Zhao.

4 recordsLinked to original sources

Preconditioned Reconstructed Discontinuous Approximation For Elliptic Interface Problem on Unfitted Mesh

In this paper, we develop an efficient preconditioned unfitted finite element method for the elliptic interface problem, based on the reconstructed discontinuous approximation. The key idea is to impose suitable constraints on the local least squares reconstruction. These constraints ensure the stability near cut interface elements and, more importantly, establish a norm equivalence between the high-order space and the lowest-order piecewise constant space. This result allows us to construct an optimal preconditioner directly from the lowest-order system on the same unfitted mesh for any high-order scheme. The resulting method combines a cut discontinuous Galerkin formulation with Nitsche's penalty technique. The approximation space achieves arbitrarily high order accuracy with only one degree of freedom per element. We prove optimal error estimates and show that the condition number of the preconditioned system is uniformly bounded independently of the mesh size, coefficient contrast, and the location of the interface relative to the mesh. Multigrid algorithms are further designed to efficiently approximate the inverse of the lowest-order system matrix. Numerical experiments in two and three dimensions confirm the optimal convergence rates and demonstrate the robustness and efficiency of the proposed preconditioning method.

math.NA

An Efficient Solver to Helmholtz Equations by Recontruction Discontinuous Approximation

In this paper, an efficient solver for the Helmholtz equation using a noval approximation space is developed. The ingradients of the method include the approximation space recently proposed, a discontinuous Galerkin scheme extensively used, and a linear system solver with a natural preconditioner. Comparing to traditional discontinuous Galerkin methods, we refer to the new method as being more efficient in the following sense. The numerical performance of the new method shows that: 1) much less error can be reached using the same degrees of freedom; 2) the sparse matrix therein has much fewer nonzero entries so that both the storage space and the solution time cost for the iterative solver are reduced; 3) the preconditioner is proved to be optimal with respect to the mesh size in the absorbing case. Such advantage becomes more pronounced as the approximation order increases.

math.NA

A Finite Element Method by Patch Reconstruction for the Quad-Curl Problem Using Mixed Formulations

We develop a high order reconstructed discontinuous approximation (RDA) method for solving a mixed formulation of the quad-curl problem in two and three dimensions. This mixed formulation is established by adding an auxiliary variable to control the divergence of the field. The approximation space for the original variables is constructed by patch reconstruction with exactly one degree of freedom per element in each dimension and the auxiliary variable is approximated by the piecewise constant space. We prove the optimal convergence rate under the energy norm and also suboptimal $L^2$ convergence using a duality approach. Numerical results are provided to verify the theoretical analysis.

math.NA

An arbitrary order Reconstructed Discontinuous Approximation to Fourth-order Curl Problem

We present an arbitrary order discontinuous Galerkin finite element method for solving the fourth-order curl problem using a reconstructed discontinuous approximation method. It is based on an arbitrarily high-order approximation space with one unknown per element in each dimension. The discrete problem is based on the symmetric IPDG method. We prove a priori error estimates under the energy norm and the L^2 norm and show numerical results to verify the theoretical analysis.

math.NA