Numerical and theoretical study of weak Galerkin finite element solutions of Turing patterns in reaction–diffusion systems

In this paper, we introduce numerical schemes and their analysis based on weak Galerkin finite element framework for solving 2‐D reaction–diffusion systems. Weak Galerkin finite element method (WGFEM) for partial differential equations relies on the concept of weak functions and weak gradients, in which differential operators are approximated by weak forms through the Green's theorem. This method allows the use of totally discontinuous functions in the approximation space. In the current work, the WGFEM solves reaction–diffusion systems to find unknown concentrations (u, v) in element interiors and boundaries in the weak Galerkin finite element space WG(P₀, P₀, RT₀) . The WGFEM is used to approximate the spatial variables and the time discretization is made by the backward Euler method. For reaction–diffusion systems, stability analysis and error bounds for semi‐discrete and fully discrete schemes are proved. Accuracy and efficiency of the proposed method successfully tested on several numerical examples and obtained results satisfy the well‐known result that for small values of diffusion coefficient, the steady state solution converges to equilibrium point. Acquired numerical results asserted the efficiency of the proposed scheme.     

Wavelet-Taylor Galerkin Method for the Burgers Equation

In this paper, we propose a wavelet-Taylor Galerkin method for the numerical solution of the Burgers equation. In deriving the computational scheme, Taylor-generalized Euler time discretization is performed prior to wavelet-based Galerkin spatial approximation. The linear system of equations obtained in the process are solved by approximate-factorization-based simple explicit schemes, and the resulting solution is compared with that from regular methods. To deal with transient advection-diffusion situations that evolve toward a convective steady state, a splitting-up strategy is known to be very effective. So the Burgers equation is also solved by a splitting-up method using a wavelet-Taylor Galerkin approach. Here, the advection and diffusion terms in the Burgers equation are separated, and the solution is computed in two phases by appropriate wavelet-Taylor Galerkin schemes. Asymptotic stability of all the proposed schemes is verified, and the L_∞ errors relative to the analytical solution together with the numerical solution are reported. AMS subject classification (2000) 65M70     

A Characteristic Finite Volume Element Method for the Air Pollution Model

In this article, a characteristic finite volume element method is presented for solving air pollution models. The convection term is discretized using the characteristic method and diffusion term is approximated by finite volume element method. Compared with standard finite volume element method, our proposed method is more accurate and efficient, especially suitable to solve convection-dominated problems. The proposed numerical schemes are analyzed for convergence in L ₂ norm. Some numerical results are presented to demonstrate the efficiency and accuracy of the method.     

A finite difference analysis of a streamline diffusion method on a Shishkin mesh

We consider streamline diffusion finite element methods applied to a singularly perturbed convection–diffusion two‐point boundary value problem whose solution has a single boundary layer. To analyse the convergence of these methods, we rewrite them as finite difference schemes. We first consider arbitrary meshes, then, in analysing the scheme on a Shishkin mesh, we consider two formulations on the fine part of the mesh: the usual streamline diffusion upwinding and the standard Galerkin method. The error estimates are given in the discrete L _∞ norm; in particular we give the first analysis that shows precisely how the error depends on the user-chosen parameter _τ0 specifying the mesh. When _τ0 is too small, the error becomes O(1), but for _τ0 above a certain threshold value, the error is small and increases either linearly or quadratically as a function of . Numerical tests support our theoretical results. This revised version was published online in August 2006 with corrections to the Cover Date.     

Local discontinuous Galerkin methods with explicit Runge‐Kutta time marching for nonlinear carburizing model

A fully discrete local discontinuous Galerkin (LDG) method coupled with 3 total variation diminishing Runge‐Kutta time‐marching schemes, for solving a nonlinear carburizing model, will be analyzed and implemented in this paper. On the basis of a suitable numerical flux setting in the LDG method, we obtain the optimal error estimate for the Runge‐Kutta–LDG schemes by energy analysis, under the condition τ ≤ λh², where h and τ are mesh size and time step, respectively, λ is a positive constant independent of h. Numerical experiments are presented to verify the accuracy and capability of the proposed schemes. For the carburizing diffusion processes of steel and the diffusion simulation for Cu‐Ni system, the numerical results show good agreement with the experimental results.     

Closed-Loop Control of the Motion of a Sphere Rolling on a Moving Horizontal Plane

A uniform sphere is rolling without slipping on a horizontal plane. The motion of the sphere is controlled via the control of the acceleration of the plane. At the time t=0, the sphere and the plane are stationary and the center of the sphere is located at a point A in the plane. Given a time interval [0, t _f], the problem dealt with here is: Find a closed-loop strategy for the acceleration of the moving plane such that, at the time t=t _f, the plane and the sphere will be nearly at rest and the center of the sphere will be in a given neighborhood of the origin. By introducing the concept of path controllability, a closed-loop strategy for the solution of the above-mentioned problem is proposed and its efficiency is demonstrated by solving numerically some examples.     

A linear system solver based on a modified Krylov subspace method for breakdown recovery

Despite its usefulness in solving eigenvalue problems and linear systems of equations, the nonsymmetric Lanczos method is known to suffer from a potential breakdown problem. Previous and recent approaches for handling the Lanczos exact and near-breakdowns include, for example, the look-ahead schemes by Parlett-Taylor-Liu [23], Freund-Gutknecht-Nachtigal [9], and Brezinski-Redivo Zaglia-Sadok [4]; the combined look-ahead and restart scheme by Joubert [18]; and the low-rank modified Lanczos scheme by Huckle [17]. In this paper, we present yet another scheme based on a modified Krylov subspace approach for the solution of nonsymmetric linear systems. When a breakdown occurs, our approach seeks a modified dual Krylov subspace, which is the sum of the original subspace and a new Krylov subspaceK _m (w _j ,A ^T ) wherew _j is a newstart vector (this approach has been studied by Ye [26] for eigenvalue computations). Based on this strategy, we have developed a practical algorithm for linear systems called the MLAN/QM algorithm, which also incorporates the residual quasi-minimization as proposed in [12]. We present a few convergence bounds for the method as well as numerical results to show its effectiveness.Research supported by Natural Sciences and Engineering Research Council of Canada.     

Second-order schemes for conservation laws with discontinuous flux modelling clarifier–thickener units

Continuously operated clarifier–thickener (CT) units can be modeled by a non-linear, scalar conservation law with a flux that involves two parameters that depend discontinuously on the space variable. This paper presents two numerical schemes for the solution of this equation that have formal second-order accuracy in both the time and space variable. One of the schemes is based on standard total variation diminishing (TVD) methods, and is addressed as a simple TVD (STVD) scheme, while the other scheme, the so-called flux-TVD (FTVD) scheme, is based on the property that due to the presence of the discontinuous parameters, the flux of the solution (rather than the solution itself) has the TVD property. The FTVD property is enforced by a new nonlocal limiter algorithm. We prove that the FTVD scheme converges to a BV _t solution of the conservation law with discontinuous flux. Numerical examples for both resulting schemes are presented. They produce comparable numerical errors, while the FTVD scheme is supported by convergence analysis. The accuracy of both schemes is superior to that of the monotone first-order scheme based on the adaptation of the Engquist–Osher scheme to the discontinuous flux setting of the CT model (Bürger, Karlsen and Towers in SIAM J Appl Math 65:882–940, 2005). In the CT application there is interest in modelling sediment compressibility by an additional strongly degenerate diffusion term. Second-order schemes for this extended equation are obtained by combining either the STVD or the FTVD scheme with a Crank–Nicolson discretization of the degenerate diffusion term in a Strang-type operator splitting procedure. Numerical examples illustrate the resulting schemes.     

Monotone numerical schemes for a Dirichlet problem for elliptic operators in divergence form

We consider a second‐order differential operator A( x )=?∑?_ia_ij( x )?_j+ ∑?_j(b_j( x )·)+c( x ) on ?^d, on a bounded domain D with Dirichlet boundary conditions on ?D, under mild assumptions on the coefficients of the diffusion tensor a_ij. The object is to construct monotone numerical schemes to approximate the solution of the problem A( x )u( x )=µ( x ), x ∈D, where µ is a positive Radon measure. We start by briefly mentioning questions of existence and uniqueness introducing function spaces needed to prove convergence results. Then, we define non‐standard stencils on grid‐knots that lead to extended discretization schemes by matrices possessing compartmental structure. We proceed to discretization of elliptic operators, starting with constant diffusion tensor and ending with operators in divergence form. Finally, we discuss W‐convergence in detail, and mention convergence in C and L₁ spaces. We conclude by a numerical example illustrating the schemes and convergence results. Copyright © 2008 John Wiley & Sons, Ltd.     

Diffusion Approximation in Overloaded Switching Queueing Models

The asymptotic behavior of a queueing process in overloaded state-dependent queueing models (systems and networks) of a switching structure is investigated. A new approach to study fluid and diffusion approximation type theorems (without reflection) in transient and quasi-stationary regimes is suggested. The approach is based on functional limit theorems of averaging principle and diffusion approximation types for so-called Switching processes. Some classes of state-dependent Markov and non-Markov overloaded queueing systems and networks with different types of calls, batch arrival and service, unreliable servers, networks (M _SM,Q /M _SM,Q /1/) ^r switched by a semi-Markov environment and state-dependent polling systems are considered.     

Two‐grid methods for mixed finite‐element solution of coupled reaction‐diffusion systems

We develop 2‐grid schemes for solving nonlinear reaction‐diffusion systems: where p = (p, q) is an unknown vector‐valued function. The schemes use discretizations based on a mixed finite‐element method. The 2‐grid approach yields iterative procedures for solving the nonlinear discrete equations. The idea is to relegate all the Newton‐like iterations to grids much coarser than the final one, with no loss in order of accuracy. The iterative algorithms examined here extend a method developed earlier for single reaction‐diffusion equations. An application to prepattern formation in mathematical biology illustrates the method's effectiveness. © 1999 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 15: 589–604, 1999     

Regularity of solutions to a reaction–diffusion equation on the sphere: the Legendre series approach

In the paper, we study some ‘a priori’ properties of mild solutions to a single reaction–diffusion equation with discontinuous nonlinear reaction term on the two‐dimensional sphere close to its poles. This equation is the counterpart of the well‐studied bistable reaction–diffusion equation on the Euclidean plane. The investigation of this equation on the sphere is mainly motivated by the phenomenon of the fertilization of oocytes or recent studies of wave propagation in a model of immune cells activation, in which the cell is modeled by a ball. Because of the discontinuous nature of reaction kinetics, the standard theory cannot guarantee the solution existence and its smoothness properties. Moreover, the singular nature of the diffusion operator near the north/south poles makes the analysis more involved. Unlike the case in the Euclidean plane, the (axially symmetric) Green's function for the heat operator on the sphere can only be represented by an infinite series of the Legendre polynomials. Our approach is to consider a formal series in Legendre polynomials obtained by assuming that the mild solution exists. We show that the solution to the equation subject to the Neumann boundary condition is C¹ smooth in the spatial variable up to the north/south poles and Hölder continuous with respect to the time variable. Our results provide also a sort of ‘a priori’ estimates, which can be used in the existence proofs of mild solutions, for example, by means of the iterative methods. Copyright © 2017 John Wiley & Sons, Ltd.     

Novel energy stable schemes for Swift-Hohenberg model with quadratic-cubic nonlinearity based on the H−1-gradient flow approach

The Swift-Hohenberg model is a very important phase field crystal model which can be described many crystal phenomena. This model with quadratic-cubic nonlinearity based on the H^??1-gradient flow approach is a sixth-order system which satisfies mass conservation and energy dissipation law. The negative energy of this model will bring huge difficulties to energy stability for many existing approaches. In this paper, we consider two linear, second-order and unconditionally energy stable schemes by linear invariant energy quadratization (LIEQ) and modified scalar auxiliary variable (MSAV) approaches. These two schemes will be effective for all negative E₁. Furthermore, we proved that all the semi-discrete schemes are unconditionally energy stable with respect to a modified energy. Finally, we present various 2D numerical simulations to demonstrate the stability and accuracy.

     

Pinching of the first eigenvalue of the Laplacian and almost-Einstein hypersurfaces of the Euclidean space

In this article, we prove new pinching theorems for the first eigenvalue λ₁(M) of the Laplacian on compact hypersurfaces of the Euclidean space. These pinching results are associated with the upper bound for λ₁(M) in terms of higher order mean curvatures H _k . We show that under a suitable pinching condition, the hypersurface is diffeomorpic and almost-isometric to a standard sphere. Moreover, as a corollary, we show that a hypersurface of the Euclidean space which is almost-Einstein is diffeomorpic and almost-isometric to a standard sphere.      

Consolidation of a poroelastic sphere: Numerical investigations of Cryer's problem

In geomechanics the consolidation of a fluid-saturated soil is of great interest and many theories have been proposed in the recent years. A special case is the consolidation problem in a porous, fluid-saturated sphere under drainage and hydrostatic pressure. For this configuration Cryer [2] discussed the special effect of pore pressure response. We increase the complexity of the classical approach, taking into account a modified sphere with an undrained layer. This modification is an expansion of the original problem towards more realistic situations of a poroelastic rock which contains a heterogeneity (modified Cryer problem). It results in nearly effective drainage for the heterogeneity and significant differences in momentary stress state. The interaction between the skeleton and the pore fluid of the porous sphere is implemented numerically with Biot's theory of linear consolidation in an u _s-p-formulation. (© 2014 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Fourth-order finite difference methods for three-dimensional general linear elliptic problems with variable coefficients

In this article, we give a simple method for deriving finite difference schemes on a uniform cubic grid. We consider a general, three-dimensional, second-order, linear, elliptic partial differential equation with variable coefficients. We derive two simple fourth-order schemes. When the coefficients of the second-order mixed derivatives are equal to zero, the fourth-order scheme requires only 19 grid points. When the coefficients of the mixed derivatives are not equal to zero and the coefficients of U_xx, U_yy, and U_zz are equal, we require the 27 points of the cubic grid. Numerical examples are given to demonstrate the performance of the two schemes derived. There does not exist a fourth-order scheme involving 27 grid points for the general case.     

The isometric extension of “into” mappings on unit spheres of AL -spaces

In this paper, we show that if V ₀ is an isometric mapping from the unit sphere of an AL-space onto the unit sphere of a Banach space E, then V ₀ can be extended to a linear isometry defined on the whole space. This work was supported by the Research Foundation for Doctor Programme (Grant No. 20060055010) and the National Natural Science Foundation of China (Grant No. 10571090)     

A fixed-center spherical separation algorithm with kernel transformations for classification problems

We consider a special case of the optimal separation, via a sphere, of two discrete point sets in a finite dimensional Euclidean space. In fact we assume that the center of the sphere is fixed. In this case the problem reduces to the minimization of a convex and nonsmooth function of just one variable, which can be solved by means of an “ad hoc” method in O(p log p) time, where p is the dataset size. The approach is suitable for use in connection with kernel transformations of the type adopted in the support vector machine (SVM) approach. Despite of its simplicity the method has provided interesting results on several standard test problems drawn from the binary classification literature. This research has been partially supported by the Italian “Ministero dell’Istruzione, dell’Università e della Ricerca Scientifica”, under PRIN project Numerical Methods for Global Optimization and for some classes of Nonsmooth Optimization Problems (2005017083.002).     

Compact high-order finite-element method for elliptic transport problems with variable coefficients

We present a new conforming bilinear Petrov-Galerkin finite-element scheme for elliptic transport problems with variable coefficients. This scheme combines a generalized test function and artificial diffusion to achieve O(h⁴) grid-point accuracy on uniform stencils of 3 × 3 in two dimensions without resorting to the extended stencils of high-order elements. The method is compared with upwind and high-order finite-difference schemes and the standard Galerkin finite-element method for representative test problems. © 1994 John Wiley & Sons, Inc.     

Uniform superconvergence of a Galerkin finite element method on Shishkin‐type meshes

We consider a Galerkin finite element method that uses piecewise bilinears on a class of Shishkin‐type meshes for a model singularly perturbed convection‐diffusion problem on the unit square. The method is shown to be convergent, uniformly in the diffusion parameter ϵ, of almost second order in a discrete weighted energy norm. As a corollary, we derive global L₂‐norm error estimates and local L_∞‐norm estimates. Numerical experiments support our theoretical results. © 2000 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 16:426–440, 2000