Junping Wang

Junping Wang, Xiu Ye

A new weak Galerkin (WG) method is introduced and analyzed for the second order elliptic equation formulated as a system of two first order linear equations. This method, called WG-MFEM, is designed by using discontinuous piecewise polynomials on finite element partitions with arbitrary shape of polygons/polyhedra. The WG-MFEM is capable of providing very accurate numerical approximations for both the primary and flux variables. Allowing the use of discontinuous approximating functions on arbitrary shape of polygons/polyhedra makes the method highly flexible in practical computation. Optimal order error estimates in both discrete $H^1$ and $L^2$ norms are established for the corresponding weak Galerkin mixed finite element solutions.

Junping Wang, Xiu Ye

This paper introduces a weak Galerkin (WG) finite element method for the Stokes equations in the primary velocity-pressure formulation. This WG method is equipped with stable finite elements consisting of usual polynomials of degree $k\ge 1$ for the velocity and polynomials of degree $k-1$ for the pressure, both are discontinuous. The velocity element is enhanced by polynomials of degree $k-1$ on the interface of the finite element partition. All the finite element functions are discontinuous for which the usual gradient and divergence operators are implemented as distributions in properly-defined spaces. Optimal-order error estimates are established for the corresponding numerical approximation in various norms. It must be emphasized that the WG finite element method is designed on finite element partitions consisting of arbitrary shape of polygons or polyhedra which are shape regular.

Lin Mu, Junping Wang, Xiu Ye

A new weak Galerkin (WG) finite element method is introduced and analyzed in this paper for the biharmonic equation in its primary form. This method is highly robust and flexible in the element construction by using discontinuous piecewise polynomials on general finite element partitions consisting of polygons or polyhedra of arbitrary shape. The resulting WG finite element formulation is symmetric, positive definite, and parameter-free. Optimal order error estimates in a discrete $H^2$ norm is established for the corresponding WG finite element solutions. Error estimates in the usual $L^2$ norm are also derived, yielding a sub-optimal order of convergence for the lowest order element and an optimal order of convergence for all high order of elements. Numerical results are presented to confirm the theory of convergence under suitable regularity assumptions.

Qiaoluan H. Li, Junping Wang

A newly developed weak Galerkin method is proposed to solve parabolic equations. This method allows the usage of totally discontinuous functions in approximation space and preserves the energy conservation law. Both continuous and discontinuous time weak Galerkin finite element schemes are developed and analyzed. Optimal order error estimates in both H^1 and L^2 norms are established. Numerical tests are performed and reported.

Lin Mu, Junping Wang, Yanqiu Wang et al.

This article introduces and analyzes a weak Galerkin mixed finite element method for solving the biharmonic equation. The weak Galerkin method, first introduced by two of the authors (J. Wang and X. Ye) in an earlier publication for second order elliptic problems, is based on the concept of discrete weak gradients. The method allows the use of completely discrete finite element functions on partitions of arbitrary polygon or polyhedron. In this article, the idea of weak Galerkin method is applied to discretize the Ciarlet-Raviart mixed formulation for the biharmonic equation. In particular, an a priori error estimation is given for the corresponding finite element approximations. The error analysis essentially follows the framework of Babuska, Osborn, and Pitkaranta and uses specially designed mesh-dependent norms. The proof is technically tedious due to the discontinuous nature of the weak Galerkin finite element functions. Some computational results are presented to demonstrate the efficiency of the method.

Junping Wang, Ran Zhang

This paper derives some discrete maximum principles for $P1$-conforming finite element approximations for quasi-linear second order elliptic equations. The results are extensions of the classical maximum principles in the theory of partial differential equations to finite element methods. The mathematical tools are based on the variational approach that was commonly used in the classical PDE theory. The discrete maximum principles are established by assuming a property on the discrete variational form that is of global nature. In particular, the assumption on the variational form is verified when the finite element partition satisfies some angle conditions. For the general quasi-linear elliptic equation, these angle conditions indicate that each triangle or tetrahedron needs to be $\mathcal{O}(h^α)$-acute in the sense that each angle $α_{ij}$ (for triangle) or interior dihedral angle $α_{ij}$ (for tetrahedron) must satisfy $α_{ij}\le π/2-γh^α$ for some $α\ge 0$ and $γ>0$. For the Poisson problem where the differential operator is given by Laplacian, the angle requirement is the same as the existing ones: either all the triangles are non-obtuse or each interior edge is non-negative. It should be pointed out that the analytical tools used in this paper are based on the powerful De Giorgi's iterative method that has played important roles in the theory of partial differential equations. The mathematical analysis itself is of independent interest in the finite element analysis.

Dan Li, Chunmei Wang, Junping Wang

This article presents a superconvergence for the gradient approximation of the second order elliptic equation discretized by the weak Galerkin finite element methods on nonuniform rectangular partitions. The result shows a convergence of ${\cal O}(h^r)$, $1.5\leq r \leq 2$, for the numerical gradient obtained from the lowest order weak Galerkin element consisting of piecewise linear and constant functions. For this numerical scheme, the optimal order of error estimate is ${\cal O}(h)$ for the gradient approximation. The superconvergence reveals a superior performance of the weak Galerkin finite element methods. Some computational results are included to numerically validate the superconvergence theory.

JunPing Wang, WenSheng Zhang, Ian Thomas et al.

Generating sequential decision process from huge amounts of measured process data is a future research direction for collaborative factory automation, making full use of those online or offline process data to directly design flexible make decisions policy, and evaluate performance. The key challenges for the sequential decision process is to online generate sequential decision-making policy directly, and transferring knowledge across tasks domain. Most multi-task policy generating algorithms often suffer from insufficient generating cross-task sharing structure at discrete-time nonlinear systems with applications. This paper proposes the multi-task generative adversarial nets with shared memory for cross-domain coordination control, which can generate sequential decision policy directly from raw sensory input of all of tasks, and online evaluate performance of system actions in discrete-time nonlinear systems. Experiments have been undertaken using a professional flexible manufacturing testbed deployed within a smart factory of Weichai Power in China. Results on three groups of discrete-time nonlinear control tasks show that our proposed model can availably improve the performance of task with the help of other related tasks.

Lin Mu, Junping Wang, Xiu Ye

This paper presents a hybridized formulation for the weak Galerkin mixed finite element method (WG-MFEM) which was introduced and analyzed for second order elliptic equations. The WG-MFEM method was designed by using discontinuous piecewise polynomials on finite element partitions consisting of polygonal or polyhedral elements of arbitrary shape. The key to WG-MFEM is the use of a discrete weak divergence operator which is defined and computed by solving inexpensive problems locally on each element. The hybridized formulation of this paper leads to a significantly reduced system of linear equations involving only the unknowns arising from the Lagrange multiplier in hybridization. Optimal-order error estimates are derived for the hybridized WG-MFEM approximations. Some numerical results are reported to confirm the theory and a superconvergence for the Lagrange multiplier.

Chunmei Wang, Junping Wang, Ruishu Wang et al.

This paper presents an arbitrary order locking-free numerical scheme for linear elasticity on general polygonal/polyhedral partitions by using weak Galerkin (WG) finite element methods. Like other WG methods, the key idea for the linear elasticity is to introduce discrete weak strain and stress tensors which are defined and computed by solving inexpensive local problems on each element. Such local problems are derived from weak formulations of the corresponding differential operators through integration by parts. Locking-free error estimates of optimal order are derived in a discrete $H^1$-norm and the usual $L^2$-norm for the approximate displacement when the exact solution is smooth. Numerical results are presented to demonstrate the efficiency, accuracy, and the locking-free property of the weak Galerkin finite element method.