Analysis and computational method based on quadratic B‐spline FEM for the Rosenau–Burgers equation

L_∞‐error estimates for B‐spline Galerkin finite element solution of the Rosenau–Burgers equation are considered. The semidiscrete B‐spline Galerkin scheme is studied using appropriate projections. For fully discrete B‐spline Galerkin scheme, we consider the Crank–Nicolson method and analyze the corresponding error estimates in time. Numerical experiments are given to demonstrate validity and order of accuracy of the proposed method. © 2015 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 32: 877–895, 2016     

Methods for the numerical solution of the Benjamin‐Bona‐Mahony‐Burgers equation

L^∞‐error estimates for finite element for Galerkin solutions for the Benjamin‐Bona‐Mahony‐Burgers (BBMB) equation are considered. A priori bound and the semidiscrete Galerkin scheme are studied using appropriate projections. For fully discrete Galerkin schemes, we consider the backward Euler method and analyze the corresponding error estimates. For a second order accuracy in time, we propose a three‐level backward method. © 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2008     

Sliding mode control of the forced generalized Burgers equation

^** Email: smaoui{at}mcs.sci.kuniv.edu.kw This paper deals with the sliding mode control (SMC) of theforced generalized Burgers equation via the Karhunen-Loève(K-L) Galerkin method. The decomposition procedure of the K-Lmethod is presented to illustrate the use of this method inanalysing the numerical simulations data which represent thesolutions of the forced generalized Burgers equation for viscosityranging from 1 to 100. The K-L Galerkin projection is used asa model reduction technique for non-linear systems to derivea system of ordinary differential equations (ODEs) that mimicsthe dynamics of the forced generalized Burgers equation. Thedata coefficients derived from the ODE system are then usedto approximate the solutions of the forced Burgers equation.Finally, static and dynamic SMC schemes with the objective ofenhancing the stability of the forced generalized Burgers equationare proposed. Simulations of the controlled system are givento illustrate the developed theory.     

Numerical solutions of the coupled Burgers’ equation by the Galerkin quadratic B‐spline finite element method

In this paper, a coupled Burgers’ equation has been numerically solved by a Galerkin quadratic B‐spline FEM. The performance of the method has been examined on three test problems. Results obtained by the method have been compared with known exact solution and other numerical results in the literature. A Fourier stability analysis of the method is also investigated. Copyright © 2013 John Wiley & Sons, Ltd.     

Taylor–Galerkin and Taylor-collocation methods for the numerical solutions of Burgers’ equation using B-splines

In this paper, for the numerical solution of Burgers’ equation, we give two B-spline finite element algorithms which involve a collocation method with cubic B-splines and a Galerkin method with quadratic B-splines. In time discretization of the equation, Taylor series expansion is used. In order to verify the stabilities of the purposed methods, von-Neumann stability analysis is employed. To see the accuracy of the methods, L₂ and L_∞ error norms are calculated and obtained results are compared with some earlier studies.     

Numerical study using explicit multistep Galerkin finite element method for the MRLW equation

In this article, an explicit multistep Galerkin finite element method for the modified regularized long wave equation is studied. The discretization of this equation in space is by linear finite elements, and the time discretization is based on explicit multistep schemes. Stability analysis and error estimates of our numerical scheme are derived. Numerical experiments indicate the validation of the scheme by L₂– and L_∞– error norms and three invariants of motion.4 © 2015 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 31: 1875–1889, 2015     

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.     

Time accurate fast wavelet‐Taylor Galerkin method for partial differential equations

We introduce the concept of fast wavelet‐Taylor Galerkin methods for the numerical solution of partial differential equations. In wavelet‐Taylor Galerkin method discretization in time is performed before the wavelet based spatial approximation by introducing accurate generalizations of the standard Euler, θ and leap‐frog time‐stepping scheme with the help of Taylor series expansions in the time step. We will present two different time‐accurate wavelet schemes to solve the PDEs. First, numerical schemes taking advantage of the wavelet bases capabilities to compress the operators and sparse representation of functions which are smooth, except for in localized regions, up to any given accuracy are presented. Here numerical experiments deal with advection equation with the spiky solution in one dimension, two dimensions, and nonlinear equation with a shock in solution in two dimensions. Second, our schemes deal with more regular class of problems where wavelets are not efficient procedure for data compression but we can use the good approximation properties of wavelet. Here time‐accurate schemes lead to consistent mass matrix in an explicit time stepping, which can be solved by approximate factorization techniques. Numerical experiment deals with more regular class of problems like heat equation as well as coupled linear system in two dimensions. © 2005 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2006     

Numerical solution of the Burgers’ equation by local discontinuous Galerkin method

In this paper, the Burgers’ equation is transformed into the linear diffusion equation by using the Hopf–Cole transformation. The obtained linear diffusion equation is discretized in space by the local discontinuous Galerkin method. The temporal discretization is accomplished by the total variation diminishing Runge–Kutta method. Numerical solutions are compared with the exact solution and the numerical solutions obtained by Adomian’s decomposition method, finite difference method, B-spline finite element method and boundary element method. The results show that the local discontinuous Galerkin method is one of the most efficient methods for solving the Burgers’ equation. Even with small viscosity coefficient, it can get the satisfied solution.     

A fast numerical method for harmonic equation based on natural boundary integral

Based on the coupling of the natural boundary integral method and the finite elements method, we mainly investigate the numerical solution of Neumann problem of harmonic equation in an exterior elliptic. Using our trigonometric wavelets and Galerkin method, there obtained stiffness matrix is symmetrical and circulant, which lead us to a fast numerical method based on fast Fourier transform. Furthermore, we do not need to compute the entries of the stiffness matrix. On the other hand, we prove that the numerical solution possesses exponential convergence rate. Especially, examples state that our method still has good accuracy for small j when the solution u ₀(θ) is almost singular.     

A local hybrid kernel meshless method for numerical solutions of two-dimensional fractional cable equation in neuronal dynamics

This study deals with obtaining numerical solutions of two-dimensional (2D) fractional cable equation in neuronal dynamics by using a recently introduced meshless method. In solution process at first stage, time derivatives that are appeared in the considered problem are discretized by using finite difference method. Then a meshless method based on hybridization of Gaussian and cubic kernels is developed in local fashion. The problem is solved both on regular and irregular domians. L_∞ and RMS error norms are calculated and compared with other numerical methods in literature as well as exact solutions. Also, obtained condition numbers are monitored. Numerical simulations show that local hybrid kernel meshless method is a thriving method for solving 2D fractional cable equation on regular and irregular domians.     

A Legendre–Galerkin Chebyshev collocation method for the Burgers equation with a random perturbation on boundary condition

In the paper, we apply the generalized polynomial chaos expansion and spectral methods to the Burgers equation with a random perturbation on its left boundary condition. Firstly, the stochastic Galerkin method combined with the Legendre–Galerkin Chebyshev collocation scheme is adopted, which means that the original equation is transformed to the deterministic nonlinear equations by the stochastic Galerkin method and the Legendre–Galerkin Chebyshev collocation scheme is used to deal with the resulting nonlinear equations. Secondly, the stochastic Legendre–Galerkin Chebyshev collocation scheme is developed for solving the stochastic Burgers equation; that is, the stochastic Legendre–Galerkin method is used to discrete the random variable meanwhile the nonlinear term is interpolated through the Chebyshev–Gauss points. Then a set of deterministic linear equations can be obtained, which is in contrast to the other existing methods for the stochastic Burgers equation. The mean square convergence of the former method is analyzed. Numerical experiments are performed to show the effectiveness of our two methods. Both methods provide alternative approaches to deal with the stochastic differential equations with nonlinear terms.     

Weak Galerkin finite element methods for a fourth order parabolic equation

This paper is devoted to a newly developed weak Galerkin finite element method with the stabilization term for a linear fourth order parabolic equation, where weakly defined Laplacian operator over discontinuous functions is introduced. Priori estimates are developed and analyzed in L² and an H² type norm for both semi‐discrete and fully discrete schemes. And finally, numerical examples are provided to confirm the theoretical results.     

Solving the Laplace-Beltrami equation on S2 using spherical triangles

The geometry of the domain −S², causes difficulty in solving the Laplace-Beltrami Equation, for example, in discretization for the differential equation. To overcome this problem, we study a numerical method, which is based on the finite element approximation with a hierarchical refinement of icosahedron for the grid. We construct a geometrically intrinsic base vector field for the Galerkin approximation. In this way, no artificial poles are introduced, and the numerical grids are distributed more evenly. We use radial projection to map the curved triangle onto a flat one, so that existing quadrature schemes can be applied for the numerical integration. The resulting system of linear algebraic equations is solved by using a conjugate gradient method. © 1996 John Wiley & Sons, Inc.     

Approximate inertial manifolds of Burgers equation approached by nonlinear Galerkin’s procedure and its application

The approximate inertial manifolds (AIMs) of Burgers equation is approached by nonlinear Galerkin methods, and it can be used to capture and study the shock wave numerically in a reduced system with low dimension. Following inertial manifolds, the asymptotic behavior of Burgers equation, an infinite dimensional dissipative dynamic systems, will evolve to a compact set known as a global attractor, which is finite-dimensional, and the nonlinear phenomena are included and captured in such global attractor. In the application, nonlinear Galerkin methods is introduced to approach such inertial manifolds. By this method, the solution of the original system is projected onto the complete space spanned by the eigenfunctions or the modes of the linear operator of Burgers equation, and nonlinear Galerkin method splits the infinite-dimensional phase space into two complementary subspaces: a finite-dimensional one and its infinite-dimensional complement. Then, the post-processed Galerkin’s procedure is used to approximate the solution of the reduced system, with the introduction of the interaction between lower and higher modes. Additionally, some numerical examples are presented to make a comparison between the traditional Galerkin method and nonlinear Galerkin method, in particular, some sharp jumping phenomena, which are related to the shock wave, have been captured by the numerical method presented. As the conclusion, it can be drawn that it is possible to completely describe the dynamics on the attractor of a nonlinear partial differential equation (PDE) with a finite-dimensional dynamical system, and the study can provide a numerical method for the analysis of the nonlinear continuous dynamic systems and complicated nonlinear phenomena in finite-dimensional dynamic system, whose nonlinear dynamics has been developed completely compared with infinite-dimensional dynamic system.     

A multiscale Galerkin method for the hypersingular integral equation reduced by the harmonic equation

The aim of this paper is to investigate the numerical solution of the hypersingular integral equation reduced by the harmonic equation. First, we transform the hypersingular integral equation into 2π-periodic hypersingular integral equation with the map x=cot(θ/2). Second, we initiate the study of the multiscale Galerkin method for the 2π-periodic hypersingular integral equation. The trigonometric wavelets are used as trial functions. Consequently, the 2j+1 × 2j+1 stiffness matrix Kj can be partitioned j×j block matrices. Furthermore, these block matrices are zeros except main diagonal block matrices. These main diagonal block matrices are symmetrical and circulant matrices, and hence the solution of the associated linear algebraic system can be solved with the fast Fourier transform and the inverse fast Fourier transform instead of the inverse matrix. Finally, we provide several numerical examples to demonstrate our method has good accuracy even though the exact solutions are multi-peak and almost singular.     

OPTIMIZATION APPROACH FOR THE MONGE-AMPèRE EQUATION

In this paper, we introduce and study a method for the numerical solution of the elliptic Monge-Ampère equation with Dirichlet boundary conditions. We formulate the Monge-Ampère equation as an optimization problem. The latter involves a Poisson Problem which is solved by the finite element Galerkin method and the minimum is computed by the conjugate gradient algorithm. We also present some numerical experiments.     

Stability and convergence of the spectral Galerkin method for the Cahn‐Hilliard equation

A spectral Galerkin method in the spatial discretization is analyzed to solve the Cahn‐Hilliard equation. Existence, uniqueness, and stabilities for both the exact solution and the approximate solution are given. Using the theory and technique of a priori estimate for the partial differential equation, we obtained the convergence of the spectral Galerkin method and the error estimate between the approximate solution u_N(t) and the exact solution u(t). © 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2008     

Operator time‐splitting techniques combined with quintic B‐spline collocation method for the generalized Rosenau–KdV equation

In this article, the generalized Rosenau–KdV equation is split into two subequations such that one is linear and the other is nonlinear. The resulting subequations with the prescribed initial and boundary conditions are numerically solved by the first order Lie–Trotter and the second‐order Strang time‐splitting techniques combined with the quintic B‐spline collocation by the help of the fourth order Runge–Kutta (RK‐4) method. To show the accuracy and reliability of the proposed techniques, two test problems having exact solutions are considered. The computed error norms L₂ and L_∞ with the conservative properties of the discrete mass Q(t) and energy E(t) are compared with those available in the literature. The convergence orders of both techniques have also been calculated. Moreover, the stability analyses of the numerical schemes are investigated.     

Splitting method for an inverse source problem in parabolic differential equations: Error analysis and applications

In this work, we present a numerical method based on a splitting algorithm to find the solution of an inverse source problem with the integral condition. The source term is reconstructed by using the specified data and by employing the Lie splitting method, we decompose the equation into linear and nonlinear parts. Each subproblem is solved by the Fourier transform and then by combining the solutions of subproblems, the solution of the original problem is computed. Moreover, the framework of strongly continuous semigroup (or C₀-semigroup) is employed in error analysis of operator splitting method for the inverse problem. The convergence of the proposed method is also investigated and proved. Finally, some numerical examples in one, two, and three-dimensional spaces are provided to confirm the efficiency and capability of our work compared with some other well-known methods.