Space‐time spectral collocation method for the one‐dimensional sine‐Gordon equation

In this article, we introduce a new space‐time spectral collocation method for solving the one‐dimensional sine‐Gordon equation. We apply a spectral collocation method for discretizing spatial derivatives, and then use the spectral collocation method for the time integration of the resulting nonlinear second‐order system of ordinary differential equations (ODE). Our formulation has high‐order accurate in both space and time. Optimal a priori error bounds are derived in the L²‐norm for the semidiscrete formulation. Numerical experiments show that our formulation have exponential rates of convergence in both space and time. © 2014 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 31: 670–690, 2015     

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.     

Stabilized semi‐implicit spectral deferred correction methods for Allen–Cahn and Cahn–Hilliard equations

Stabilized semi‐implicit spectral deferred correction methods are constructed for the time discretization of Allen–Cahn and Cahn–Hilliard equations. These methods are unconditionally stable, lead to simple linear system to solve at each iteration, and can achieve high‐order time accuracy with a few iterations in each time step. Ample numerical results are presented to demonstrate the effectiveness of the stabilized semi‐implicit spectral deferred correction methods for solving the Allen–Cahn and Cahn–Hilliard equations. Copyright © 2013 John Wiley & Sons, Ltd.     

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     

An h–p version of the Chebyshev spectral collocation method for nonlinear delay differential equations

We develop and analyze a spectral collocation method based on the Chebyshev–Gauss–Lobatto points for nonlinear delay differential equations with vanishing delays. We derive an a priori error estimate in the H¹‐norm that is completely explicit with respect to the local time steps and the local polynomial degrees. Several numerical examples are provided to illustrate the theoretical results.     

Mixed two‐grid finite difference methods for solving one‐dimensional and two‐dimensional Fitzhugh–Nagumo equations

The aim of this paper is to propose mixed two‐grid finite difference methods to obtain the numerical solution of the one‐dimensional and two‐dimensional Fitzhugh–Nagumo equations. The finite difference equations at all interior grid points form a large‐sparse linear system, which needs to be solved efficiently. The solution cost of this sparse linear system usually dominates the total cost of solving the discretized partial differential equation. The proposed method is based on applying a family of finite difference methods for discretizing the spatial and time derivatives. The obtained system has been solved by two‐grid method, where the two‐grid method is used for solving the large‐sparse linear systems. Also, in the proposed method, the spectral radius with local Fourier analysis is calculated for different values of h and Δt. The numerical examples show the efficiency of this algorithm for solving the one‐dimensional and two‐dimensional Fitzhugh–Nagumo equations. Copyright © 2016 John Wiley & Sons, Ltd.     

Multilevel preconditioning and low‐rank tensor iteration for space–time simultaneous discretizations of parabolic PDEs

This paper addresses the solution of parabolic evolution equations simultaneously in space and time as may be of interest in, for example, optimal control problems constrained by such equations. As a model problem, we consider the heat equation posed on the unit cube in Euclidean space of moderately high dimension. An a priori stable minimal residual Petrov–Galerkin variational formulation of the heat equation in space–time results in a generalized least squares problem. This formulation admits a unique, quasi‐optimal solution in the natural space–time Hilbert space and serves as a basis for the development of space–time compressive solution algorithms. The solution of the heat equation is obtained by applying the conjugate gradient method to the normal equations of the generalized least squares problem. Starting from stable subspace splittings in space and in time, multilevel space–time preconditioners for the normal equations are derived. In order to reduce the complexity of the full space–time problem, all computations are performed in a compressed or sparse format called the hierarchical Tucker format, supposing that the input data are available in this format. In order to maintain sparsity, compression of the iterates within the hierarchical Tucker format is performed in each conjugate gradient iteration. Its application to vectors in the hierarchical Tucker format is detailed. Finally, numerical results in up to five spatial dimensions based on the recently developed htucker toolbox for MATLAB are presented. Copyright © 2014 John Wiley & Sons, Ltd.     

Chebyshev‐Legendre spectral method for solving the two‐dimensional vorticity equations with homogeneous Dirichlet conditions

The Chebyshev‐Legendre spectral method for the two‐dimensional vorticity equations is considered. The Legendre Galerkin Chebyshev collocation method is used with the Chebyshev‐Gauss collocation points. The numerical analysis results under the L²‐norm for the Chebyshev‐Legendre method of one‐dimensional case are generalized into that of the two‐dimensional case. The stability and optimal order convergence of the method are proved. Numerical results are given. © 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2009     

A fully discrete spectral method for fractional Cattaneo equation based on Caputo–Fabrizo derivative

Recently Caputo and Fabrizio introduced a new derivative with fractional order without singular kernel. The derivative can be used to describe the material heterogeneities and the fluctuations of different scales. In this article, we derived a new discretization of Caputo–Fabrizio derivative of order α (1 < α < 2) and applied it into the Cattaneo equation. A fully discrete scheme based on finite difference method in time and Legendre spectral approximation in space is proposed. The stability and convergence of the fully discrete scheme are rigorously established. The convergence rate of the fully discrete scheme in H¹ norm is O(τ² + N^1?m), where τ, N and m are the time‐step size, polynomial degree and regularity in the space variable of the exact solution, respectively. Furthermore, the accuracy and applicability of the scheme are confirmed by numerical examples to support the theoretical results.     

Legendre–Gauss–Lobatto spectral collocation method for nonlinear delay differential equations

A Legendre–Gauss–Lobatto spectral collocation method is introduced for the numerical solutions of a class of nonlinear delay differential equations. An efficient algorithm is designed for the single‐step scheme and applied to the multiple‐domain case. As a theoretical result, we obtain a general convergence theorem for the single‐step case. Numerical results show that the suggested algorithm enjoys high‐order accuracy both in time and in the delayed argument and can be implemented in a robust and efficient manner. Copyright © 2013 John Wiley & Sons, Ltd.     

A modified Chebyshev ϑ‐weighted Crank–Nicolson method for analyzing fractional sub‐diffusion equations

This study presents a robust modification of Chebyshev ? ‐weighted Crank–Nicolson method for analyzing the sub‐diffusion equations in the Caputo fractional sense. In order to solve the problem, by discretization of the sub‐fractional diffusion equations using Taylor's expansion a linear system of algebraic equations that can be analyzed by numerical methods is presented. Furthermore, consistency, convergence, and stability analysis of the suggested method are discussed. In this framework, compact structures of sub‐diffusion equations are considered as prototype examples. The main advantage of the proposed method is that, it is more efficient in terms of CPU time, computational cost and accuracy in comparing with the existing ones in open literature.     

Stability and error analysis for a spectral Galerkin method for the Navier‐Stokes equations with H2 or H1 initial data

In this article we consider a spectral Galerkin method with a semi‐implicit Euler scheme for the two‐dimensional Navier‐Stokes equations with H² or H¹ initial data. The H²‐stability analysis of this spectral Galerkin method shows that for the smooth initial data the semi‐implicit Euler scheme admits a large time step. The L²‐error analysis of the spectral Galerkin method shows that for the smoother initial data the numerical solution u exhibits faster convergence on the time interval [0, 1] and retains the same convergence rate on the time interval [1, ∞). © 2005 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2005.     

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.     

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     

Orthogonal spline collocation methods for the stream function‐vorticity formulation of the Navier–Stokes equations

An orthogonal spline collocation (OSC) spatial discretization is proposed for the solution of the fully coupled stream function‐vorticity formulation of the Navier–Stokes equations in two dimensions. For the time‐stepping, a three‐level leapfrog scheme is employed. This method is algebraically linear, and, at each time step, gives rise to a system of linear equations of the form arising in the OSC approximation of the biharmonic Dirichlet problem and can be solved by a fast direct method. Error estimates in the H^l–norm in space, l = 1,2, are derived for the semi‐discrete method and the fully‐discrete leapfrog scheme which is also shown to be second order accurate in time. Numerical results are presented which confirm the theoretical analysis and exhibit superconvergence phenomena, which provide superconvergent approximations to the components of the velocity. © John Wiley & Sons, Inc. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2008     

Finite difference spectral approximation for the time‐space fractional telegraph equation and its parameter estimation

The object of this paper is to present the numerical solution of the time‐space fractional telegraph equation. The proposed method is based on the finite difference scheme in temporal direction and Fourier spectral method in spatial direction. The fast Fourier transform (FFT) technique is applied to practical computation. The stability and convergence analysis are strictly proven, which shows that this method is stable and convergent with (2?α) order accuracy in time and spectral accuracy in space. Moreover, the Levenberg‐Marquardt (L‐M) iterative method is employed for the parameter estimation. Finally, some numerical examples are given to confirm the theoretical analysis.     

Superconvergence of the direct discontinuous Galerkin method for a time‐fractional initial‐boundary value problem

A time‐fractional reaction–diffusion initial‐boundary value problem with periodic boundary condition is considered on Q ? Ω × [0, T] , where Ω is the interval [0, l] . Typical solutions of such problem have a weak singularity at the initial time t = 0. The numerical method of the paper uses a direct discontinuous Galerkin (DDG) finite element method in space on a uniform mesh, with piecewise polynomials of degree k ≥ 2 . In the temporal direction we use the L1 approximation of the Caputo derivative on a suitably graded mesh. We prove that at each time level of the mesh, our L1‐DDG solution is superconvergent of order k + 2 in L²(Ω) to a particular projection of the exact solution. Moreover, the L1‐DDG solution achieves superconvergence of order (k + 2) in a discrete L²(Q) norm computed at the Lobatto points, and order (k + 1) superconvergence in a discrete H¹(Q) seminorm at the Gauss points; numerical results show that these estimates are sharp.     

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.     

Adaptive finite element solution of the porous medium equation in pressure formulation

The pressure formulation of the porous medium equation has been commonly used in theoretical studies due to its much better regularities than the original formulation. The goal here is to study its use in the adaptive moving mesh finite element solution. The free boundary is traced explicitly through Darcy's law. The method is shown numerically second‐order in space and first‐order in time in the pressure variable. Moreover, the convergence order of the error in the location of the free boundary is almost second‐order in the maximum norm. However, numerical results also show that the convergence order in the original variable stays between first‐order and second‐order in L¹ norm or between 0.5th‐order and first‐order in L² norm. Nevertheless, the current method can offer some advantages over numerical methods based on the original formulation for situations with large exponents or when a more accurate location of the free boundary is desired.