Searcharxiv⌕ Search

arXiv subjects

Weifeng Qiu

Publications and source records attributed to Weifeng Qiu.

At least 19 recordsLinked to original sources
arXiv2026

An Interface Green's Function Framework for Complete Discrete $W^{1,\infty}$ Analysis of Discontinuous Galerkin Methods

Pointwise error analysis of discontinuous Galerkin (DG) methods for the Poisson equation has received considerable attention during the past two decades. However, on convex polyhedral domains, existing analyses can only establish optimal error estimates in the broken $W^{1,\infty}$ seminorm for several DG methods. Since the broken $W^{1,\infty}$ seminorm does not control discontinuities across mesh interfaces, a complete discrete $W^{1,\infty}$ theory for discontinuous approximations on convex polyhedral domains has remained unavailable. In this paper, we develop an interface Green's function framework for the complete discrete $W^{1,\infty}$ analysis of DG methods on convex polyhedral domains. The proposed framework introduces new interface Green's functions that represent jumps of discontinuous approximations across mesh interfaces. Its central analytical ingredient is a new local energy estimate for these Green's functions, obtained by exploiting a cancellation between neighboring discrete delta functions. This estimate differs fundamentally from existing Green's function estimates and enables us to derive maximum-norm estimate for interface jumps without introducing additional logarithmic factors.

math.NA↗
arXiv2026

A unified analysis of maximum-norm estimates for a class of HDG methods for parabolic problem in polyhedral domains

This paper studies a general class of semi-discrete hybridizable discontinuous Galerkin (HDG) methods, including mixed methods, for parabolic problems in nonconvex polygonal and polyhedral domains. By developing local energy error estimates together with energy estimates for a regularized Green's function, we establish a unified framework to prove the maximum-norm stability of both the semigroup defined by the semi-discrete scheme and the corresponding discrete solutions. The stability analysis shows that the main challenges stem from the treatment of numerical flux variables and the inherent asymmetry of the discrete scheme. These challenges are intrinsic to numerical approaches formulated within the mixed framework for parabolic equations. The asymmetry prevents the direct application of the double kick-back argument, while the presence of flux variables requires special techniques to control their values at the initial time. We emphasize that the analytical tools developed here to address these challenges are sufficiently general to be adapted for maximum-norm stability investigations of a broader class of numerical schemes arising from mixed formulations of parabolic equations. Furthermore, by the stability results and their proofs, we derive the maximal regularity of the semi-discrete solution in $L^{\infty}((0,T);L^p(\Omega))$-norm and reduce the maximum-norm error estimates to those of the corresponding elliptic equations and the $L^2$-orthogonal projection. Since the derivation of the local energy error estimates does not rely on the lifting operator, which is only available for simplicial meshes, our results (excluding mixed methods) remain valid for polygonal/polyhedral meshes.

math.NA↗
arXiv2025

Analysis of a finite element method for second order uniformly elliptic PDEs in non-divergence form

We propose one finite element method for both second order linear uniformly elliptic PDE in non-divergence form and the uniformly elliptic Hamilton-Jacobi-Bellman (HJB) equation. For both linear elliptic PDE in non-divergence form and the HJB equation, we prove the well-posedness of strong solution in $W^{2,p}(\Omega)$ and optimal convergence in discrete $W^{2,p}$-norm of the finite element approximation to the strong solution for $1<p\leq 2$ on convex polyhedra in $\mathbb{R}^{d}$ ($d=2,3$). If the domain is a two dimensional non-convex polygon, $p$ is valid in a more restricted region. Furthermore, we relax the assumptions on the continuity of coefficients of the HJB equation, which have been widely used in literature.

math.NA↗
arXiv2025

Optimal convergence of the arbitrary Lagrangian-Eulerian interface tracking method for two-phase Navier--Stokes flow without surface tension

Optimal-order convergence in the $H^1$ norm is proved for an arbitrary Lagrangian-Eulerian interface tracking finite element method for the sharp interface model of two-phase Navier-Stokes flow without surface tension, using high-order curved evolving mesh. In this method, the interfacial mesh points move with the fluid's velocity to track the sharp interface between two phases of the fluid, and the interior mesh points move according to a harmonic extension of the interface velocity. The error of the semidiscrete arbitrary Lagrangian-Eulerian interface tracking finite element method is shown to be $O(h^k)$ in the $L^\infty(0, T; H^1(Ω))$ norm for the Taylor-Hood finite elements of degree $k \ge 2$. This high-order convergence is achieved by utilizing the piecewise smoothness of the solution on each subdomain occupied by one phase of the fluid, relying on a low global regularity on the entire moving domain. Numerical experiments illustrate and complement the theoretical results.

math.NA↗
arXiv2023

Spectral analysis of a mixed method for linear elasticity

The purpose of this paper is to analyze a mixed method for linear elasticity eigenvalue problem, which approximates numerically the stress, displacement, and rotation, by piecewise $(k+1)$, $k$ and $(k+1)$-th degree polynomial functions ($k\geq 1$), respectively. The numerical eigenfunction of stress is symmetric. By the discrete $H^1$-stability of numerical displacement, we prove an $O(h^{k+2})$ approximation to the $L^{2}$-orthogonal projection of the eigenspace of exact displacement for the eigenvalue problem, with proper regularity assumption. Thus via postprocessing, we obtain a better approximation to the eigenspace of exact displacement for the eigenproblem than conventional methods. We also prove that numerical approximation to the eigenfunction of stress is locking free with respect to Poisson ratio. We introduce a hybridization to reduce the mixed method to a condensed eigenproblem and prove an $O(h^2)$ initial approximation (independent of the inverse of the elasticity operator) of the eigenvalue for the nonlinear eigenproblem by using the discrete $H^1$-stability of numerical displacement, while only an $O(h)$ approximation can be obtained if we use the traditional inf-sup condition. Finally, we report some numerical experiments.

math.NA↗
arXiv2023

New analysis of Mixed finite element methods for incompressible Magnetohydrodynamics

The paper focuses on a new error analysis of a class of mixed FEMs for stationary incompressible magnetohydrodynamics with the standard inf-sup stable velocity-pressure space pairs to Navier-Stokes equations and the Nédélec's edge element for the magnetic field. The methods have been widely used in various numerical simulations in the last several decades, while the existing analysis is not optimal due to the strong coupling of system and the pollution of the lower-order Nédélec's edge approximation in analysis. In terms of a newly modified Maxwell projection we establish new and optimal error estimates. In particular, we prove that the method based on the commonly-used Taylor-Hood/lowest-order Nédélec's edge element is efficient and the method provides the second-order accuracy for numerical velocity. Two numerical examples for the problem in both convex and nonconvex polygonal domains are presented. Numerical results confirm our theoretical analysis.

math.NA↗
arXiv2023

Weak discrete maximum principle of isoparametric finite element methods in curvilinear polyhedra

The weak maximum principle of the isoparametric finite element method is proved for the Poisson equation under the Dirichlet boundary condition in a (possibly concave) curvilinear polyhedral domain with edge openings smaller than $π$, which include smooth domains and smooth deformations of convex polyhedra. The proof relies on the analysis of a dual elliptic problem with a discontinuous coefficient matrix arising from the isoparametric finite elements. Therefore, the standard $H^2$ elliptic regularity which is required in the proof of the weak maximum principle in the literature does not hold for this dual problem. To overcome this difficulty, we have decomposed the solution into a smooth part and a nonsmooth part, and estimated the two parts by $H^2$ and $W^{1,p}$ estimates, respectively. As an application of the weak maximum principle, we have proved a maximum-norm best approximation property of the isoparametric finite element method for the Poisson equation in a curvilinear polyhedron. The proof contains non-trivial modifications of Schatz's argument due to the non-conformity of the iso-parametric finite elements, which requires us to construct a globally smooth flow map which maps the curvilinear polyhedron to a perturbed larger domain on which we can establish the $W^{1,\infty}$ regularity estimate of the Poisson equation uniformly with respect to the perturbation.

math.NA↗
arXiv2023

A Non-gradient DG method for second-order Elliptic Equations in the Non-divergence Form

$L^1$ based optimization is widely used in image denoising, machine learning and related applications. One of the main features of such approach is that it naturally provide a sparse structure in the numerical solutions. In this paper, we study an $L^1$ based mixed DG method for second-order elliptic equations in the non-divergence form. The elliptic PDE in nondivergence form arises in the linearization of fully nonlinear PDEs. Due to the nature of the equations, classical finite element methods based on variational forms can not be employed directly. In this work, we propose a new optimization scheme coupling the classical DG framework with recently developed $L^1$ optimization technique. Convergence analysis in both energy norm and $L^{\infty}$ norm are obtained under weak regularity assumption. Such $L^1$ models are nondifferentiable and therefore invalidate traditional gradient methods. Therefore all existing gradient based solvers are no longer feasible under this setting. To overcome this difficulty, we characterize solutions of $L^1$ optimization as fixed-points of proximity equations and utilize matrix splitting technique to obtain a class of fixed-point proximity algorithms with convergence analysis. Various numerical examples are displayed to illustrate the numerical solution has sparse structure with careful choice of the bases of the finite dimensional spaces. Numerical examples in both smooth and nonsmooth settings are provided to validate the theoretical results.

math.NA↗
arXiv2022

Error estimates for the scalar auxiliary variable (SAV) scheme to the Cahn-Hilliard equation

The optimal error estimate that depending only on the polynomial degree of $ \varepsilon^{-1}$ is established for the temporal semi-discrete scheme of the Cahn-Hilliard equation, which is based on the scalar auxiliary variable (SAV) formulation. The key to our analysis is to convert the structure of the SAV time-stepping scheme back to a form compatible with the original format of the Cahn-Hilliard equation, which makes it feasible to use spectral estimates to handle the nonlinear term. Based on the transformation of the SAV numerical scheme, the optimal error estimate for the temporal semi-discrete scheme which depends only on the low polynomial order of $\varepsilon^{-1}$ instead of the exponential order, is derived by using mathematical induction, spectral arguments, and the superconvergence properties of some nonlinear terms. Numerical examples are provided to illustrate the discrete energy decay property and validate our theoretical convergence analysis.

math.NA↗
arXiv2022

A $C^{0}$ interior penalty method for $m$th-Laplace equation

In this paper, we propose a $C^{0}$ interior penalty method for $m$th-Laplace equation on bounded Lipschitz polyhedral domain in $\mathbb{R}^{d}$, where $m$ and $d$ can be any positive integers. The standard $H^{1}$-conforming piecewise $r$-th order polynomial space is used to approximate the exact solution $u$, where $r$ can be any integer greater than or equal to $m$. Unlike the interior penalty method in [T.~Gudi and M.~Neilan, {\em An interior penalty method for a sixth-order elliptic equation}, IMA J. Numer. Anal., \textbf{31(4)} (2011), pp. 1734--1753], we avoid computing $D^{m}$ of numerical solution on each element and high order normal derivatives of numerical solution along mesh interfaces. Therefore our method can be easily implemented. After proving discrete $H^{m}$-norm bounded by the natural energy semi-norm associated with our method, we manage to obtain stability and optimal convergence with respect to discrete $H^{m}$-norm. Numerical experiments validate our theoretical estimate.

math.NA↗
arXiv2021

A convergent post-processed discontinuous Galerkin method for incompressible flow with variable density

We propose a linearized semi-implicit and decoupled finite element method for the incompressible Navier--Stokes equations with variable density. Our method is fully discrete and shown to be unconditionally stable. The velocity equation is solved by an H1-conforming finite element method, and an upwind discontinuous Galerkin finite element method with post-processed velocity is adopted for the density equation. The proposed method is proved to be convergent in approximating reasonably smooth solutions in three-dimensional convex polyhedral domains.

math.NA↗
arXiv2021

The pointwise stabilities of piecewise linear finite element method on non-obtuse tetrahedral meshes of nonconvex polyhedra

Let $Ω$ be a Lipschitz polyhedral (can be nonconvex) domain in $\mathbb{R}^{3}$, and $V_{h}$ denotes the finite element space of continuous piecewise linear polynomials. On non-obtuse quasi-uniform tetrahedral meshes, we prove that the finite element projection $R_{h}u$ of $u \in H^{1}(Ω) \cap C(\overlineΩ)$ (with $R_{h} u$ interpolating $u$ at the boundary nodes) satisfies \begin{align*} \Vert R_{h} u\Vert_{L^{\infty}(Ω)} \leq C \vert \log h \vert \Vert u\Vert_{L^{\infty}(Ω)}. \end{align*} If we further assume $u \in W^{1,\infty}(Ω)$, then \begin{align*} \Vert R_{h} u\Vert_{W^{1, \infty}(Ω)} \leq C \vert \log h \vert \Vert u\Vert_{W^{1, \infty}(Ω)}. \end{align*}

math.NA↗
arXiv2020

A mixed finite element scheme for biharmonic equation with variable coefficient and von Kármán equations

In this paper, a new mixed finite element scheme using element-wise stabilization is introduced for the biharmonic equation with variable coefficient on Lipschitz polyhedral domains. The proposed scheme doesn't involve any integration along mesh interfaces. The gradient of the solution is approximated by $H({\rm div})$-conforming $BDM_{k+1}$ element or vector valued Lagrange element with order $k+1$, while the solution is approximated by Lagrange element with order $k+2$ for any $k\geq 0$.This scheme can be easily implemented and produces positive definite linear system. We provide a new discrete $H^{2}$-norm stability, which is useful not only in analysis of this scheme but also in $C^{0}$ interior penalty methods and DG methods. Optimal convergences in both discrete $H^{2}$-norm and $L^{2}$-norm are derived. This scheme with its analysis is further generalized to the von Kármán equations. Finally, numerical results verifying the theoretical estimates of the proposed algorithms are also presented.

math.NA↗
arXiv2020

Analysis of a semi-implicit structure-preserving finite element method for the nonstationary incompressible Magnetohydrodynamics equations

We revise the structure-preserving finite element method in [K. Hu, Y. MA and J. Xu. (2017) Stable finite element methods preserving $\nabla \cdot \mathbf{B}=0$ exactly for MHD models. Numer. Math.,135, 371-396]. The revised method is semi-implicit in time-discretization. We prove the linearized scheme preserves the divergence free property for the magnetic field exactly at each time step. Further, we showed the linearized scheme is unconditionally stable and we obtain optimal convergence in the energy norm of the revised method even for solutions with low regularity.

math.NA↗
arXiv2020

Analysis of an interior penalty DG method for the quad-curl problem

The quad-curl term is an essential part of the resistive magnetohydrodynamic (MHD) equation and the fourth order inverse electromagnetic scattering problem, which are both of great significance in science and engineering. It is desirable to develop efficient and practical numerical methods for the quad-curl problem. In this paper, we first present some new regularity results for the quad-curl problem on Lipschitz polyhedron domains and then propose a mixed finite element method for solving the quad-curl problem. With a {\em novel} discrete Sobolev imbedding inequality for the piecewise polynomials, we obtain stability results and derive error estimates based on a relatively low regularity assumption of the exact solution.

math.NA↗
arXiv2019

Adaptive First-Order System Least-Squares Finite Element Methods for Second Order Elliptic Equations in Non-Divergence Form

This paper studies adaptive first-order least-squares finite element methods for second-order elliptic partial differential equations in non-divergence form. Unlike the classical finite element method which uses weak formulations of PDEs not applicable for the non-divergence equation, the first-order least-squares formulations naturally have stable weak forms without using integration by parts, allow simple finite element approximation spaces, and have build-in a posteriori error estimators for adaptive mesh refinements. The non-divergence equation is first written as a system of first-order equations by introducing the gradient as a new variable. Then two versions of least-squares finite element methods using simple $C^0$ finite elements are developed in the paper, one is the $L^2$-LSFEM which uses linear elements, the other is the weighted-LSFEM with a mesh-dependent weight to ensure the optimal convergence. Under a very mild assumption that the PDE has a unique solution, optimal a priori and a posteriori error estimates are proved. With an extra assumption on the operator regularity which is weaker than traditionally assumed, convergences in standard norms for the weighted-LSFEM are also discussed. $L^2$-error estimates are derived for both formulations. We perform extensive numerical experiments for smooth, non-smooth, and even degenerate coefficients on smooth and singular solutions to test the accuracy and efficiency of the proposed methods.

math.NA↗
arXiv2018

Discrete $H^1$-inequalities for spaces admitting M-decompositions

We find new discrete $H^1$- and Poincar\'e-Friedrichs inequalities by studying the invertibility of the DG approximation of the flux for local spaces admitting M-decompositions. We then show how to use these inequalities to define and analyze new, superconvergent HDG and mixed methods for which the stabilization function is defined in such a way that the approximations satisfy new $H^1$-stability results with which their error analysis is greatly simplified. We apply this approach to define a wide class of energy-bounded, superconvergent HDG and mixed methods for the incompressible Navier-Stokes equations defined on unstructured meshes using, in 2D, general polygonal elements and, in 3D, general, flat-faced tetrahedral, prismatic, pyramidal and hexahedral elements.

math.NA↗