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     

A memory‐efficient finite volume method for advection‐diffusion‐reaction systems with nonsmooth sources

We present a parallel matrix‐free implicit finite volume scheme for the solution of unsteady three‐dimensional advection‐diffusion‐reaction equations with smooth and Dirac‐Delta source terms. The scheme is formally second order in space and a Newton–Krylov method is employed for the appearing nonlinear systems in the implicit time integration. The matrix‐vector product required is hardcoded without any approximations, obtaining a matrix‐free method that needs little storage and is well‐suited for parallel implementation. We describe the matrix‐free implementation of the method in detail and give numerical evidence of its second‐order convergence in the presence of smooth source terms. For nonsmooth source terms, the convergence order drops to one half. Furthermore, we demonstrate the method's applicability for the long‐time simulation of calcium flow in heart cells and show its parallel scaling. © 2014 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq31: 143–167, 2015     

Numerical simulation of the nonlinear generalized time‐fractional Klein–Gordon equation using cubic trigonometric B‐spline functions

In this paper, an efficient numerical procedure for the generalized nonlinear time‐fractional Klein–Gordon equation is presented. We make use of the typical finite difference schemes to approximate the Caputo time‐fractional derivative, while the spatial derivatives are discretized by means of the cubic trigonometric B‐splines. Stability and convergence analysis for the numerical scheme are discussed. We apply our scheme to some typical examples and compare the obtained results with the ones found by other numerical methods. The comparison shows that our scheme is quite accurate and can be applied successfully to a variety of problems of applied nature.     

Convergence acceleration by varying time‐step size using Bi‐CGSTAB method for turbulent flow computation

A design of varying step size approach both in time span and spatial coordinate systems to achieve fast convergence is demonstrated in this study. This method is based on the concept of minimization of residuals by the Bi‐CGSTAB algorithm, so that the convergence can be enforced by varying the time‐step size. The numerical results show that the time‐step size determined by the proposed method improves the convergence rate for turbulent computations using advanced turbulence models in low Reynolds‐number form, and the degree of improvement increases with the degree of the complexity of the turbulence models. © 2001 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 17: 454–474, 2001.     

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.     

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     

Convergence analysis for parallel‐in‐time solution of hyperbolic systems

Parallel‐in‐time algorithms have been successfully employed for reducing time‐to‐solution of a variety of partial differential equations, especially for diffusive (parabolic‐type) equations. A major failing of parallel‐in‐time approaches to date, however, is that most methods show instabilities or poor convergence for hyperbolic problems. This paper focuses on the analysis of the convergence behavior of multigrid methods for the parallel‐in‐time solution of hyperbolic problems. Three analysis tools are considered that differ, in particular, in the treatment of the time dimension: (a) space–time local Fourier analysis, using a Fourier ansatz in space and time; (b) semi‐algebraic mode analysis, coupling standard local Fourier analysis approaches in space with algebraic computation in time; and (c) a two‐level reduction analysis, considering error propagation only on the coarse time grid. In this paper, we show how insights from reduction analysis can be used to improve feasibility of the semi‐algebraic mode analysis, resulting in a tool that offers the best features of both analysis techniques. Following validating numerical results, we investigate what insights the combined analysis framework can offer for two model hyperbolic problems, the linear advection equation in one space dimension and linear elasticity in two space dimensions.     

A quadrature finite element method for semilinear second‐order hyperbolic problems

In this work we propose and analyze a fully discrete modified Crank–Nicolson finite element (CNFE) method with quadrature for solving semilinear second‐order hyperbolic initial‐boundary value problems. We prove optimal‐order convergence in both time and space for the quadrature‐modified CNFE scheme that does not require nonlinear algebraic solvers. Finally, we demonstrate numerically the order of convergence of our scheme for some test problems. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2008     

Stability of non‐constant steady‐state solutions for non‐isentropic Euler–Maxwell system with a temperature damping term

This work is concerned with the periodic problem for compressible non‐isentropic Euler–Maxwell systems with a temperature damping term arising in plasmas. For this problem, we prove the global in time existence of a smooth solution around a given non‐constant steady state with the help of an induction argument on the order of the mixed time‐space derivatives of solutions in energy estimates. Moreover, we also show the convergence of the solution to this steady state as the time goes to the infinity. This phenomenon on the charge transport shows the essential relation of the systems with the non‐isentropic Euler–Maxwell and the isentropic Euler–Maxwell systems. Copyright © 2015 John Wiley & Sons, Ltd.     

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     

Convergence and error bound analysis for the space‐time CESE method

In this work, we study the convergence behavior of a recently developed space‐time conservation element and solution element method for solving conservation laws. In particular, we apply the method to a one‐dimensional time‐dependent convection‐diffusion equation possibly with high Peclet number. We prove that the scheme converges and we obtain an error bound. This method performs well even for strong convection dominance over diffusion with good long‐time accuracy. Numerical simulations are performed to verify the results. © 2001 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 17: 64–78, 2001     

Parallel characteristic finite element method for time‐dependent convection–diffusion problem

Based on the overlapping‐domain decomposition and parallel subspace correction method, a new parallel algorithm is established for solving time‐dependent convection–diffusion problem with characteristic finite element scheme. The algorithm is fully parallel. We analyze the convergence of this algorithm, and study the dependence of the convergent rate on the spacial mesh size, time increment, iteration times and sub‐domains overlapping degree. Both theoretical analysis and numerical results suggest that only one or two iterations are needed to reach to optimal accuracy at each time step. Copyright © 2010 John Wiley & Sons, Ltd.     

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.     

Stability and convergence of optimum spectral non‐linear Galerkin methods

Our objective in this article is to present some numerical schemes for the approximation of the 2‐D Navier–Stokes equations with periodic boundary conditions, and to study the stability and convergence of the schemes. Spatial discretization can be performed by either the spectral Galerkin method or the optimum spectral non‐linear Galerkin method; time discretization is done by the Euler scheme and a two‐step scheme. Our results show that under the same convergence rate the optimum spectral non‐linear Galerkin method is superior to the usual Galerkin methods. Finally, numerical example is provided and supports our results. Copyright © 2001 John Wiley & Sons, Ltd.     

An efficient pseudo‐spectral Legendre–Galerkin method for solving a nonlinear partial integro‐differential equation arising in population dynamics

The pseudo‐spectral Legendre–Galerkin method (PS‐LGM) is applied to solve a nonlinear partial integro‐differential equation arising in population dynamics. This equation is a competition model in which similar individuals are competing for the same resources. It is a kind of reaction–diffusion equation with integral term corresponding to nonlocal consumption of resources. The proposed method is based on the Legendre–Galerkin formulation for the linear terms and interpolation operator at the Chebyshev–Gauss–Lobatto (CGL) points for the nonlinear terms. Also, the integral term, which is a kind of convolution, is directly computed by a fast and accurate method based on CGL interpolation operator, and thus, the use of any quadrature formula in its computation is avoided. The main difference of the PS‐LGM presented in the current paper with the classic LGM is in treating the nonlinear terms and imposing boundary conditions. Indeed, in the PS‐LGM, the nonlinear terms are efficiently handled using the CGL points, and also the boundary conditions are imposed strongly as collocation methods. Combination of the PS‐LGM with a semi‐implicit time integration method such as second‐order backward differentiation formula and Adams‐Bashforth method leads to reducing the complexity of computations and obtaining a linear algebraic system of equations with banded coefficient matrix. The desired equation is considered on one and two‐dimensional spatial domains. Efficiency, accuracy, and convergence of the proposed method are demonstrated numerically in both cases. Copyright © 2012 John Wiley & Sons, Ltd.     

A uniformly optimal‐order estimate for finite volume method for advection‐diffusion equations

We prove an optimal‐order error estimate in a weighted energy norm for finite volume method for two‐dimensional time‐dependent advection–diffusion equations on a uniform space‐time partition of the domain. The generic constants in the estimates depend only on certain norms of the true solution but not on the scaling parameter. These estimates, combined with a priori stability estimates of the governing partial differential equations with full regularity, yield a uniform estimate of the finite volume method, in which the generic constants depend only on the Sobolev norms of the initial and right side data but not on the scaling parameter. We use the interpolation of spaces and stability estimates to derive a uniform estimate for problems with minimal or intermediate regularity, where the convergence rates are proportional to certain Besov norms of the initial and right‐hand side data. © 2013 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 30: 17‐43, 2014     

A linearized Crank–Nicolson–Galerkin FEM for the time‐dependent Ginzburg–Landau equations under the temporal gauge

We propose a decoupled and linearized fully discrete finite element method (FEM) for the time‐dependent Ginzburg–Landau equations under the temporal gauge, where a Crank–Nicolson scheme is used for the time discretization. By carefully designing the time‐discretization scheme, we manage to prove the convergence rate , where τ is the time‐step size and r is the degree of the finite element space. Due to the degeneracy of the problem, the convergence rate in the spatial direction is one order lower than the optimal convergence rate of FEMs for parabolic equations. Numerical tests are provided to support our error analysis. © 2014 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 30: 1279–1290, 2014     

High‐order numerical solution of second‐order one‐dimensional hyperbolic telegraph equation using a shifted Gegenbauer pseudospectral method

We present a high‐order shifted Gegenbauer pseudospectral method (SGPM) to solve numerically the second‐order one‐dimensional hyperbolic telegraph equation provided with some initial and Dirichlet boundary conditions. The framework of the numerical scheme involves the recast of the problem into its integral formulation followed by its discretization into a system of well‐conditioned linear algebraic equations. The integral operators are numerically approximated using some novel shifted Gegenbauer operational matrices of integration. We derive the error formula of the associated numerical quadratures. We also present a method to optimize the constructed operational matrix of integration by minimizing the associated quadrature error in some optimality sense. We study the error bounds and convergence of the optimal shifted Gegenbauer operational matrix of integration. Moreover, we construct the relation between the operational matrices of integration of the shifted Gegenbauer polynomials and standard Gegenbauer polynomials. We derive the global collocation matrix of the SGPM, and construct an efficient computational algorithm for the solution of the collocation equations. We present a study on the computational cost of the developed computational algorithm, and a rigorous convergence and error analysis of the introduced method. Four numerical test examples have been carried out to verify the effectiveness, the accuracy, and the exponential convergence of the method. The SGPM is a robust technique, which can be extended to solve a wide range of problems arising in numerous applications. © 2015 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 32: 307–349, 2016     

High‐order characteristic‐tracking strategy for simulation of a nonlinear advection–diffusion equation

In this study, new high‐order backward semi‐Lagrangian methods are developed to solve nonlinear advection–diffusion type problems, which are realized using high‐order characteristic‐tracking strategies. The proposed characteristic‐tracking strategies are second‐order L‐stable and third‐order L(α)‐stable methods, which are based on a classical implicit multistep method combined with a error‐correction method. We also use backward differentiation formulas and the fourth‐order finite‐difference scheme for diffusion problem discretization in the temporal and spatial domains, respectively. To demonstrate the adaptability and efficiency of these time‐discretization strategies, we apply these methods to nonlinear advection–diffusion type problems such as the viscous Burgers' equation. Through simulations, not only the temporal and spatial accuracies are numerically evaluated but also the proposed methods are shown to be superior to the compared existing characteristic‐tracking methods under the same rates of convergence in terms of accuracy and efficiency. Finally, we have shown that the proposed method well preserves the energy and mass when the viscosity coefficient becomes zero.     

The semi‐iterative method applied to the hyper‐power iteration

The semi‐iterative method (SIM) is applied to the hyper‐power (HP) iteration, and necessary and sufficient conditions are given for the convergence of the semi‐iterative–hyper‐power (SIM–HP) iteration. The root convergence rate is computed for both the HP and SIM–HP methods, and the quotient convergence rate is given for the HP iteration. Copyright © 2005 John Wiley & Sons, Ltd.