A fourth‐order H1‐Galerkin mixed finite element method for Kuramoto–Sivashinsky equation

A H¹‐Galerkin mixed finite element method is applied to the Kuramoto–Sivashinsky equation by using a splitting technique, which results in a coupled system. The method described in this article may also be considered as a Petrov–Galerkin method with cubic spline space as trial space and piecewise linear space as test space, since the second derivative of a cubic spline is a linear spline. Optimal‐order error estimates are obtained without any restriction on the mesh for both semi‐discrete and fully discrete schemes. The advantage of this method over that presented in Manickam et al., Comput. Math. Appl. vol. 35(6) (1998) pp. 5–25; for the same problem is that the size (i.e., (n + 1) × (n + 1)) of each resulting linear system is less than half of the size of the linear system of the earlier method, where n is the number of subintervals in the partition. Further, there is a requirement of less regularity on exact solution in this method. The results are validated with numerical examples. Finally, instability behavior of the solution is numerically captured with this method.     

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.     

Numerical approximation of the generalized regularized long wave equation using Petrov–Galerkin finite element method

The generalized regularized long wave (GRLW) equation has been developed to model a variety of physical phenomena such as ion‐acoustic and magnetohydrodynamic waves in plasma, nonlinear transverse waves in shallow water and phonon packets in nonlinear crystals. This paper aims to develop and analyze a powerful numerical scheme for the nonlinear GRLW equation by Petrov–Galerkin method in which the element shape functions are cubic and weight functions are quadratic B‐splines. The proposed method is implemented to three reference problems involving propagation of the single solitary wave, interaction of two solitary waves and evolution of solitons with the Maxwellian initial condition. The variational formulation and semi‐discrete Galerkin scheme of the equation are firstly constituted. We estimate rate of convergence of such an approximation. Using Fourier stability analysis of the linearized scheme we show that the scheme is unconditionally stable. To verify practicality and robustness of the new scheme error norms L₂, L_∞ and three invariants I₁, I₂, and I₃ are calculated. The computed numerical results are compared with other published results and confirmed to be precise and effective.     

Numerical solution of the Rosenau–KdV–RLW equation by operator splitting techniques based on B‐spline collocation method

In the present study, the operator splitting techniques based on the quintic B‐spline collocation finite element method are presented for calculating the numerical solutions of the Rosenau–KdV–RLW equation. Two test problems having exact solutions have been considered. To demonstrate the efficiency and accuracy of the present methods, the error norms L₂ and L_∞ with the discrete mass Q and energy E conservative properties have been calculated. The results obtained by the method have been compared with the exact solution of each problem and other numerical results in the literature, and also found to be in good agreement with each other. A Fourier stability analysis of each presented method is also investigated.     

Stability and error analysis for spectral Galerkin method for the Navier–Stokes equations with L2 initial data

In this article we consider the spectral Galerkin method with the implicit/explicit Euler scheme for the two‐dimensional Navier–Stokes equations with the L² initial data. Due to the poor smoothness of the solution on [0,1), we use the the spectral Galerkin method based on high‐dimensional spectral space H_M and small time step Δt² on this interval. While on [1,∞), we use the spectral Galerkin method based on low‐dimensional spectral space H_m(m = O(M^1/2)) and large time step Δt. For the spectral Galerkin method, we provide the standard H²‐stability and the L²‐error analysis. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2007     

A stabilized finite element method for convection–diffusion problems

A stabilized finite element method (FEM) is presented for solving the convection–diffusion equation. We enrich the linear finite element space with local functions chosen according to the guidelines of the residual‐free bubble (RFB) FEM. In our approach, the bubble part of the solution (the microscales) is approximated via an adequate choice of discontinuous bubbles allowing static condensation. This leads to a streamline‐diffusion FEM with an explicit formula for the stability parameter τ_K that incorporates the flow direction, has the capability to deal with problems where there is substantial variation of the Péclet number, and gives the same limit as the RFB method. The method produces the same a priori error estimates that are typically obtained with streamline‐upwind Petrov/Galerkin and RFB. © 2011 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2011     

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     

A Petrov‐Galerkin method with quadrature for semi‐linear second‐order hyperbolic problems

We propose and analyze a Crank–Nicolson quadrature Petrov–Galerkin (CNQPG) ‐spline method for solving semi‐linear second‐order hyperbolic initial‐boundary value problems. We prove second‐order convergence in time and optimal order H² norm convergence in space for the CNQPG scheme that requires only linear algebraic solvers. We demonstrate numerically optimal order H^k, k = 0,1,2, norm convergence of the scheme for some test problems with smooth and nonsmooth nonlinearities. © 2006 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2006     

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.     

An improvised collocation algorithm with specific end conditions for solving modified Burgers equation

In this work, numerical solution of nonlinear modified Burgers equation is obtained using an improvised collocation technique with cubic B‐spline as basis functions. In this technique, cubic B‐splines are forced to satisfy the interpolatory condition along with some specific end conditions. Crank–Nicolson scheme is used for temporal domain and improvised cubic B‐spline collocation method is used for spatial domain discretization. Quasilinearization process is followed to tackle the nonlinear term in the equation. Convergence of the technique is established to be of order O(h⁴ + Δt²) . Stability of the technique is examined using von‐Neumann analysis. L₂ and L_∞ error norms are calculated and are compared with those available in existing works. Results are found to be better and the technique is computationally efficient, which is shown by calculating CPU time.     

A Petrov–Galerkin spectral method for fourth‐order problems

In this paper, we consider the Petrov–Galerkin spectral method for fourth‐order elliptic problems on rectangular domains subject to non‐homogeneous Dirichlet boundary conditions. We derive some sharp results on the orthogonal approximations in one and two dimensions, which play important roles in numerical solutions of higher‐order problems. By applying these results to a fourth‐order problem, we establish the H²‐error and L²‐error bounds of the Petrov–Galerkin spectral method. Numerical experiments are provided to illustrate the high accuracy of the proposed method and coincide well with the theoretical analysis. Copyright © 2013 John Wiley & Sons, Ltd.     

High‐order local discontinuous Galerkin method for a fractal mobile/immobile transport equation with the Caputo–Fabrizio fractional derivative

In this article, a local discontinuous Galerkin (LDG) method is studied for numerically solving the fractal mobile/immobile transport equation with a new time Caputo–Fabrizio fractional derivative. The stability of the LDG scheme is proven, and a priori error estimates with the second‐order temporal convergence rate and the (k + 1) th order spatial convergence rate are derived in detail. Finally, numerical experiments based on P^k, k = 0, 1, 2, 3, elements are provided to verify our theoretical results.     

A fast second‐order difference scheme for the space–time fractional equation

In this paper, a fast second‐order accurate difference scheme is proposed for solving the space–time fractional equation. The temporal Caputo derivative is approximated by ?L2 ‐1_σ formula which employs the sum‐of‐exponential approximation to the kernel function appeared in Caputo derivative. The second‐order linear spline approximation is applied to the spatial Riemann–Liouville derivative. At each time step, a fast algorithm, the preconditioned conjugate gradient normal residual method with a circulant preconditioner (PCGNR), is used to solve the resulting system that reduces the storage and computational cost significantly. The unique solvability and unconditional convergence of the difference scheme are shown by the discrete energy method. Numerical examples are given to verify numerical accuracy and efficiency of the difference schemes.     

Multiscale discontinuous Petrov–Galerkin method for the multiscale elliptic problems

In this article, we present a new multiscale discontinuous Petrov–Galerkin method (MsDPGM) for multiscale elliptic problems. This method utilizes the classical oversampling multiscale basis in the framework of a Petrov–Galerkin version of the discontinuous Galerkin method, allowing us to better cope with multiscale features in the solution. MsDPGM takes advantage of the multiscale Petrov–Galerkin method (MsPGM) and the discontinuous Galerkin method (DGM). It can eliminate the resonance error completely and decrease the computational costs of assembling the stiffness matrix, thus, allowing for more efficient solution algorithms. On the basis of a new H² norm error estimate between the multiscale solution and the homogenized solution with the first‐order corrector, we give a detailed convergence analysis of the MsDPGM under the assumption of periodic oscillating coefficients. We also investigate a multiscale discontinuous Galerkin method (MsDGM) whose bilinear form is the same as that of the DGM but the approximation space is constructed from the classical oversampling multiscale basis functions. This method has not been analyzed theoretically or numerically in the literature yet. Numerical experiments are carried out on the multiscale elliptic problems with periodic and randomly generated log‐normal coefficients. Their results demonstrate the efficiency of the proposed method.     

Space‐time spectral method for two‐dimensional semilinear parabolic equations

In this paper, a high‐order accurate numerical method for two‐dimensional semilinear parabolic equations is presented. We apply a Galerkin–Legendre spectral method for discretizing spatial derivatives and a spectral collocation method for the time integration of the resulting nonlinear system of ordinary differential equations. Our formulation can be made arbitrarily high‐order accurate in both space and time. Optimal a priori error bound is derived in the L²‐norm for the semidiscrete formulation. Extensive numerical results are presented to demonstrate the convergence property of the method, show our formulation have spectrally accurate in both space and time. John Wiley & Sons, Ltd.     

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     

A CFL‐free explicit characteristic interior penalty scheme for linear advection‐reaction equations

We develop a CFL‐free, explicit characteristic interior penalty scheme (CHIPS) for one‐dimensional first‐order advection‐reaction equations by combining a Eulerian‐Lagrangian approach with a discontinuous Galerkin framework. The CHIPS method retains the numerical advantages of the discontinuous Galerkin methods as well as characteristic methods. An optimal‐order error estimate in the L² norm for the CHIPS method is derived and numerical experiments are presented to confirm the theoretical estimates. © 2009 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2010     

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 analysis for the mixed Navier–Stokes and Darcy Problem with the Beavers–Joseph interface condition

In this article, we consider the coupled Navier–Stokes and Darcy problem with the Beavers–Joseph interface condition. With suitable restrictions of physical parameters α and ν, we prove the existence and local uniqueness of a weak solution. Then we propose a coupled finite element scheme and a decoupled and linearized scheme based on two‐grid finite element. Under suitable further restrictions, their optimal error estimates are obtained. Finally numerical experiments indicate the validity of the theoretical results as well as the efficiency and effectiveness of the decoupled and linearized two‐grid algorithm. © 2014 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 31: 1009–1030, 2015     

One‐level and two‐level finite element methods for the Boussinesq problem

Previous works on the convergence of numerical methods for the Boussinesq problem were conducted, while the optimal L²‐norm error estimates for the velocity and temperature are still lacked. In this paper, the backward Euler scheme is used to discrete the time terms, standard Galerkin finite element method is adopted to approximate the variables. The MINI element is used to approximate the velocity and pressure, the temperature field is simulated by the linear polynomial. Under some restriction on the time step, we firstly present the optimal L² error estimates of approximate solutions. Secondly, two‐level method based on Stokes iteration for the Boussinesq problem is developed and the corresponding convergence results are presented. By this method, the original problem is decoupled into two small linear subproblems. Compared with the standard Galerkin method, the two‐level method not only keeps good accuracy but also saves a lot of computational cost. Finally, some numerical examples are provided to support the established theoretical analysis.