Finite difference discretization of the Benjamin‐Bona‐Mahony‐Burgers equation

Numerical solutions of the Benjamin‐Bona‐Mahony‐Burgers equation in one space dimension are considered using Crank‐Nicolson‐type finite difference method. Existence of solutions is shown by using the Brower's fixed point theorem. The stability and uniqueness of the corresponding methods are proved by the means of the discrete energy method. The convergence in L^∞‐norm of the difference solution is obtained. A conservative difference scheme is presented for the Benjamin‐Bona‐Mahony equation. Some numerical experiments have been conducted in order to validate the theoretical results.© 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2007     

A high‐order B‐spline collocation scheme for solving a nonhomogeneous time‐fractional diffusion equation

A high‐accuracy numerical approach for a nonhomogeneous time‐fractional diffusion equation with Neumann and Dirichlet boundary conditions is described in this paper. The time‐fractional derivative is described in the sense of Riemann‐Liouville and discretized by the backward Euler scheme. A fourth‐order optimal cubic B‐spline collocation (OCBSC) method is used to discretize the space variable. The stability analysis with respect to time discretization is carried out, and it is shown that the method is unconditionally stable. Convergence analysis of the method is performed. Two numerical examples are considered to demonstrate the performance of the method and validate the theoretical results. It is shown that the proposed method is of order O(Δx⁴ + Δt^{2 ? α}) convergence, where α ∈ (0,1) . Moreover, the impact of fractional‐order derivative on the solution profile is investigated. Numerical results obtained by the present method are compared with those obtained by the method based on standard cubic B‐spline collocation method. The CPU time for present numerical method and the method based on cubic B‐spline collocation method are provided.     

Adini‐Q1‐P3 FEM for general elastic multi‐structure problems

An Adini‐Q₁‐P₃ finite element method is introduced to solve general elastic multi‐structure problems, where displacements on bodies, longitudinal displacements on plates, longitudinal displacements and rotational angles on rods are discretized by conforming linear (bilinear or trilinear) elements, and transverse displacements on plates and rods are discretized by Adini elements and Hermite elements of third order, respectively. The unique solvability and optimal error estimates in the energy norm are established for the discrete method, whose numerical performance is illustrated by some numerical examples. © 2010 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 27: 1092–1112, 2011     

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.     

A second‐order linearized difference scheme on nonuniform meshes for nonlinear parabolic systems with Neumann boundary value conditions

A linearized three‐level difference scheme on nonuniform meshes is derived by the method of the reduction of order for the Neumann boundary value problem of a nonlinear parabolic system. It is proved that the difference scheme is uniquely solvable and second‐order convergent in L_∞‐norm. A numerical example is given. © 2003 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 20: 230–247, 2004     

A three‐level linearized finite difference scheme for the camassa–holm equation

The Camassa–Holm (CH) system is a strong nonlinear third‐order evolution equation. So far, the numerical methods for solving this problem are only a few. This article deals with the finite difference solution to the CH equation. A three‐level linearized finite difference scheme is derived. The scheme is proved to be conservative, uniquely solvable, and conditionally second‐order convergent in both time and space in the discrete L_∞ norm. Several numerical examples are presented to demonstrate the accuracy and efficiency of the proposed method. © 2013 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 30: 451–471, 2014     

A layer adaptive B‐spline collocation method for singularly perturbed one‐dimensional parabolic problem with a boundary turning point

In this article, we develop a parameter uniform numerical method for a class of singularly perturbed parabolic equations with a multiple boundary turning point on a rectangular domain. The coefficient of the first derivative with respect to x is given by the formula a₀(x, t)x^p, where a₀(x, t) ≥ α > 0 and the parameter p ∈ [1,∞) takes the arbitrary value. For small values of the parameter ε, the solution of this particular class of problem exhibits the parabolic boundary layer in a neighborhood of the boundary x = 0 of the domain. We use the implicit Euler method to discretize the temporal variable on uniform mesh and a B‐spline collocation method defined on piecewise uniform Shishkin mesh to discretize the spatial variable. Asymptotic bounds for the derivatives of the solution are established by decomposing the solution into smooth and singular component. These bounds are applied in the convergence analysis of the proposed scheme on Shishkin mesh. The resulting method is boundary layer resolving and has been shown almost second‐order accurate in space and first‐order accurate in time. It is also shown that the proposed method is uniformly convergent with respect to the singular perturbation parameter ε. Some numerical results are given to confirm the predicted theory and comparison of numerical results made with a scheme consisting of a standard upwind finite difference operator on a piecewise uniform Shishkin mesh. © 2010 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 27: 1143–1164, 2011     

A finite element method for the axisymmetric three‐field Stokes system with a discontinuous pressure

A quadrilateral based velocity‐pressure‐extrastress tensor mixed finite element method for solving the three‐field Stokes system in the axisymmetric case is studied. The method derived from Fortin's Q₂ − P₁ velocity‐pressure element is to be used in connection with the standard Galerkin formulation. This makes it particularly suitable for the numerical simulation of viscoelastic flow. It is proven to be second‐order convergent in the natural weighted Sobolev norms, for the system under consideration. The crucial result that the method is uniformly stable is proven for the case of rectangular meshes. © 1999 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 15: 739–763, 1999     

Least‐squares solutions of matrix inverse problem for bi‐symmetric matrices with a submatrix constraint

An n × n real matrix A = (a_ij)_{n × n} is called bi‐symmetric matrix if A is both symmetric and per‐symmetric, that is, a_ij = a_ji and a_ij = a_n+1?1,n+1?i (i, j = 1, 2,..., n). This paper is mainly concerned with finding the least‐squares bi‐symmetric solutions of matrix inverse problem AX = B with a submatrix constraint, where X and B are given matrices of suitable sizes. Moreover, in the corresponding solution set, the analytical expression of the optimal approximation solution to a given matrix A^* is derived. A direct method for finding the optimal approximation solution is described in detail, and three numerical examples are provided to show the validity of our algorithm. Copyright © 2007 John Wiley & Sons, Ltd.     

High‐order numerical methods for one‐dimensional parabolic singularly perturbed problems with regular layers

In this work we construct and analyze some finite difference schemes used to solve a class of time‐dependent one‐dimensional convection‐diffusion problems, which present only regular layers in their solution. We use the implicit Euler or the Crank‐Nicolson method to discretize the time variable and a HODIE finite difference scheme, defined on a piecewise uniform Shishkin mesh, to discretize the spatial variable. In both cases we prove that the numerical method is uniformly convergent with respect to the diffusion parameter, having order near two in space and order one or 3/2, depending on the method used, in time. We show some numerical examples which illustrate the theoretical results, in the case of using the Euler implicit method, and give better numerical behaviour than that predicted theoretically, showing order two in time and order N^?2log²N in space, if the Crank‐Nicolson scheme is used to discretize the time variable. Finally, we construct a numerical algorithm by combining a third order A‐stable SDIRK with two stages and a third‐order HODIE difference scheme, showing its uniformly convergent behavior, reaching order three, up to a logarithmic factor. © 2004 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2005     

Low‐order stabilized finite element methods for the unsteady Stokes/Navier‐Stokes equations with friction boundary conditions

In this paper, we consider low‐order stabilized finite element methods for the unsteady Stokes/Navier‐Stokes equations with friction boundary conditions. The time discretization is based on the Euler implicit scheme, and the spatial discretization is based on the low‐order element (P₁−P₁ or P₁−P₀) for the approximation of the velocity and pressure. Moreover, some error estimates for the numerical solution of fully discrete stabilized finite element scheme are obtained. Finally, numerical experiments are performed to confirm our theoretical results.     

Analysis of some finite difference schemes for two‐dimensional Ginzburg‐Landau equation

We study the rate of convergence of some finite difference schemes to solve the two‐dimensional Ginzburg‐Landau equation. Avoiding the difficulty in estimating the numerical solutions in uniform norm, we prove that all the schemes are of the second‐order convergence in L₂ norm by an induction argument. The unique solvability, stability, and an iterative algorithm are also discussed. A numerical example shows the correction of the theoretical analysis.© 2010 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 27: 1340‐1363, 2011     

A note on a lowest order divergence‐free Stokes element on quadrilaterals

This short note reports a lowest order divergence‐free Stokes element on quadrilateral meshes. The velocity space is based on a P₁ spline element over the crisscross partition of a quadrilateral, and the pressure is approximated by piecewise constant. For a given quadrilateral mesh, this element is stable if and only if the well‐known Q₁‐P₀ element is also stable. Although this method is a subspace method of Qin‐Zhang's P₁‐P₀ element, their velocity solutions are precisely equal. Moreover, an explicit basis representation is also provided. These theoretical findings are verified by numerical tests.     

Analytical and numerical solutions of a two‐dimensional multi‐term time‐fractional Oldroyd‐B model

In this paper, we consider a two‐dimensional multi‐term time‐fractional Oldroyd‐B equation on a rectangular domain. Its analytical solution is obtained by the method of separation of variables. We employ the finite difference method with a discretization of the Caputo time‐fractional derivative to obtain an implicit difference approximation for the equation. Stability and convergence of the approximation scheme are established in the L_∞ ‐norm. Two examples are given to illustrate the theoretical analysis and analytical solution. The results indicate that the present numerical method is effective for this general two‐dimensional multi‐term time‐fractional Oldroyd‐B model.     

Convergence analysis of a linearized Crank–Nicolson scheme for the two‐dimensional complex Ginzburg–Landau equation

A linearized Crank–Nicolson‐type scheme is proposed for the two‐dimensional complex Ginzburg–Landau equation. The scheme is proved to be unconditionally convergent in the L² ‐norm by the discrete energy method. The convergence order is \begin{align*}\mathcal{O}(\tau^2+h_1^2+h^2_2)\end{align*}, where τ is the temporal grid size and h₁,h₂ are spatial grid sizes in the x ‐ and y ‐directions, respectively. A numerical example is presented to support the theoretical result. © 2013 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2013     

Planar graphs with neither 5‐cycles nor close 3‐cycles are 3‐colorable

In 2003, O. V. Borodin and A. Raspaud conjectured that every planar graph with the minimum distance between triangles, d_Δ, at least 1 and without 5‐cycles is 3‐colorable. This Bordeaux conjecture (Brdx3CC) has common features with Havel's (1970) and Steinberg's (1976) 3‐color problems. A relaxation of Brdx3CC with d_Δ?4 was confirmed in 2003 by Borodin and Raspaud, whose result was improved to d_Δ?3 by Borodin and A. N. Glebov (2004) and, independently, by B. Xu (2007). The purpose of this article is to make the penultimate step (d_Δ?2) towards Brdx3CC. © 2010 Wiley Periodicals, Inc. J Graph Theory 66: 1–31, 2010     

An analysis for a high‐order difference scheme for numerical solution to utt = A(x,t)uxx + F(x,t, u,ut, ux)

This article is concerned with a high‐order implicit difference scheme presented by Mohanty, Jain, and George for the nonlinear hyperbolic equation u_tt = A(x, t)u_xx + F(x, t, u, u_t, u_x) with Dirichlet boundary conditions. Some prior estimates of the difference solution are obtained by the energy methods. The solvability of the difference scheme is proved by the energy method and Brower's fixed point theorem. Similarly, the uniqueness, the convergence in L_∞‐norm and the stability of the difference solution are obtained. A numerical example is provided to demonstrate the validity of the theoretical results. © 2006 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 23: 484–498, 2007     

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.     

A second‐order accurate difference scheme for the two‐dimensional Burgers' system

In this article, a Crank‐Nicolson‐type finite difference scheme for the two‐dimensional Burgers' system is presented. The existence of the difference solution is shown by Brouwer fixed‐point theorem. The uniqueness of the difference solution and the stability and L₂ convergence of the difference scheme are proved by energy method. An iterative algorithm for the difference scheme is given in detail. Furthermore, a linear predictor–corrector method is presented. The numerical results show that the predictor–corrector method is also convergent with the convergence order of two in both time and space. At last, some comments are provided for the backward Euler scheme. © 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2009     

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