Searcharxiv⌕ Search

arXiv subjects

Chunmei Wang

Publications and source records attributed to Chunmei Wang.

At least 73 records · Page 4Linked to original sources

A parallel iterative procedure for weak Galerkin methods for second order elliptic problems

A parallelizable iterative procedure based on domain decomposition is presented and analyzed for weak Galerkin finite element methods for second order elliptic equations. The convergence analysis is established for the decomposition of the domain into individual elements associated to the weak Galerkin methods or into larger subdomains. A series of numerical tests are illustrated to verify the theory developed in this paper.

math.NA↗

A Weak Galerkin Method for Elasticity Interface Problems

This article introduces a weak Galerkin (WG) finite element method for linear elasticity interface problems on general polygonal/ployhedra partitions. The developed WG method has been proved to be stable and accurate with optimal order error estimates in the discrete $H^1$ norm. Some numerical experiments are conducted to verify the efficiency and accuracy of the proposed WG method.

math.NA↗

An $L^p$- Primal-Dual Weak Galerkin Method for Convection-Diffusion Equations

In this article, the authors present a new $L^p$- primal-dual weak Galerkin method ($L^p$-PDWG) for convection-diffusion equations with $p>1$. The existence and uniqueness of the numerical solution is discussed, and an optimal-order error estimate is derived in the $L^q$-norm for the primal variable, where $\frac 1p+\frac 1q=1$. Furthermore, error estimates are established for the numerical approximation of the dual variable in the standard $W^{m,p}$ norm, $0\le m\le 2$. Numerical results are presented to demonstrate the efficiency and accuracy of the proposed $L^p$-PDWG method.

math.NA↗

Adaptive Learning on the Grids for Elliptic Hemivariational Inequalities

This paper introduces a deep learning method for solving an elliptic hemivariational inequality (HVI). In this method, an expectation minimization problem is first formulated based on the variational principle of underlying HVI, which is solved by stochastic optimization algorithms using three different training strategies for updating network parameters. The method is applied to solve two practical problems in contact mechanics, one of which is a frictional bilateral contact problem and the other of which is a frictionless normal compliance contact problem. Numerical results show that the deep learning method is efficient in solving HVIs and the adaptive mesh-free multigrid algorithm can provide the most accurate solution among the three learning methods.

math.NA↗

Structure Probing Neural Network Deflation

Deep learning is a powerful tool for solving nonlinear differential equations, but usually, only the solution corresponding to the flattest local minimizer can be found due to the implicit regularization of stochastic gradient descent. This paper proposes a network-based structure probing deflation method to make deep learning capable of identifying multiple solutions that are ubiquitous and important in nonlinear physical models. First, we introduce deflation operators built with known solutions to make known solutions no longer local minimizers of the optimization energy landscape. Second, to facilitate the convergence to the desired local minimizer, a structure probing technique is proposed to obtain an initial guess close to the desired local minimizer. Together with neural network structures carefully designed in this paper, the new regularized optimization can converge to new solutions efficiently. Due to the mesh-free nature of deep learning, the proposed method is capable of solving high-dimensional problems on complicated domains with multiple solutions, while existing methods focus on merely one or two-dimensional regular domains and are more expensive in operation counts. Numerical experiments also demonstrate that the proposed method could find more solutions than exiting methods.

math.NA↗

Reproducing Activation Function for Deep Learning

We propose reproducing activation functions (RAFs) to improve deep learning accuracy for various applications ranging from computer vision to scientific computing. The idea is to employ several basic functions and their learnable linear combination to construct neuron-wise data-driven activation functions for each neuron. Armed with RAFs, neural networks (NNs) can reproduce traditional approximation tools and, therefore, approximate target functions with a smaller number of parameters than traditional NNs. In NN training, RAFs can generate neural tangent kernels (NTKs) with a better condition number than traditional activation functions lessening the spectral bias of deep learning. As demonstrated by extensive numerical tests, the proposed RAFs can facilitate the convergence of deep learning optimization for a solution with higher accuracy than existing deep learning solvers for audio/image/video reconstruction, PDEs, and eigenvalue problems. With RAFs, the errors of audio/video reconstruction, PDEs, and eigenvalue problems are decreased by over 14%, 73%, 99%, respectively, compared with baseline, while the performance of image reconstruction increases by 58%.

cs.LG↗

A New Numerical Method for Div-Curl Systems with Low Regularity Assumptions

This paper presents a numerical method for div-curl systems with normal boundary conditions by using a finite element technique known as primal-dual weak Galerkin (PDWG). The PDWG finite element scheme for the div-curl system has two prominent features in that it offers not only an accurate and reliable numerical solution to the div-curl system under the low $H^α$-regularity ($α>0$) assumption for the true solution, but also an effective approximation of normal harmonic vector fields regardless the topology of the domain. Results of seven numerical experiments are presented to demonstrate the performance of the PDWG algorithm, including one example on the computation of discrete normal harmonic vector fields.

math.NA↗

Low Regularity Primal-Dual Weak Galerkin Finite Element Methods for Ill-Posed Elliptic Cauchy Problems

A new primal-dual weak Galerkin (PDWG) finite element method is introduced and analyzed for the ill-posed elliptic Cauchy problems with ultra-low regularity assumptions on the exact solution. The Euler-Lagrange formulation resulting from the PDWG scheme yields a system of equations involving both the primal equation and the adjoint (dual) equation. The optimal order error estimate for the primal variable in a low regularity assumption is established. A series of numerical experiments are illustrated to validate effectiveness of the developed theory.

math.NA↗

A Modified Primal-Dual Weak Galerkin Finite Element Method for Second Order Elliptic Equations in Non-Divergence Form

A modified primal-dual weak Galerkin (M-PDWG) finite element method is designed for the second order elliptic equation in non-divergence form. Compared with the existing PDWG methods proposed in \cite{wwnondiv}, the system of equations resulting from the M-PDWG scheme could be equivalently simplified into one equation involving only the primal variable by eliminating the dual variable (Lagrange multiplier). The resulting simplified system thus has significantly fewer degrees of freedom than the one resulting from existing PDWG scheme. In addition, the condition number of the simplified system could be greatly reduced when a newly introduced bilinear term in the M-PDWG scheme is appropriately chosen. Optimal order error estimates are derived for the numerical approximations in the discrete $H^2$-norm, $H^1$-norm and $L^2$-norm respectively. Extensive numerical results are demonstrated for both the smooth and non-smooth coefficients on convex and non-convex domains to verify the accuracy of the theory developed in this paper.

math.NA↗

A New Primal-Dual Weak Galerkin Method for Elliptic Interface Problems with Low Regularity Assumptions

This article introduces a new primal-dual weak Galerkin (PDWG) finite element method for second order elliptic interface problems with ultra-low regularity assumptions on the exact solution and the interface and boundary data. It is proved that the PDWG method is stable and accurate with optimal order of error estimates in discrete and Sobolev norms. In particular, the error estimates are derived under the low regularity assumption of $u\in H^δ(Ω)$ for $δ> \frac12$ for the exact solution $u$. Extensive numerical experiments are conducted to provide numerical solutions that verify the efficiency and accuracy of the new PDWG method.

math.NA↗

A simplified primal-dual weak Galerkin finite element method for Fokker-Planck type equations

A simplified primal-dual weak Galerkin (S-PDWG) finite element method is designed for the Fokker-Planck type equation with non-smooth diffusion tensor and drift vector. The discrete system resulting from S-PDWG method has significantly fewer degrees of freedom compared with the one resulting from the PDWG method proposed by Wang-Wang \cite{WW-fp-2018}. Furthermore, the condition number of the S-PDWG method is smaller than the PDWG method \cite{WW-fp-2018} due to the introduction of a new stabilizer, which provides a potential for designing fast algorithms. Optimal order error estimates for the S-PDWG approximation are established in the $L^2$ norm. A series of numerical results are demonstrated to validate the effectiveness of the S-PDWG method.

math.NA↗

De Rham Complexes for Weak Galerkin Finite Element Spaces

Two de Rham complex sequences of the finite element spaces are introduced for weak finite element functions and weak derivatives developed in the weak Galerkin (WG) finite element methods on general polyhedral elements. One of the sequences uses polynomials of equal order for all the finite element spaces involved in the sequence and the other one uses polynomials of naturally decending orders. It is shown that the diagrams in both de Rham complexes commute for general polyhedral elements. The exactness of one of the complexes is established for the lowest order element.

math.NA↗

New Primal-Dual Weak Galerkin Finite Element Methods for Convection-Diffusion Problems

This article devises a new primal-dual weak Galerkin finite element method for the convection-diffusion equation. Optimal order error estimates are established for the primal-dual weak Galerkin approximations in various discrete norms and the standard $L^2$ norms. A series of numerical experiments are conducted and reported to verify the theoretical findings.

math.NA↗

A Primal-dual weak Galerkin finite element method for linear convection equations in non-divergence form

A new primal-dual weak Galerkin (PD-WG) finite element method was developed and analyzed in this article for first-order linear convection equations in non-divergence form. The PD-WG method results in a symmetric discrete system involving not only the original equation for the primal variable, but also the dual/adjoint equation for the dual variable (also known as Lagrangian multiplier). Optimal order of error estimates in various discrete Sobolev norms are derived for the numerical solutions arising from the PD-WG scheme. Numerical results are produced and reported to illustrate the accuracy and effectiveness of the new PD-WG method.

math.NA↗

A primal-dual finite element method for first-order transport problems

This article devises a new numerical method for first-order transport problems by using the primal-dual weak Galerkin (PD-WG) finite element method recently developed in scientific computing. The PD-WG method is based on a variational formulation of the modeling equation for which the differential operator is applied to the test function so that low regularity for the exact solution of the original equation is sufficient for computation. The PD-WG finite element method indeed yields a symmetric system involving both the original equation for the primal variable and its dual for the dual variable (also known as Lagrangian multiplier). For the linear transport problem, it is shown that the PD-WG method offers numerical solutions that conserve mass locally on each element. Optimal order error estimates in various norms are derived for the numerical solutions arising from the PD-WG method with weak regularity assumptions on the modelling equations. A variety of numerical results are presented to demonstrate the accuracy and stability of the new method.

math.NA↗

Low Regularity Primal-Dual Weak Galerkin Finite Element Methods for Convection-Diffusion Equations

We propose a numerical method for convection-diffusion problems under low regularity assumptions. We derive the method and analyze it using the primal-dual weak Galerkin (PDWG) finite element framework. The Euler-Lagrange formulation resulting from the PDWG scheme yields a system of equations involving not only the equation for the primal variable but also its adjoint for the dual variable. We show that the proposed PDWG method is stable and convergent. We also derive a priori error estimates for the primal variable in the $H^ε$-norm for $ε\in [0,\frac12)$. A series of numerical tests that validate the theory and are presented as well.

math.NA↗

Superconvergence of Numerical Gradient for Weak Galerkin Finite Element Methods on Nonuniform Cartesian Partitions in Three Dimensions

A superconvergence error estimate for the gradient approximation of the second order elliptic problem in three dimensions is analyzed by using weak Galerkin finite element scheme on the uniform and non-uniform cubic partitions. Due to the loss of the symmetric property from two dimensions to three dimensions, this superconvergence result in three dimensions is not a trivial extension of the recent superconvergence result in two dimensions \cite{sup_LWW2018} from rectangular partitions to cubic partitions. The error estimate for the numerical gradient in the $L^{2}$-norm arrives at a superconvergence order of ${\cal O}(h^r) (1.5 \leq r\leq 2)$ when the lowest order weak Galerkin finite elements consisting of piecewise linear polynomials in the interior of the elements and piecewise constants on the faces of the elements are employed. A series of numerical experiments are illustrated to confirm the established superconvergence theory in three dimensions.

math.NA↗

A New Primal-Dual Weak Galerkin Finite Element Method for Ill-posed Elliptic Cauchy Problems

A new numerical method is devised and analyzed for a type of ill-posed elliptic Cauchy problems by using the primal-dual weak Galerkin finite element method. This new primal-dual weak Galerkin algorithm is robust and efficient in the sense that the system arising from the scheme is symmetric, well-posed, and is satisfied by the exact solution (if it exists). An error estimate of optimal order is established for the corresponding numerical solutions in a scaled residual norm. In addition, a mathematical convergence is established in a weak $L^2$ topology for the new numerical method. Numerical results are reported to demonstrate the efficiency of the primal-dual weak Galerkin method as well as the accuracy of the numerical approximations.

math.NA↗