824 research outputs found

    On the fourth-order accurate compact ADI scheme for solving the unsteady Nonlinear Coupled Burgers' Equations

    Full text link
    The two-dimensional unsteady coupled Burgers' equations with moderate to severe gradients, are solved numerically using higher-order accurate finite difference schemes; namely the fourth-order accurate compact ADI scheme, and the fourth-order accurate Du Fort Frankel scheme. The question of numerical stability and convergence are presented. Comparisons are made between the present schemes in terms of accuracy and computational efficiency for solving problems with severe internal and boundary gradients. The present study shows that the fourth-order compact ADI scheme is stable and efficient

    High-order cyclo-difference techniques: An alternative to finite differences

    Get PDF
    The summation-by-parts energy norm is used to establish a new class of high-order finite-difference techniques referred to here as 'cyclo-difference' techniques. These techniques are constructed cyclically from stable subelements, and require no numerical boundary conditions; when coupled with the simultaneous approximation term (SAT) boundary treatment, they are time asymptotically stable for an arbitrary hyperbolic system. These techniques are similar to spectral element techniques and are ideally suited for parallel implementation, but do not require special collocation points or orthogonal basis functions. The principal focus is on methods of sixth-order formal accuracy or less; however, these methods could be extended in principle to any arbitrary order of accuracy

    A Cole-Hopf transformation based fourth-order multiple-relaxation-time lattice Boltzmann model for the coupled Burgers' equations

    Full text link
    In this work, a Cole-Hopf transformation based fourth-order multiple-relaxation-time lattice Boltzmann (MRT-LB) model for d-dimensional coupled Burgers' equations is developed. We first adopt the Cole-Hopf transformation where an intermediate variable \theta is introduced to eliminate the nonlinear convection terms in the Burgers' equations on the velocity u=(u_1,u_2,...,u_d). In this case, a diffusion equation on the variable \theta can be obtained, and particularly, the velocity u in the coupled Burgers' equations is determined by the variable \theta and its gradient term \nabla\theta. Then we develop a general MRT-LB model with the natural moments for the d-dimensional transformed diffusion equation and present the corresponding macroscopic finite-difference scheme. At the diffusive scaling, the fourth-order modified equation of the developed MRT-LB model is derived through the Maxwell iteration method. With the aid of the free parameters in the MRT-LB model, we find that not only the consistent fourth-order modified equation can be obtained, but also the gradient term ∇θ\nabla\theta can be calculated locally by the non-equilibrium distribution function with a fourth-order accuracy, this indicates that theoretically, the MRT-LB model for dd-dimensional coupled Burgers' equations can achieve a fourth-order accuracy in space. Finally, some simulations are conducted to test the MRT-LB model, and the numerical results show that the proposed MRT-LB model has a fourth-order convergence rate, which is consistent with our theoretical analysis

    Immersed Boundary Smooth Extension: A high-order method for solving PDE on arbitrary smooth domains using Fourier spectral methods

    Full text link
    The Immersed Boundary method is a simple, efficient, and robust numerical scheme for solving PDE in general domains, yet it only achieves first-order spatial accuracy near embedded boundaries. In this paper, we introduce a new high-order numerical method which we call the Immersed Boundary Smooth Extension (IBSE) method. The IBSE method achieves high-order accuracy by smoothly extending the unknown solution of the PDE from a given smooth domain to a larger computational domain, enabling the use of simple Cartesian-grid discretizations (e.g. Fourier spectral methods). The method preserves much of the flexibility and robustness of the original IB method. In particular, it requires minimal geometric information to describe the boundary and relies only on convolution with regularized delta-functions to communicate information between the computational grid and the boundary. We present a fast algorithm for solving elliptic equations, which forms the basis for simple, high-order implicit-time methods for parabolic PDE and implicit-explicit methods for related nonlinear PDE. We apply the IBSE method to solve the Poisson, heat, Burgers', and Fitzhugh-Nagumo equations, and demonstrate fourth-order pointwise convergence for Dirichlet problems and third-order pointwise convergence for Neumann problems

    A multi-domain implementation of the pseudo-spectral method and compact finite difference schemes for solving time-dependent differential equations

    Get PDF
    Abstract : In this dissertation, we introduce new numerical methods for solving time-dependant differential equations. These methods involve dividing the domain of the problem into multiple sub domains. The nonlinearity of the differential equations is dealt with by using a Gauss-Seidel like relaxation or quasilinearisation technique. To solve the linearized iteration schemes obtained we use either higher order compact finite difference schemes or spectral collocation methods and we call the resulting methods the multi-domain compact finite difference relaxation method (MD-CFDRM), multi-domain compact finite difference quasilinearisation method (MD-CFDQLM) and multi-domain bivariate spectral quasilinearisation method (MD-BSQLM) respectively. We test the applicability of these methods in a wide variety of differential equations. The accuracy is compared against other methods as well as other results from literature. The MD-CFDRM is used to solve famous chaotic systems and hyperchaotic systems. Chaotic and hyperchaotic systems are characterized by high sensitivity to small perturbation on initial data and rapidly changing solutions. Such rapid variations in the solution pose tremendous problems to a number of numerical approximations. We modify the CFDs to be able to deal with such systems of equations. We also used the MD-CFDQLM to solve the nonlinear evolution partial differential equations, namely, the Fisher’s equation, Burgers- Fisher equation, Burgers-Huxley equation and the coupled Burgers’ equations over a large time domain. The main advantage of this approach is that it offers better accuracy on coarser grids which significantly improves the computational speed of the method for large time domain. We also studied the generalized Kuramoto-Sivashinsky (GKS) equations. The KS equations exhibit chaotic behaviour under certain conditions. We used the multi-domain bivariate spectral quasilinearisation method (MD-BSQLM) to approximate the numerical solutions for the generalized KS equations.M.Sc. (Pure and Applied Mathematics

    A multi-level spectral deferred correction method

    Get PDF
    The spectral deferred correction (SDC) method is an iterative scheme for computing a higher-order collocation solution to an ODE by performing a series of correction sweeps using a low-order timestepping method. This paper examines a variation of SDC for the temporal integration of PDEs called multi-level spectral deferred corrections (MLSDC), where sweeps are performed on a hierarchy of levels and an FAS correction term, as in nonlinear multigrid methods, couples solutions on different levels. Three different strategies to reduce the computational cost of correction sweeps on the coarser levels are examined: reducing the degrees of freedom, reducing the order of the spatial discretization, and reducing the accuracy when solving linear systems arising in implicit temporal integration. Several numerical examples demonstrate the effect of multi-level coarsening on the convergence and cost of SDC integration. In particular, MLSDC can provide significant savings in compute time compared to SDC for a three-dimensional problem
    • …
    corecore