Search

We develop in this paper a new regularized flow dynamic approach to construct efficient numerical schemes for Wasserstein gradient flows in Lagrangian coordinates. Instead of approximating the Wasserstein distance which needs to solve constrained minimization problems, we reformulate the problem using the Benamou-Brenier's flow dynamic approach, leading to algorithms which only need to solve unconstrained minimization problem in $L^2$ distance. Our schemes automatically inherit some essential properties of Wasserstein gradient systems such as positivity-preserving, mass conservative and energy dissipation. We present ample numerical simulations of Porous-Medium equations, Keller-Segel equations and Aggregation equations to validate the accuracy and stability of the proposed schemes. Compared to numerical schemes in Eulerian coordinates, our new schemes can capture sharp interfaces for various Wasserstein gradient flows using relatively smaller number of unknowns.

We present an optimal rate convergence analysis for a second order accurate in time, fully discrete finite difference scheme for the Cahn-Hilliard-Navier-Stokes (CHNS) system, combined with logarithmic Flory-Huggins energy potential. The numerical scheme has been recently proposed, and the positivity-preserving property of the logarithmic arguments, as well as the total energy stability, have been theoretically justified. In this paper, we rigorously prove second order convergence of the proposed numerical scheme, in both time and space. Since the CHNS is a coupled system, the standard $\ell^\infty (0, T; \ell^2) \cap \ell^2 (0, T; H_h^2)$ error estimate could not be easily derived, due to the lack of regularity to control the numerical error associated with the coupled terms. Instead, the $\ell^\infty (0, T; H_h^1) \cap \ell^2 (0, T; H_h^3)$ error analysis for the phase variable and the $\ell^\infty (0, T; \ell^2)$ analysis for the velocity vector, which shares the same regularity as the energy estimate, is more suitable to pass through the nonlinear analysis for the error terms associated with the coupled physical process. Furthermore, the highly nonlinear and singular nature of the logarithmic error terms makes the convergence analysis even more challenging, since a uniform distance between the numerical solution and the singular limit values of is needed for the associated error estimate. Many highly non-standard estimates, such as a higher order asymptotic expansion of the numerical solution (up to the third order accuracy in time and fourth order in space), combined with a rough error estimate (to establish the maximum norm bound for the phase variable), as well as a refined error estimate, have to be carried out to conclude the desired convergence result.

This paper is concerned with the extraction of the smallest eigenvalue and the corresponding eigenvector of a symmetric positive definite matrix pencil. We reveal implicit convexity of the eigenvalue problem in Euclidean space. A provable accelerated eigensolver based on preconditioning and implicit convexity (EPIC) is proposed. Theoretical analysis shows the acceleration of EPIC with the rate of convergence resembling the expected rate of convergence of the well-known locally optimal preconditioned conjugate gradient (LOPCG). A complete proof of the expected rate of convergence of LOPCG is elusive so far. Numerical results confirm our theoretical findings of EPIC.

In this paper, we propose a Riemannian Acceleration with Preconditioning (RAP) for symmetric eigenvalue problems, which is one of the most important geodesically convex optimization problem on Riemannian manifold, and obtain the acceleration. Firstly, the preconditioning for symmetric eigenvalue problems from the Riemannian manifold viewpoint is discussed. In order to obtain the local geodesic convexity, we develop the leading angle to measure the quality of the preconditioner for symmetric eigenvalue problems. A new Riemannian acceleration, called Locally Optimal Riemannian Accelerated Gradient (LORAG) method, is proposed to overcome the local geodesic convexity for symmetric eigenvalue problems. With similar techniques for RAGD and analysis of local convex optimization in Euclidean space, we analyze the convergence of LORAG. Incorporating the local geodesic convexity of symmetric eigenvalue problems under preconditioning with the LORAG, we propose the Riemannian Acceleration with Preconditioning (RAP) and prove its acceleration. Additionally, when the Schwarz preconditioner, especially the overlapping or non-overlapping domain decomposition method, is applied for elliptic eigenvalue problems, we also obtain the rate of convergence as $1-C\kappa^{-1/2}$, where $C$ is a constant independent of the mesh sizes and the eigenvalue gap, $\kappa=\kappa_{\nu}\lambda_{2}/(\lambda_{2}-\lambda_{1})$, $\kappa_{\nu}$ is the parameter from the stable decomposition, $\lambda_{1}$ and $\lambda_{2}$ are the smallest two eigenvalues of the elliptic operator. Numerical results show the power of Riemannian acceleration and preconditioning., Comment: Due to the limit in abstract of arXiv, the abstract here is shorter than in PDF

In high-speed rotating channels, significant compressive effects are observed, resulting in distinct flow characteristics compared to incompressible flows. In this study, we employed a finite volume method based on the simple algorithm to solve for low-speed compressible laminar flow within rotating channels using an orthogonal uniform grid. The governing equations include the full Navier-Stokes equations and the energy equation. Contrary to stationary channel, the alterations in flow within rotating channel are primarily influenced by the compressive effects of centrifugal force and the compressibility of fluid within the flow's normal section. The first effect involves a reduction in the velocity due to centrifugal force, leading to an increasing influence of the Coriolis force compared to inertial forces along the flow direction. This trend in axial changes aligns closely with the increase in rotation speed. The second effect arises from the increase in Mach number and the Coriolis compression, resulting in slight density differences within the cross-section. Strong centrifugal forces generate significant centrifugal additional force (buoyancy force). Consequently, under the same local rotation number, the velocity profiles of the mainstream experience considerable changes. Additionally, higher Mach number significantly impact wall shear stress, with the leading side being notably affected. For instance, at a cross-sectional Ro = 0.6 and Ma = 0.035, the dimensionless shear stress on the leading side decreased by 13%. Furthermore, while an increase in Mach number has minimal impact on the cross-sectional secondary flow structure, changes in mainstream velocity profiles influence secondary flow intensity, resulting in an enhanced velocity peak and a shift towards the trailing side.

In the study of rotating channel flow, the key dimensionless parameters typically include the Reynolds number, rotation number, Prandtl number and buoyancy number. Our research focused on comparing the flow characteristics between the enlarged model, analyzed under the rotating similarity theory, and the original channel flow. Significantly different flow behaviors were observed between these two cases. Through theoretical derivation and dimensional analysis, we identified a new significant parameter - the centrifugal work number (CW). This parameter characterizes the ratio of centrifugal work to gas enthalpy in the rotating channel and plays a crucial role in measuring the compressibility of fluids within the rotating channel. Additionally, we utilized large eddy simulation(LES) to validate the impact of the centrifugal work ratio on the flow state of the rotating channel, thus enhancing the similarity theory of rotating channel compressible flow., Comment: 14 pages, 8 figures

The Keller-Segel equations are widely used for describing chemotaxis in biology. Recently, a new fully discrete scheme for this model was proposed in [46], mass conservation, positivity and energy decay were proved for the proposed scheme, which are important properties of the original system. In this paper, we establish the error estimates of this scheme. Then, based on the error estimates, we derive the finite-time blowup of nonradial numerical solutions under some conditions on the mass and the moment of the initial data.

We propose and analyze a first-order finite difference scheme for the functionalized Cahn-Hilliard (FCH) equation with a logarithmic Flory-Huggins potential. The semi-implicit numerical scheme is designed based on a suitable convex-concave decomposition of the FCH free energy. We prove unique solvability of the numerical algorithm and verify its unconditional energy stability without any restriction on the time step size. Thanks to the singular nature of the logarithmic part in the Flory-Huggins potential near the pure states $\pm 1$, we establish the so-called positivity-preserving property for the phase function at a theoretic level. As a consequence, the numerical solutions will never reach the singular values $\pm 1$ in the point-wise sense and the fully discrete scheme is well defined at each time step. Next, we present a detailed optimal rate convergence analysis and derive error estimates in $l^{\infty}(0,T;L_h^2)\cap l^2(0,T;H^3_h)$ under a linear refinement requirement $\Delta t\leq C_1 h$. To achieve the goal, a higher order asymptotic expansion (up to the second order temporal and spatial accuracy) based on the Fourier projection is utilized to control the discrete maximum norm of solutions to the numerical scheme. We show that if the exact solution to the continuous problem is strictly separated from the pure states $\pm 1$, then the numerical solutions can be kept away from $\pm 1$ by a positive distance that is uniform with respect to the size of the time step and the grid. Finally, a few numerical experiments are presented. Convergence test is performed to demonstrate the accuracy and robustness of the proposed numerical scheme. Pearling bifurcation, meandering instability and spinodal decomposition are observed in the numerical simulations., Comment: 46 pages, 11 figures. The linear refinement condition on the time step for the optimal rate convergence analysis was improved. Typos were fixed

Failure management plays a significant role in optical networks. It ensures secure operation, mitigates potential risks, and executes proactive protection. Machine learning (ML) is considered to be an extremely powerful technique for performing comprehensive data analysis and complex network management and is widely utilized for failure management in optical networks to revolutionize the conventional manual methods. In this study, the background of failure management is introduced, where typical failure tasks, physical objects, ML algorithms, data source, and extracted information are illustrated in detail. An overview of the applications of ML in failure management is provided in terms of alarm analysis, failure prediction, failure detection, failure localization, and failure identification. Finally, the future directions on ML for failure management are discussed from the perspective of data, model, task, and emerging techniques.

In this paper, we consider the Newton-Schur method in Hilbert space and obtain quadratic convergence. For the symmetric elliptic eigenvalue problem discretized by the standard finite element method and non-overlapping domain decomposition method, we use the Steklov-Poincar\'e operator to reduce the eigenvalue problem on the domain $\Omega$ into the nonlinear eigenvalue subproblem on $\Gamma$, which is the union of subdomain boundaries. We prove that the convergence rate for the Newton-Schur method is $\epsilon_{N}\leq CH^{2}(1+\ln(H/h))^{2}\epsilon^{2}$, where the constant $C$ is independent of the fine mesh size $h$ and coarse mesh size $H$, and $\epsilon_{N}$ and $\epsilon$ are errors after and before one iteration step respectively. Numerical experiments confirm our theoretical analysis.

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 $\alpha>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 $\alpha\ge 1$. It is a little surprising to see that even the lowest-order WG-MFEM ($\alpha=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 $\alpha$. Numerical results further confirm this conclusion.

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.

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.

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.

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., Comment: 10 pages, 4 figures

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\tau^k\frac{\partial}{\partial t}\mathcal{L}^{p(k)}u$ where $\mathcal{L}$ is the positive definite linear part of the flow, $\tau$ 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.

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., Comment: Accepted for publication in IEEE Journal of Selected Topics in Signal Processing (J-STSP). arXiv admin note: text overlap with arXiv:1809.10711

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.

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., Comment: 29 pages

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., Comment: 33 pages,6 figures

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., Comment: In ICCV 2019 Workshops. Winner of Perceptual track in AIM Extreme Super-Resolution Challenge 2019. Code available at https://github.com/pnavarre/mgbpv2

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\tau^2\frac{\partial\Delta^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.