Searcharxiv⌕ Search

arXiv subjects

Wenbin Chen

Publications and source records attributed to Wenbin Chen.

At least 37 records · Page 2Linked to original sources
arXiv2022

A Weak Galerkin Mixed Finite Element Method for second order elliptic equations on 2D Curved Domains

This article concerns the weak Galerkin mixed finite element method (WG-MFEM) for second order elliptic equations on 2D domains with curved boundary. The Neumann boundary condition is considered since it becomes the essential boundary condition in this case. It is well-known that the discrepancy between the curved physical domain and the polygonal approximation domain leads to a loss of accuracy for discretization with polynomial order $α>1$. The purpose of this paper is two-fold. First, we present a detailed error analysis of the original WG-MFEM for solving problems on curved domains, which exhibits an $O(h^{1/2})$ convergence for all $α\ge 1$. It is a little surprising to see that even the lowest-order WG-MFEM ($α=1$) experiences a loss of accuracy. This is different from known results for the finite element method (FEM) or the mixed FEM, and appears to be a combined effect of the WG-MFEM design and the fact that the outward normal vector on the polygonal approximation domain is different from the one on the curved domain. Second, we propose a remedy to bring the approximation rate back to optimal by employing two techniques. One is a specially designed boundary correction technique. The other is to take full advantage of the nice feature that weak Galerkin discretization can be defined on polygonal meshes, which allows the curved boundary to be better approximated by multiple short edges without increasing the total number of mesh elements. Rigorous analysis shows that a combination of the above two techniques renders optimal convergence for all $α$. Numerical results further confirm this conclusion.

math.NA↗
arXiv2021

Error estimate of a decoupled numerical scheme for the Cahn-Hilliard-Stokes-Darcy system

We analyze a fully discrete finite element numerical scheme for the Cahn-Hilliard-Stokes-Darcy system that models two-phase flows in coupled free flow and porous media. To avoid a well-known difficulty associated with the coupling between the Cahn-Hilliard equation and the fluid motion, we make use of the operator-splitting in the numerical scheme, so that these two solvers are decoupled, which in turn would greatly improve the computational efficiency. The unique solvability and the energy stability have been proved in~\cite{CHW2017}. In this work, we carry out a detailed convergence analysis and error estimate for the fully discrete finite element scheme, so that the optimal rate convergence order is established in the energy norm, i.e.,, in the $\ell^\infty (0, T; H^1) \cap \ell^2 (0, T; H^2)$ norm for the phase variables, as well as in the $\ell^\infty (0, T; H^1) \cap \ell^2 (0, T; H^2)$ norm for the velocity variable. Such an energy norm error estimate leads to a cancellation of a nonlinear error term associated with the convection part, which turns out to be a key step to pass through the analysis. In addition, a discrete $\ell^2 (0;T; H^3)$ bound of the numerical solution for the phase variables plays an important role in the error estimate, which is accomplished via a discrete version of Gagliardo-Nirenberg inequality in the finite element setting.

math.NA↗
arXiv2021

An energy stable finite element scheme for the three-component Cahn-Hilliard-type model for macromolecular microsphere composite hydrogels

In this article, we present and analyze a finite element numerical scheme for a three-component macromolecular microsphere composite (MMC) hydrogel model, which takes the form of a ternary Cahn-Hilliard-type equation with Flory-Huggins-deGennes energy potential. The numerical approach is based on a convex-concave decomposition of the energy functional in multi-phase space, in which the logarithmic and the nonlinear surface diffusion terms are treated implicitly, while the concave expansive linear terms are explicitly updated. A mass lumped finite element spatial approximation is applied, to ensure the positivity of the phase variables. In turn, a positivity-preserving property can be theoretically justified for the proposed fully discrete numerical scheme. In addition, unconditional energy stability is established as well, which comes from the convexity analysis. Several numerical simulations are carried out to verify the accuracy and positivity-preserving property of the proposed scheme.

math.NA↗
arXiv2021

Unified Batch All Triplet Loss for Visible-Infrared Person Re-identification

Visible-Infrared cross-modality person re-identification (VI-ReID), whose aim is to match person images between visible and infrared modality, is a challenging cross-modality image retrieval task. Batch Hard Triplet loss is widely used in person re-identification tasks, but it does not perform well in the Visible-Infrared person re-identification task. Because it only optimizes the hardest triplet for each anchor image within the mini-batch, samples in the hardest triplet may all belong to the same modality, which will lead to the imbalance problem of modality optimization. To address this problem, we adopt the batch all triplet selection strategy, which selects all the possible triplets among samples to optimize instead of the hardest triplet. Furthermore, we introduce Unified Batch All Triplet loss and Cosine Softmax loss to collaboratively optimize the cosine distance between image vectors. Similarly, we rewrite the Hetero Center Triplet loss, which is proposed for VI-ReID task, into a batch all form to improve model performance. Extensive experiments indicate the effectiveness of the proposed methods, which outperform state-of-the-art methods by a wide margin.

cs.CV↗
arXiv2021

Bridging the Distribution Gap of Visible-Infrared Person Re-identification with Modality Batch Normalization

Visible-infrared cross-modality person re-identification (VI-ReID), whose aim is to match person images between visible and infrared modality, is a challenging cross-modality image retrieval task. Most existing works integrate batch normalization layers into their neural network, but we found out that batch normalization layers would lead to two types of distribution gap: 1) inter-mini-batch distribution gap -- the distribution gap of the same modality between each mini-batch; 2) intra-mini-batch modality distribution gap -- the distribution gap of different modality within the same mini-batch. To address these problems, we propose a new batch normalization layer called Modality Batch Normalization (MBN), which normalizes each modality sub-mini-batch respectively instead of the whole mini-batch, and can reduce these distribution gap significantly. Extensive experiments show that our MBN is able to boost the performance of VI-ReID models, even with different datasets, backbones and losses.

cs.CV↗
arXiv2021

Energy stable arbitrary order ETD-MS method for gradient flows with Lipschitz nonlinearity

We present a methodology to construct efficient high-order in time accurate numerical schemes for a class of gradient flows with appropriate Lipschitz continuous nonlinearity. There are several ingredients to the strategy: the exponential time differencing (ETD), the multi-step (MS) methods, the idea of stabilization, and the technique of interpolation. They are synthesized to develop a generic $k^{th}$ order in time efficient linear numerical scheme with the help of an artificial regularization term of the form $Aτ^k\frac{\partial}{\partial t}\mathcal{L}^{p(k)}u$ where $\mathcal{L}$ is the positive definite linear part of the flow, $τ$ is the uniform time step-size. The exponent $p(k)$ is determined explicitly by the strength of the Lipschitz nonlinear term in relation to $\mathcal{L}$ together with the desired temporal order of accuracy $k$. To validate our theoretical analysis, the thin film epitaxial growth without slope selection model is examined with a fourth-order ETD-MS discretization in time and Fourier pseudo-spectral in space discretization. Our numerical results on convergence and energy stability are in accordance with our theoretical results.

math.NA↗
arXiv2021

Multi-Grid Back-Projection Networks

Multi-Grid Back-Projection (MGBP) is a fully-convolutional network architecture that can learn to restore images and videos with upscaling artifacts. Using the same strategy of multi-grid partial differential equation (PDE) solvers this multiscale architecture scales computational complexity efficiently with increasing output resolutions. The basic processing block is inspired in the iterative back-projection (IBP) algorithm and constitutes a type of cross-scale residual block with feedback from low resolution references. The architecture performs in par with state-of-the-arts alternatives for regression targets that aim to recover an exact copy of a high resolution image or video from which only a downscale image is known. A perceptual quality target aims to create more realistic outputs by introducing artificial changes that can be different from a high resolution original content as long as they are consistent with the low resolution input. For this target we propose a strategy using noise inputs in different resolution scales to control the amount of artificial details generated in the output. The noise input controls the amount of innovation that the network uses to create artificial realistic details. The effectiveness of this strategy is shown in benchmarks and it is explained as a particular strategy to traverse the perception-distortion plane.

eess.IV↗
arXiv2020

Structure-Preserving Numerical Methods for Nonlinear Fokker--Planck Equations with Nonlocal Interactions by an Energetic Variational Approach

In this work, we develop novel structure-preserving numerical schemes for a class of nonlinear Fokker--Planck equations with nonlocal interactions. Such equations can cover many cases of importance, such as porous medium equations with external potentials, optimal transport problems, and aggregation-diffusion models. Based on the Energetic Variational Approach, a trajectory equation is first derived by using the balance between the maximal dissipation principle and least action principle. By a convex-splitting technique, we propose energy dissipating numerical schemes for the trajectory equation. Rigorous numerical analysis reveals that the nonlinear numerical schemes are uniquely solvable, naturally respect mass conservation and positivity at fully discrete level, and preserve steady states. Under certain smoothness assumptions, the numerical schemes are shown to be second order accurate in space and first order accurate in time. Extensive numerical simulations are performed to demonstrate several valuable features of the proposed schemes. In addition to the preservation of physical structures, such as positivity, mass conservation, discrete energy dissipation, blue and steady states, numerical simulations further reveal that our numerical schemes are capable of solving \emph{degenerate} cases of the Fokker--Planck equations effectively and robustly. It is shown that the developed numerical schemes have convergence order even in degenerate cases with the presence of solutions having compact support, can accurately and robustly compute the waiting time of free boundaries without any oscillation, and can approximate blow-up singularity up to machine precision.

math.NA↗
arXiv2020

A second order accurate numerical scheme for the porous medium equation by an energetic variational approach

The porous medium equation (PME) is a typical nonlinear degenerate parabolic equation. An energetic variational approach has been studied in a recent work [6], in which the trajectory equation is obtained, and a few first order accurate numerical schemes have been developed and analyzed. In this paper, we construct and analyze a second order accurate numerical scheme in both time and space. The unique solvability, energy stability are established, based on the convexity analysis. In addition, we provide a detailed convergence analysis for the proposed numerical scheme. A careful higher order asymptotic expansion is performed and two step error estimates are undertaken. In more details, a rough estimate is needed to control the highly nonlinear term in a discrete $W^{1,\infty}$ norm, and a refined estimate is applied to derive the optimal error order. Some numerical examples are presented as well.

math.NA↗
arXiv2020

Numerical Analysis of History-dependent Variational-hemivariational Inequalities

In this paper, numerical analysis is carried out for a class of history-dependent variational-hemivariational inequalities arising in contact problems. Three different numerical treatments for temporal discretization are proposed to approximate the continuous model. Fixed-point iteration algorithms are employed to implement the implicit scheme and the convergence is proved with a convergence rate independent of the time step-size and mesh grid-size. A special temporal discretization is introduced for the history-dependent operator, leading to numerical schemes for which the unique solvability and error bounds for the temporally discrete systems can be proved without any restriction on the time step-size. As for spatial approximation, the finite element method is applied and an optimal order error estimate for the linear element solutions is provided under appropriate regularity assumptions. Numerical examples are presented to illustrate the theoretical results.

math.NA↗
arXiv2019

MGBPv2: Scaling Up Multi-Grid Back-Projection Networks

Here, we describe our solution for the AIM-2019 Extreme Super-Resolution Challenge, where we won the 1st place in terms of perceptual quality (MOS) similar to the ground truth and achieved the 5th place in terms of high-fidelity (PSNR). To tackle this challenge, we introduce the second generation of MultiGrid BackProjection networks (MGBPv2) whose major modifications make the system scalable and more general than its predecessor. It combines the scalability of the multigrid algorithm and the performance of iterative backprojections. In its original form, MGBP is limited to a small number of parameters due to a strongly recursive structure. In MGBPv2, we make full use of the multigrid recursion from the beginning of the network; we allow different parameters in every module of the network; we simplify the main modules; and finally, we allow adjustments of the number of network features based on the scale of operation. For inference tasks, we introduce an overlapping patch approach to further allow processing of very large images (e.g. 8K). Our training strategies make use of a multiscale loss, combining distortion and/or perception losses on the output as well as downscaled output images. The final system can balance between high quality and high performance.

eess.IV↗
arXiv2019

A stabilized second order exponential time differencing multistep method for thin film growth model without slope selection

In this paper, a stabilized second order in time accurate linear exponential time differencing (ETD) scheme for the no-slope-selection thin film growth model is presented. An artificial stabilizing term $Aτ^2\frac{\partialΔ^2 u}{\partial t}$ is added to the physical model to achieve energy stability, with ETD-based multi-step approximations and Fourier collocation spectral method applied in the time integral and spatial discretization of the evolution equation, respectively. Long time energy stability and detailed $\ell^{\infty}(0,T; \ell^2)$ error analysis are provided based on the energy method, with a careful estimate of the aliasing error. In addition, numerical experiments are presented to demonstrate the energy decay and convergence rate.

math.NA↗
arXiv2019

Positivity-preserving, energy stable numerical schemes for the Cahn-Hilliard equation with logarithmic potential

We present and analyze finite difference numerical schemes for the Allen Cahn/Cahn-Hilliard equation with a logarithmic Flory Huggins energy potential. Both the first order and second order accurate temporal algorithms are considered. In the first order scheme, we treat the nonlinear logarithmic terms and the surface diffusion term implicitly, and update the linear expansive term and the mobility explicitly. We provide a theoretical justification that, this numerical algorithm has a unique solution such that the positivity is always preserved for the logarithmic arguments. In particular, our analysis reveals a subtle fact: the singular nature of the logarithmic term around the values of $-1$ and 1 prevents the numerical solution reaching these singular values, so that the numerical scheme is always well-defined as long as the numerical solution stays similarly bounded at the previous time step. Furthermore, an unconditional energy stability of the numerical scheme is derived, without any restriction for the time step size. The unique solvability and the positivity-preserving property for the second order scheme are proved using similar ideas, in which the singular nature of the logarithmic term plays an essential role. For both the first and second order accurate schemes, we are able to derive an optimal rate convergence analysis, which gives the full order error estimate. The case with a non-constant mobility is analyzed as well. We also describe a practical and efficient multigrid solver for the proposed numerical schemes, and present some numerical results, which demonstrate the robustness of the numerical schemes.

math.NA↗
arXiv2016

A Second Order Energy Stable Scheme for the Cahn-Hilliard-Hele-Shaw Equations

We present a second-order-in-time finite difference scheme for the Cahn-Hilliard-Hele-Shaw equations. This numerical method is uniquely solvable and unconditionally energy stable. At each time step, this scheme leads to a system of nonlinear equations that can be efficiently solved by a nonlinear multigrid solver. Owing to the energy stability, we derive an $\ell^2 (0,T; H_h^3)$ stability of the numerical scheme. To overcome the difficulty associated with the convection term $\nabla \cdot (ϕ\boldsymbol{u})$, we perform an $\ell^\infty (0,T; H_h^1)$ error estimate instead of the classical $\ell^\infty (0,T; \ell^2)$ one to obtain the optimal rate convergence analysis. In addition, various numerical simulations are carried out, which demonstrate the accuracy and efficiency of the proposed numerical scheme.

math.NA↗
arXiv2016

Uniquely solvable and energy stable decoupled schemes for Cahn-Hilliard-Stokes-Darcy system for two-phase flows in karstic geometry

We propose and analyze two novel decoupled numerical schemes for solving the Cahn-Hilliard-Stokes-Darcy (CHSD) model for two-phase flows in karstic geometry. In the first numerical scheme, we explore a fractional step method (operator splitting) to decouple the phase-field (Cahn-Hilliard equation) from the velocity field (Stokes-Darcy fluid equations). To further decouple the Stokes-Darcy system, we introduce a first order pressure stabilization term in the Darcy solver in the second numerical scheme so that the Stokes system is decoupled from the Darcy system and hence the CHSD system can be solved in a fully decoupled manner. We show that both decoupled numerical schemes are uniquely solvable, energy stable, and mass conservative. Ample numerical results are presented to demonstrate the accuracy and efficiency of our schemes.

math.NA↗
arXiv2015

Settling the Randomized k-sever Conjecture on Some Special Metrics

In this paper, we settle the randomized $k$-sever conjecture for the following metric spaces: line, circle, Hierarchically well-separated tree (HST). Specially, we show that there are $O(\log k)$-competitive randomized $k$-sever algorithms for above metric spaces. For any general metric space with $n$ points, we show that there is an $O( \log k \log n)$-competitive randomized $k$-sever algorithm.

cs.DS↗
arXiv2015

New Epitaxial Thin Film Models and numerical approximation

This paper concerns new continuum phenomenological model for epitaxial thin film growth with three different forms of the Ehrlich-Schwoebel current. Two of these forms were first proposed by Politi and Villain [1996] and then studied by Evans, Thiel and Bartelt [2006]. The other one is completely new. Following the techniques used in Li and Liu [2003], we present rigorous analysis of the well-posedness, regularity and time stability for the new model. We also studied both the global and the local behavior of the surface roughness in the growth process. The new model differs from other known models in that it features a linear convex part and a nonlinear concave part, and thus by using a convex-concave time splitting scheme, one can naturally build unconditionally stable semi-implicit numerical discretizations with linear implicit parts, which is much easier to implement than conventional models requiring nonlinear implicit parts. Despite this fundamental difference in the model, numerical experiments show that the nonlinear morphological instability of the new model agrees well with results of other models published in Li and Liu [2003], which indicates that the new model correctly captures the essential morphological states in the thin film growth process.

math.NA↗