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.     

An exponential high‐order compact ADI method for 3D unsteady convection–diffusion problems

In this article, we develop an exponential high order compact alternating direction implicit (EHOC ADI) method for solving three dimensional (3D) unsteady convection–diffusion equations. The method, which requires only a regular seven‐point 3D stencil similar to that in the standard second‐order methods, is second order accurate in time and fourth‐order accurate in space and unconditionally stable. The resulting EHOC ADI scheme in each alternating direction implicit (ADI) solution step corresponding to a strictly diagonally dominant matrix equation can be solved by the application of the one‐dimensional tridiagonal Thomas algorithm with a considerable saving in computing time. Numerical experiments for three test problems are carried out to demonstrate the performance of the present method and to compare it with the classical Douglas–Gunn ADI method and the Karaa's high‐order compact ADI method. © 2012 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2013     

A defect correction method for the time‐dependent Navier‐Stokes equations

A method for solving the time dependent Navier‐Stokes equations, aiming at higher Reynolds' number, is presented. The direct numerical simulation of flows with high Reynolds' number is computationally expensive. The method presented is unconditionally stable, computationally cheap, and gives an accurate approximation to the quantities sought. In the defect step, the artificial viscosity parameter is added to the inverse Reynolds number as a stability factor, and the system is antidiffused in the correction step. Stability of the method is proven, and the error estimations for velocity and pressure are derived for the one‐ and two‐step defect‐correction methods. The spacial error is O(h) for the one‐step defect‐correction method, and O(h²) for the two‐step method, where h is the diameter of the mesh. The method is compared to an alternative approach, and both methods are applied to a singularly perturbed convection–diffusion problem. The numerical results are given, which demonstrate the advantage (stability, no oscillations) of the method presented. © 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2009     

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.     

Singly diagonally implicit runge‐kutta method for time‐dependent reaction‐diffusion equation

In this article, an efficient fourth‐order accurate numerical method based on Padé approximation in space and singly diagonally implicit Runge‐Kutta method in time is proposed to solve the time‐dependent one‐dimensional reaction‐diffusion equation. In this scheme, we first approximate the spatial derivative using the second‐order central finite difference then improve it to fourth‐order by applying Padé approximation. A three stage fourth‐order singly diagonally implicit Runge‐Kutta method is then used to solve the resulting system of ordinary differential equations. It is also shown that the scheme is unconditionally stable, and is suitable for stiff problems. Several numerical examples are solved by the scheme and the efficiency and accuracy of the new scheme are compared with two widely used high‐order compact finite difference methods. © 2010 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 27: 1423–1441, 2011     

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.     

A defect correction approach to turbulence modeling

A method for resolving turbulent flow problems is presented, aiming at competing with the existing mathematical tractable Approximate Deconvolution Models in terms of accuracy, and outperforming these models in terms of the computational time needed. Full numerical analysis is performed, and the method is shown to be stable, easy to implement and parallelize, and computationally fast. The proposed method employs the defect correction approach to solve spatially filtered Navier–Stokes equations. A simple numerical test is provided that compares the method against the approximate deconvolution turbulence model (ADM). When resolving a fluid flow at high Reynolds number, the numerical example verifies the key feature of the method: while having the accuracy comparable to that of the ADM, the method computes in less than 80% of the time needed for the turbulence model—even before the parallelization.© 2014 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 31: 268–288, 2015     

Global energy‐tracking identities and global energy‐tracking splitting FDTD schemes for the Drude Models of Maxwell's equations in three‐dimensional metamaterials

In this article, we study the Drude models of Maxwell's equations in three‐dimensional metamaterials. We derive new global energy‐tracking identities for the three dimensional electromagnetic problems in the Drude metamaterials, which describe the invariance of global electromagnetic energy in variation forms. We propose the time second‐order global energy‐tracking splitting FDTD schemes for the Drude model in three dimensions. The significant feature is that the developed schemes are global energy‐preserving, unconditionally stable, second‐order accurate both in time and space, and computationally efficient. We rigorously prove that the new schemes satisfy these energy‐tracking identities in the discrete form and the discrete variation form and are unconditionally stable. We prove that the schemes in metamaterials are second order both in time and space. The superconvergence of the schemes in the discrete H¹ norm is further obtained to be second order both in time and space. Their approximations of divergence‐free are also analyzed to have second‐order accuracy both in time and space. Numerical experiments confirm our theoretical analysis results. © 2017 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 33: 763–785, 2017     

High‐order finite difference schemes for numerical solutions of the generalized Burgers–Huxley equation

In this article, up to tenth‐order finite difference schemes are proposed to solve the generalized Burgers–Huxley equation. The schemes based on high‐order differences are presented using Taylor series expansion. To establish the numerical solutions of the corresponding equation, the high‐order schemes in space and a fourth‐order Runge‐Kutta scheme in time have been combined. Numerical experiments have been conducted to demonstrate the high‐order accuracy of the current algorithms with relatively minimal computational effort. The results showed that use of the present approaches in the simulation is very applicable for the solution of the generalized Burgers–Huxley equation. The current results are also seen to be more accurate than some results given in the literature. The proposed algorithms are seen to be very good alternatives to existing approaches for such physical applications. © 2010 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 27: 1313‐1326, 2011     

A high order accurate numerical method for solving two‐dimensional dual‐phase‐lagging equation with temperature jump boundary condition in nanoheat conduction

Dual‐phase‐lagging (DPL) equation with temperature jump boundary condition (Robin's boundary condition) shows promising for analyzing nanoheat conduction. For solving it, development of higher‐order accurate and unconditionally stable (no restriction on the mesh ratio) numerical schemes is important. Because the grid size may be very small at nanoscale, using a higher‐order accurate scheme will allow us to choose a relative coarse grid and obtain a reasonable solution. For this purpose, recently we have presented a higher‐order accurate and unconditionally stable compact finite difference scheme for solving one‐dimensional DPL equation with temperature jump boundary condition. In this article, we extend our study to a two‐dimensional case and develop a fourth‐order accurate compact finite difference method in space coupled with the Crank–Nicolson method in time, where the Robin's boundary condition is approximated using a third‐order accurate compact method. The overall scheme is proved to be unconditionally stable and convergent with the convergence rate of fourth‐order in space and second‐order in time. Numerical errors and convergence rates of the solution are tested by two examples. Numerical results coincide with the theoretical analysis. © 2015 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 31: 1742–1768, 2015     

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     

Maximum norm error analysis of an unconditionally stable semi‐implicit scheme for multi‐dimensional Allen–Cahn equations

In this paper, a linearized finite difference scheme is proposed for solving the multi‐dimensional Allen–Cahn equation. In the scheme, a modified leap‐frog scheme is used for the time discretization, the nonlinear term is treated in a semi‐implicit way, and the central difference scheme is used for the discretization in space. The proposed method satisfies the discrete energy decay property and is unconditionally stable. Moreover, a maximum norm error analysis is carried out in a rigorous way to show that the method is second‐order accurate both in time and space variables. Finally, numerical tests for both two‐ and three‐dimensional problems are provided to confirm our theoretical findings.     

Second order fully discrete defect‐correction scheme for nonstationary conduction‐convection problem at high Reynolds number

This survey enfolds rigorous analysis of the defect‐correction finite element (FE) method for the time‐dependent conduction‐convection problem which based on the Crank‐Nicolson scheme. The method consists of two steps: solve a nonlinear problem with an added artificial viscosity term on a FE grid and correct the solutions on the same grid using a linearized defect‐correction technique. The stability and optimal error estimate of the fully discrete scheme are derived. As a consequence, the effectiveness of the method to deal with high Reynolds number is illustrated in several numerical experiments. © 2016 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 33: 681–703, 2017     

A linearized high‐order difference scheme for the fractional Ginzburg–Landau equation

The numerical solution for the one‐dimensional complex fractional Ginzburg–Landau equation is considered and a linearized high‐order accurate difference scheme is derived. The fractional centered difference formula, combining the compact technique, is applied to discretize fractional Laplacian, while Crank–Nicolson/leap‐frog scheme is used to deal with the temporal discretization. A rigorous analysis of the difference scheme is carried out by the discrete energy method. It is proved that the difference scheme is uniquely solvable and unconditionally convergent, in discrete maximum norm, with the convergence order of two in time and four in space, respectively. Numerical simulations are given to show the efficiency and accuracy of the scheme. © 2016 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 33: 105–124, 2017     

Improved upwind discretization of the advection equation

The simplest upwind discretization of the advection equation is only first‐order accurate in time and space and very diffusive. In this article, the first‐order upwind method is improved by changing its basis functions. The resulting scheme, called exponentially fitted, proves to be more accurate in both space and time. In addition, it inherits some qualitative behaviors of the advection equation. The proposed approach is able to be generalized for more complicated problems provided that appropriate relations between the fitting parameters of the method are imposed. © 2013 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 30: 773–787, 2014     

An efficient high‐order algorithm for solving systems of reaction‐diffusion equations

An efficient higher‐order finite difference algorithm is presented in this article for solving systems of two‐dimensional reaction‐diffusion equations with nonlinear reaction terms. The method is fourth‐order accurate in both the temporal and spatial dimensions. It requires only a regular five‐point difference stencil similar to that used in the standard second‐order algorithm, such as the Crank‐Nicolson algorithm. The Padé approximation and Richardson extrapolation are used to achieve high‐order accuracy in the spatial and temporal dimensions, respectively. Numerical examples are presented to demonstrate the efficiency and accuracy of the new algorithm. © 2002 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 18: 340–354, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/num.10012     

A pseudo‐spectral method that uses an overlapping multidomain technique for the numerical solution of sine‐Gordon equation in one and two spatial dimensions

In this article, we study an explicit scheme for the solution of sine‐Gordon equation when the space discretization is carried out by an overlapping multidomain pseudo‐spectral technique. By using differentiation matrices, the equation is reduced to a nonlinear system of ordinary differential equations in time that can be discretized with the explicit fourth‐order Runge–Kutta method. To achieve approximation with high accuracy in large domains, the number of space grid points must be large enough. This yields very large and full matrices in the pseudo‐spectral method that causes large memory requirements. The domain decomposition approach provides sparsity in the matrices obtained after the discretization, and this property reduces storage for large matrices and provides economical ways of performing matrix–vector multiplications. Therefore, we propose a multidomain pseudo‐spectral method for the numerical simulation of the sine‐Gordon equation in large domains. Test examples are given to demonstrate the accuracy and capability of the proposed method. Numerical experiments show that the multidomain scheme has an excellent long‐time numerical behavior for the sine‐Gordon equation in one and two dimensions. Copyright © 2013 John Wiley & Sons, Ltd.     

Numerical approximation of the conservative Allen–Cahn equation by operator splitting method

In this paper, a second‐order fast explicit operator splitting method is proposed to solve the mass‐conserving Allen–Cahn equation with a space–time‐dependent Lagrange multiplier. The space–time‐dependent Lagrange multiplier can preserve the volume of the system and keep small features. Moreover, we analyze the discrete maximum principle and the convergence rate of the fast explicit operator splitting method. The proposed numerical scheme is of spectral accuracy in space and of second‐order accuracy in time, which greatly improves the computational efficiency. Numerical experiments are presented to confirm the accuracy, efficiency, mass conservation, and stability of the proposed method. Copyright © 2017 John Wiley & Sons, Ltd.     

Numerical analysis and iteration acceleration of a fully implicit scheme for nonlinear diffusion problem with second‐order time evolution

Fully implicit schemes with second‐order time evolutions have been applied to simulate nonlinear diffusion problems precisely for a long time, but there is seldom theoretical study for either their convergence properties or efficient iterations. Here, a second‐order time evolution fully implicit scheme for two‐dimensional nonlinear divergence diffusion problem is analyzed. The unique existence of its solution is given. Two new methods are provided to prove its convergence, including entire inductive hypothesis reasoning and a two‐step reasoning process. Rigorous analysis shows the scheme is stable; its solution has second‐order convergence in both space and time to the exact solution of the problem. The convergence is applied to analyze a Newton iteration accelerating the computation and show its quadratic convergent speed and second‐order accuracy. The reasoning techniques also adapt to first‐order time accuracy schemes, and can be extended to analyze a wide class of nonlinear schemes for nonlinear problems. Numerical tests highlight the theoretical results and demonstrate the high performance of the algorithms. © 2015 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 32: 121–140, 2016     

Local defect correction with slanting grids

The local defect correction (LDC) method is used to solve a convection‐diffusion‐reaction problem that contains a high‐activity region in a relatively small part of the domain. The improvement of the solution on a coarse grid is obtained by introducing a correction term computed from a local fine‐grid solution. This article studies problems where the high‐activity region is covered with a rectangular fine grid not aligned with the axes of the global domain. This study shows that the resulting method is less expensive than both a uniform refinement and tensor product grid method. © 2003 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 20: 1–17, 2004.