arXiv subjects

Chunmei Wang

Publications and source records attributed to Chunmei Wang.

At least 55 records · Page 3Linked to original sources

arXiv2024

Auto-Stabilized Weak Galerkin Finite Element Methods on Polytopal Meshes without Convexity Constraints

This paper introduces an auto-stabilized weak Galerkin (WG) finite element method with a built-in stabilizer for Poisson equations. By utilizing bubble functions as a key analytical tool, our method extends to both convex and non-convex elements in finite element partitions, marking a significant advancement over existing stabilizer-free WG methods. It overcomes the restrictive conditions of previous approaches and is applicable in any dimension $d$, offering substantial advantages. The proposed method maintains a simple, symmetric, and positive definite structure. These benefits are evidenced by optimal order error estimates in both discrete $H^1$ and $L^2$ norms, highlighting the effectiveness and accuracy of our WG method for practical applications.

math.NA↗

arXiv2024

A Parallel iterative Algorithm for primal-dual weak Galerkin Schemes

This paper presents and analyzes a parallelizable iterative procedure based on domain decomposition for primal-dual weak Galerkin (PDWG) finite element methods applied to the Poisson equation. The existence and uniqueness of the PDWG solution are established. Optimal order of error estimates are derived in both a discrete norm and the $L^2$ norm. The convergence analysis is conducted for domain decompositions into individual elements associated with the PDWG methods, which can be extended to larger subdomains without any difficulty.

math.NA↗

arXiv2024

Let data talk: data-regularized operator learning theory for inverse problems

Regularization plays a pivotal role in integrating prior information into inverse problems. While many deep learning methods have been proposed to solve inverse problems, determining where to apply regularization remains a crucial consideration. Typical methods regularize neural networks via architecture, wherein neural network functions parametrize the parameter of interest or the regularization term. We introduce a novel approach, denoted as the "data-regularized operator learning" (DaROL) method, designed to address PDE inverse problems. The DaROL method trains a neural network on data, regularized through common techniques such as Tikhonov variational methods and Bayesian inference. The DaROL method offers flexibility across different frameworks, faster inverse problem-solving, and a simpler structure that separates regularization and neural network training. We demonstrate that training a neural network on the regularized data is equivalent to supervised learning for a regularized inverse map. Furthermore, we provide sufficient conditions for the smoothness of such a regularized inverse map and estimate the learning error in terms of neural network size and the number of training samples.

math.NA↗

arXiv2023

Pseudo-differential integral autoencoder network for inverse PDE operators

Partial differential equations (PDEs) play a foundational role in modeling physical phenomena. This study addresses the challenging task of determining variable coefficients within PDEs from measurement data. We introduce a novel neural network, "pseudo-differential IAEnet" (pd-IAEnet), which draws inspiration from pseudo-differential operators. pd-IAEnet achieves significantly enhanced computational speed and accuracy with fewer parameters compared to conventional models. Extensive benchmark evaluations are conducted across a range of inverse problems, including Electrical Impedance Tomography (EIT), optical tomography, and seismic imaging, consistently demonstrating pd-IAEnet's superior accuracy. Notably, pd-IAEnet exhibits robustness in the presence of measurement noise, a critical characteristic for real-world applications. An exceptional feature is its discretization invariance, enabling effective training on data from diverse discretization schemes while maintaining accuracy on different meshes. In summary, pd-IAEnet offers a potent and efficient solution for addressing inverse PDE problems, contributing to improved computational efficiency, robustness, and adaptability to a wide array of data sources.

math.NA↗

arXiv2023

Weak Galerkin methods for elliptic interface problems on curved polygonal partitions

This paper presents a new weak Galerkin (WG) method for elliptic interface problems on general curved polygonal partitions. The method's key innovation lies in its ability to transform the complex interface jump condition into a more manageable Dirichlet boundary condition, simplifying the theoretical analysis significantly. The numerical scheme is designed by using locally constructed weak gradient on the curved polygonal partitions. We establish error estimates of optimal order for the numerical approximation in both discrete $H^1$ and $L^2$ norms. Additionally, we present various numerical results that serve to illustrate the robust numerical performance of the proposed WG interface method.

math.NA↗

arXiv2023

Deep Operator Learning Lessens the Curse of Dimensionality for PDEs

Deep neural networks (DNNs) have achieved remarkable success in numerous domains, and their application to PDE-related problems has been rapidly advancing. This paper provides an estimate for the generalization error of learning Lipschitz operators over Banach spaces using DNNs with applications to various PDE solution operators. The goal is to specify DNN width, depth, and the number of training samples needed to guarantee a certain testing error. Under mild assumptions on data distributions or operator structures, our analysis shows that deep operator learning can have a relaxed dependence on the discretization resolution of PDEs and, hence, lessen the curse of dimensionality in many PDE-related problems including elliptic equations, parabolic equations, and Burgers equations. Our results are also applied to give insights about discretization-invariance in operator learning.

cs.LG↗

arXiv2023

Weak Galerkin Finite Element Methods for Optimal Control Problems Governed by Second Order Elliptic Partial Differential Equations

This paper is concerned with the development of weak Galerkin (WG) finite element method for optimal control problems governed by second order elliptic partial differential equations (PDEs). It is advantageous to use discontinuous finite elements over the traditional $C^1$ finite elements here. Optimal order error estimates are established and confirmed by some numerical tests.

math.NA↗

arXiv2023

A Modified weak Galerkin finite element method for the Maxwell equations on polyhedral meshes

We introduce a new numerical method for solving time-harmonic Maxwell's equations via the modified weak Galerkin technique. The inter-element functions of the weak Galerkin finite elements are replaced by the average of the two discontinuous polynomial functions on the two sides of the polygon, in the modified weak Galerkin (MWG) finite element method. With the dependent inter-element functions, the weak curl and the weak gradient are defined directly on totally discontinuous polynomials. Optimal-order convergence of the method is proved. Numerical examples confirm the theory and show effectiveness of the modified weak Galerkin method over the existing methods.

math.NA↗

arXiv2023

An Extension of the Morley Element on General Polytopal Partitions Using Weak Galerkin Methods

This paper introduces an extension of the well-known Morley element for the biharmonic equation, extending its application from triangular elements to general polytopal elements using the weak Galerkin finite element methods. By leveraging the Schur complement of the weak Galerkin method, this extension not only preserves the same degrees of freedom as the Morley element on triangular elements but also expands its applicability to general polytopal elements. The numerical scheme is devised by locally constructing weak tangential derivatives and weak second-order partial derivatives. Error estimates for the numerical approximation are established in both the energy norm and the $L^2$ norm. A series of numerical experiments are conducted to validate the theoretical developments.

math.NA↗

arXiv2023

High Order Morley Elements for Biharmonic Equations on Polytopal Partitions

This paper introduces an extension of the Morley element for approximating solutions to biharmonic equations. Traditionally limited to piecewise quadratic polynomials on triangular elements, the extension leverages weak Galerkin finite element methods to accommodate higher degrees of polynomials and the flexibility of general polytopal elements. By utilizing the Schur complement of the weak Galerkin method, the extension allows for fewest local degrees of freedom while maintaining sufficient accuracy and stability for the numerical solutions. The numerical scheme incorporates locally constructed weak tangential derivatives and weak second order partial derivatives, resulting in an accurate approximation of the biharmonic equation. Optimal order error estimates in both a discrete $H^2$ norm and the usual $L^2$ norm are established to assess the accuracy of the numerical approximation. Additionally, numerical results are presented to validate the developed theory and demonstrate the effectiveness of the proposed extension.

math.NA↗

arXiv2023

Generalized weak Galerkin finite element methods for second order elliptic problems

This article proposes and analyzes the generalized weak Galerkin ({\rm g}WG) finite element method for the second order elliptic problem. A generalized discrete weak gradient operator is introduced in the weak Galerkin framework so that the {\rm g}WG methods would not only allow arbitrary combinations of piecewise polynomials defined in the interior and on the boundary of each local finite element, but also work on general polytopal partitions. Error estimates are established for the corresponding numerical functions in the energy norm and the usual $L^2$ norm. A series of numerical experiments are presented to demonstrate the performance of the newly proposed {\rm g}WG method.

math.NA↗

arXiv2023

Deep Learning via Neural Energy Descent

This paper proposes the Nerual Energy Descent (NED) via neural network evolution equations for a wide class of deep learning problems. We show that deep learning can be reformulated as the evolution of network parameters in an evolution equation and the steady state solution of the partial differential equation (PDE) provides a solution to deep learning. This equation corresponds to a gradient descent flow of a variational problem and hence the proposed time-dependent PDE solves an energy minimization problem to obtain a global minimizer of deep learning. This gives a novel interpretation and solution to deep learning optimization. The computational complexity of the proposed energy descent method can be enhanced by randomly sampling the spatial domain of the PDE leading to an efficient NED. Numerical examples are provided to demonstrate the numerical advantage of NED over stochastic gradient descent (SGD).

math.NA↗

arXiv2023

Generalized Weak Galerkin Finite Element Methods for Biharmonic Equations

The generalized weak Galerkin (gWG) finite element method is proposed and analyzed for the biharmonic equation. A new generalized discrete weak second order partial derivative is introduced in the gWG scheme to allow arbitrary combinations of piecewise polynomial functions defined in the interior and on the boundary of general polygonal or polyhedral elements. The error estimates are established for the numerical approximation in a discrete H^2 norm and a L^2 norm. The numerical results are reported to demonstrate the accuracy and flexibility of our proposed gWG method for the biharmonic equation.

math.NA↗

arXiv2022

Friedrichs Learning: Weak Solutions of Partial Differential Equations via Deep Learning

This paper proposes Friedrichs learning as a novel deep learning methodology that can learn the weak solutions of PDEs via a minmax formulation, which transforms the PDE problem into a minimax optimization problem to identify weak solutions. The name "Friedrichs learning" is for highlighting the close relationship between our learning strategy and Friedrichs theory on symmetric systems of PDEs. The weak solution and the test function in the weak formulation are parameterized as deep neural networks in a mesh-free manner, which are alternately updated to approach the optimal solution networks approximating the weak solution and the optimal test function, respectively. Extensive numerical results indicate that our mesh-free method can provide reasonably good solutions to a wide range of PDEs defined on regular and irregular domains in various dimensions, where classical numerical methods such as finite difference methods and finite element methods may be tedious or difficult to be applied.

math.NA↗

arXiv2022

An $L^p$-primal-dual finite element method for first-order transport problems

A new $L^p$-primal-dual weak Galerkin method ($L^p$-PDWG) with $p>1$ is proposed for the first-order transport problems. The existence and uniqueness of the $L^p$-PDWG numerical solutions is established. In addition, the $L^p$-PDWG method offers a numerical solution which retains mass conservation locally on each element. An optimal order error estimate is established for the primal variable. A series of numerical results are presented to verify the efficiency and accuracy of the proposed $L^p$-PDWG scheme.

math.NA↗

arXiv2022

Curved Elements in Weak Galerkin Finite Element Methods

A mathematical analysis is established for the weak Galerkin finite element methods for the Poisson equation with Dirichlet boundary value when the curved elements are involved on the interior edges of the finite element partition or/and on the boundary of the whole domain in two dimensions. The optimal orders of error estimates for the weak Galerkin approximations in both the $H^1$-norm and the $L^2$-norm are established. Numerical results are reported to demonstrate the performance of the weak Galerkin methods on general curved polygonal partitions.

math.NA↗

arXiv2022

Weak Galerkin Finite Element Methods for Quad-Curl Problems

This article introduces a weak Galerkin (WG) finite element method for quad-curl problems in three dimensions. It is proved that the proposed WG method is stable and accurate in an optimal order of error estimates for the exact solution in discrete norms. In addition, an $L^2$ error estimate in an optimal order except the lowest orders $k=1, 2$ is derived for the WG solution. Some numerical experiments are conducted to verify the efficiency and accuracy of our WG method and furthermore a superconvergence has been observed from the numerical results.

math.NA↗

arXiv2022

An $L^p$- Primal-Dual Weak Galerkin method for div-curl Systems

This paper presents a new $L^p$-primal-dual weak Galerkin (PDWG) finite element method for the div-curl system with the normal boundary condition for $p>1$. Two crucial features for the proposed $L^p$-PDWG finite element scheme are as follows: (1) it offers an accurate and reliable numerical solution to the div-curl system under the low $W^{α, p}$-regularity ($α>0$) assumption for the exact solution; (2) it offers an effective approximation of the normal harmonic vector fields on domains with complex topology. An optimal order error estimate is established in the $L^q$-norm for the primal variable where $\frac{1}{p}+\frac{1}{q}=1$. A series of numerical experiments are presented to demonstrate the performance of the proposed $L^p$-PDWG algorithm.

math.NA↗