Searcharxiv⌕ Search

arXiv subjects

Shi Shu

Publications and source records attributed to Shi Shu.

At least 37 records · Page 2Linked to original sources

Solving time-dependent parametric PDEs by multiclass classification-based reduced order model

In this paper, we propose a network model, the multiclass classification-based reduced order model (MC-ROM), for solving time-dependent parametric partial differential equations (PPDEs). This work is inspired by the observation of applying the deep learning-based reduced order model (DL-ROM) to solve diffusion-dominant PPDEs. We find that the DL-ROM has a good approximation for some special model parameters, but it cannot approximate the drastic changes of the solution as time evolves. Based on this fact, we classify the dataset according to the magnitude of the solutions and construct corresponding subnets dependent on different types of data. Then we train a classifier to integrate different subnets together to obtain the MC-ROM. When subsets have the same architecture, we can use transfer learning techniques to accelerate offline training. Numerical experiments show that the MC-ROM improves the generalization ability of the DL-ROM both for diffusion- and convection-dominant problems, and maintains the DL-ROM's advantage of good approximation ability. We also compare the approximation accuracy and computational efficiency of the proper orthogonal decomposition (POD) which is not suitable for convection-dominant problems. For diffusion-dominant problems, the MC-ROM has better approximation accuracy than the POD in a small dimensionality reduction space, and its computational performance is more efficient than the POD.

math.NA↗

Fourier Neural Solver for large sparse linear algebraic systems

Large sparse linear algebraic systems can be found in a variety of scientific and engineering fields, and many scientists strive to solve them in an efficient and robust manner. In this paper, we propose an interpretable neural solver, the Fourier Neural Solver (FNS), to address them. FNS is based on deep learning and Fast Fourier transform. Because the error between the iterative solution and the ground truth involves a wide range of frequency modes, FNS combines a stationary iterative method and frequency space correction to eliminate different components of the error. Local Fourier analysis reveals that the FNS can pick up on the error components in frequency space that are challenging to eliminate with stationary methods. Numerical experiments on the anisotropy diffusion equation, convection-diffusion equation, and Helmholtz equation show that FNS is more efficient and more robust than the state-of-the-art neural solver.

math.NA↗

Parallel Multi-Stage Preconditioners with Adaptive Setup for the Black Oil Model

The black oil model is widely used to describe multiphase porous media flow in the petroleum industry. The fully implicit method features strong stability and weak constraints on time step-sizes; hence, commonly used in the current mainstream commercial reservoir simulators. In this paper, a CPR-type preconditioner with an adaptive "setup phase" is developed to improve parallel efficiency of petroleum reservoir simulation. Furthermore, we propose a multi-color Gauss-Seidel (GS) algorithm for algebraic multigrid method based on the coefficient matrix of strong connections. Numerical experiments show that the proposed preconditioner can improve the parallel performance for both OpenMP and CUDA implements. Moreover, the proposed algorithm yields good parallel speedup as well as same convergence behavior as the corresponding single-threaded algorithm. In particular, for a three-phase benchmark problem, the parallel speedup of the OpenMP version is over 6.5 with 16 threads and the CUDA version reaches more than 9.5.

math.NA↗

An Improved Multi-Stage Preconditioner on GPUs for Compositional Reservoir Simulation

The compositional model is often used to describe multicomponent multiphase porous media flows in the petroleum industry. The fully implicit method with strong stability and weak constraints on time-step sizes is commonly used in the mainstream commercial reservoir simulators. In this paper, we develop an efficient multi-stage preconditioner for the fully implicit compositional flow simulation. The method employs an adaptive setup phase to improve the parallel efficiency on GPUs. Furthermore, a multi-color Gauss-Seidel algorithm based on the adjacency matrix is applied in the algebraic multigrid methods for the pressure part. Numerical results demonstrate that the proposed algorithm achieves good parallel speedup while yields the same convergence behavior as the corresponding sequential version.

math.NA↗

Error Analysis of Virtual Element Methods for the Time-dependent Poisson-Nernst-Planck Equations

We discuss and analyze the virtual element method on general polygonal meshes for the time-dependent Poisson-Nernst-Planck equations, which are a nonlinear coupled system widely used in semiconductors and ion channels. The spatial discretization is based on the elliptic projection and the $L^2$ projection operator, and for the temporal discretization, the backward Euler scheme is employed. After presenting the semi and fully discrete schemes, we derive the a priori error estimates in the $L^2$ and $H^1$ norms. Finally, a numerical experiment verifies the theoretical convergence results.

math.NA↗

Two-level overlapping Schwarz methods based on local generalized eigenproblems for Hermitian variational problems

The research of two-level overlapping Schwarz (TL-OS) method based on constrained energy minimizing coarse space is still in its infancy, and there exist some defects, e.g. mainly for second order elliptic problem and too heavy computational cost of coarse space construction. In this paper, by introducing appropriate assumptions, we propose more concise coarse basis functions for general Hermitian positive and definite discrete systems, and establish the algorithmic and theoretical frameworks of the corresponding TL-OS methods. Furthermore, to enhance the practicability of the algorithm, we design two economical TL-OS preconditioners and prove the condition number estimate. As the first application of the frameworks, we prove that the assumptions hold for the linear finite element discretization of second order elliptic problem with high contrast and oscillatory coefficient and the condition number of the TL-OS preconditioned system is robust with respect to the model and mesh parameters. In particular, we also prove that the condition number of the economically preconditioned system is independent of the jump range under a certain jump distribution. Experimental results show that the first kind of economical preconditioner is more efficient and stable than the existed one. Secondly, we construct TL-OS and the economical TL-OS preconditioners for the plane wave least squares discrete system of Helmholtz equation by using the frameworks. The numerical results for homogeneous and non-homogeneous cases illustrate that the PCG method based on the proposed preconditioners have good stability in terms of the angular frequency, mesh parameters and the number of degrees of freedom in each element.

math.NA↗

A multigrid-reduction-in-time solver with a new two-level convergence for unsteady fractional Laplacian problems

The multigrid-reduction-in-time (MGRIT) technique has proven to be successful in achieving higher run-time speedup by exploiting parallelism in time. The goal of this article is to develop and analyze a MGRIT algorithm, using FCF-relaxation with time-dependent time-grid propagators, to seek the finite element approximations of unsteady fractional Laplacian problems. The multigrid with line smoother proposed in [L. Chen, R. H. Nochetto, E. Ot{á}rola, A. J. Salgado, Math. Comp. 85 (2016) 2583--2607] is chosen to be the spatial solver. Motivated by [B. S. Southworth, SIAM J. Matrix Anal. Appl. 40 (2019) 564--608], we provide a new temporal eigenvalue approximation property and then deduce a generalized two-level convergence theory which removes the previous unitary diagonalization assumption on the fine and coarse time-grid propagators required in [X. Q. Yue, S. Shu, X. W. Xu, W. P. Bu, K. J. Pan, Comput. Math. Appl. 78 (2019) 3471--3484]. Numerical computations are included to confirm the theoretical predictions and demonstrate the sharpness of the derived convergence upper bound.

math.NA↗

Matter flow method for alleviating checkerboard oscillations in triangular mesh SGH Lagrangian simulation

When the SGH Lagrangian based on triangle mesh is used to simulate compressible hydrodynamics, because of the stiffness of triangular mesh, the problem of physical quantity cell-to-cell spatial oscillation (also called "checkerboard oscillation") is easy to occur. A matter flow method is proposed to alleviate the oscillation of physical quantities caused by triangular stiffness. The basic idea of this method is to attribute the stiffness of triangle to the fact that the edges of triangle mesh can not do bending motion, and to compensate the effect of triangle edge bending motion by means of matter flow. Three effects are considered in our matter flow method: (1) transport of the mass, momentum and energy carried by the moving matter; (2) the work done on the element, since the flow of matter changes the specific volume of the grid element; (3) the effect of matter flow on the strain rate in the element. Numerical experiments show that the proposed matter flow method can effectively alleviate the spatial oscillation of physical quantities.

physics.comp-ph↗

Algebraic multigrid block preconditioning for multi-group radiation diffusion equations

The paper focuses on developing and studying efficient block preconditioners based on classical algebraic multigrid for the large-scale sparse linear systems arising from the fully coupled and implicitly cell-centered finite volume discretization of multi-group radiation diffusion equations, whose coefficient matrices can be rearranged into the $(G+2)\times(G+2)$ block form, where $G$ is the number of energy groups. The preconditioning techniques are based on the monolithic classical algebraic multigrid method, physical-variable based coarsening two-level algorithm and two types of block Schur complement preconditioners. The classical algebraic multigrid is applied to solve the subsystems that arise in the last three block preconditioners. The coupling strength and diagonal dominance are further explored to improve performance. We use representative one-group and twenty-group linear systems from capsule implosion simulations to test the robustness, efficiency, strong and weak parallel scaling properties of the proposed methods. Numerical results demonstrate that block preconditioners lead to mesh- and problem-independent convergence, and scale well both algorithmically and in parallel.

math.NA↗

Adaptive-Multilevel BDDC algorithm for three-dimensional plane wave Helmholtz systems

In this paper, we are concerned with the weighted plane wave least-squares (PWLS) method for three-dimensional Helmholtz equations, and develop the multi-level adaptive BDDC algorithms for solving the resulting discrete system. In order to form the adaptive coarse components, the local generalized eigenvalue problems for each common face and each common edge are carefully designed. The condition number of the two-level adaptive BDDC preconditioned system is proved to be bounded above by a user-defined tolerance and a constant which is dependent on the maximum number of faces and edges per subdomain and the number of subdomains sharing a common edge. The efficiency of these algorithms is illustrated on a benchmark problem. The numerical results show the robustness of our two-level adaptive BDDC algorithms with respect to the wave number, the number of subdomains and the mesh size, and illustrate that our multi-level adaptive BDDC algorithm can reduce the scale of the coarse problem and can be used to solve large wave number problems efficiently.

math.NA↗

A Dynamic Subspace Based BFGS Method for Large Scale Optimization Problem

Large-scale unconstrained optimization is a fundamental and important class of, yet not well-solved problems in numerical optimization. The main challenge in designing an algorithm is to require a few storage locations or very inexpensive computations while preserving global convergence. In this work, we propose a novel approach solving large-scale unconstrained optimization problem by combining the dynamic subspace technique and the BFGS update algorithm. It is clearly demonstrated that our approach has the same rate of convergence in the dynamic subspace as the BFGS and less memory than L-BFGS. Further, we give the convergence analysis by constructing the mapping of low-dimensional Euclidean space to the adaptive subspace. We compare our hybrid algorithm with the BFGS and L-BFGS approaches. Experimental results show that our hybrid algorithm offers several significant advantages such as parallel computing, convergence efficiency, and robustness.

math.OC↗

Local Averaging Type a Posteriori Error Estimates for the Nonlinear Steady-state Poisson-Nernst-Planck Equations

The a posteriori error estimates are studied for a class of nonlinear stead-state Poisson-Nernst-Planck equations, which are a coupled system consisting of the Nernst-Planck equation and the Poisson equation. Both the global upper bounds and the local lower bounds of the error estimators are obtained by using a local averaging operator. Numerical experiments are given to confirm the reliability and efficiency of the error estimators.

math.NA↗

SVGD: A Virtual Gradients Descent Method for Stochastic Optimization

Inspired by dynamic programming, we propose Stochastic Virtual Gradient Descent (SVGD) algorithm where the Virtual Gradient is defined by computational graph and automatic differentiation. The method is computationally efficient and has little memory requirements. We also analyze the theoretical convergence properties and implementation of the algorithm. Experimental results on multiple datasets and network models show that SVGD has advantages over other stochastic optimization methods.

cs.LG↗

A Decoupling Two-grid Method for the Time-dependent Poisson-Nernst-Planck Equations

We study a two-grid strategy for decoupling the time-dependent Poisson-Nernst-Planck equations describing the mass concentration of ions and the electrostatic potential. The computational system is decoupled to smaller systems by using coarse space solutions at each time level, which can speed up the solution process compared with the finite element method combined with the Gummel iteration. We derive the optimal error estimates in $L^2$ norm for both semi- and fully discrete finite element approximations. Based on the a priori error estimates, the error estimates in $H^1$ norm are presented for the two-grid algorithm. The theoretical results indicate this decoupling method can retain the same accuracy as the finite element method. Numerical experiments including the Poisson-Nernst-Planck equations for an ion channel show the efficiency and effectiveness of the decoupling two-grid method.

math.NA↗

Adaptive BDDC algorithms for the system arising from plane wave discretization of Helmholtz equations

Balancing domain decomposition by constraints (BDDC) algorithms with adaptive primal constraints are developed in a concise variational framework for the weighted plane wave least-squares (PWLS) discritization of Helmholtz equations with high and various wave numbers. The unknowns to be solved in this preconditioned system are defined on elements rather than vertices or edges, which are different from the well-known discritizations such as the classical finite element method. Through choosing suitable "interface" and appropriate primal constraints with complex coefficients and introducing some local techniques, we developed a two-level adaptive BDDC algorithm for the PWLS discretization, and the condition number of the preconditioned system is proved to be bounded above by a user-defined tolerance and a constant which is only dependent on the maximum number of interfaces per subdomain. A multilevel algorithm is also attempted to resolve the bottleneck in large scale coarse problem. Numerical results are carried out to confirm the theoretical results and illustrate the efficiency of the proposed algorithms.

math.NA↗

Parallel-in-Time with Fully Finite Element Multigrid for 2-D Space-fractional Diffusion Equations

The paper investigates a non-intrusive parallel time integration with multigrid for space-fractional diffusion equations in two spatial dimensions. We firstly obtain a fully discrete scheme via using the linear finite element method to discretize spatial and temporal derivatives to propagate solutions. Next, we present a non-intrusive time-parallelization and its two-level convergence analysis, where we algorithmically and theoretically generalize the MGRIT to time-dependent fine time-grid propagators. Finally, numerical illustrations show that the obtained numerical scheme possesses the saturation error order, theoretical results of the two-level variant deliver good predictions, and significant speedups can be achieved when compared to parareal and the sequential time-stepping approach.

math.NA↗

Time-space Finite Element Adaptive AMG for Multi-term Time Fractional Advection Diffusion Equations

In this study we construct a time-space finite element (FE) scheme and furnish cost-efficient approximations for one-dimensional multi-term time fractional advection diffusion equations on a bounded domain $Ω$. Firstly, a fully discrete scheme is obtained by the linear FE method in both temporal and spatial directions, and many characterizations on the resulting matrix are established. Secondly, the condition number estimation is proved, an adaptive algebraic multigrid (AMG) method is further developed to lessen computational cost and analyzed in the classical framework. Finally, some numerical experiments are implemented to reach the saturation error order in the $L^2(Ω)$ norm sense, and present theoretical confirmations and predictable behaviors of the proposed algorithm.

math.NA↗

Fully Finite Element Adaptive Algebraic Multigrid Method for Time-Space Caputo-Riesz Fractional Diffusion Equations

The paper aims to establish a fully discrete finite element (FE) scheme and provide cost-effective solutions for one-dimensional time-space Caputo-Riesz fractional diffusion equations on a bounded domain $Ω$. Firstly, we construct a fully discrete scheme of the linear FE method in both temporal and spatial directions, derive many characterizations on the coefficient matrix and numerically verify that the fully FE approximation possesses the saturation error order under $L^2(Ω)$ norm. Secondly, we theoretically prove the estimation $1+\mathcal{O}(τ^αh^{-2β})$ on the condition number of the coefficient matrix, in which $τ$ and $h$ respectively denote time and space step sizes. Finally, on the grounds of the estimation and fast Fourier transform, we develop and analyze an adaptive algebraic multigrid (AMG) method with low algorithmic complexity, reveal a reference formula to measure the strength-of-connection tolerance which severely affect the robustness of AMG methods in handling fractional diffusion equations, and illustrate the well robustness and high efficiency of the proposed algorithm compared with the classical AMG, conjugate gradient and Jacobi iterative methods.

math.NA↗