The Laplace transform method for Burgers' equation

The Laplace transform method (LTM) is introduced to solve Burgers' equation. Because of the nonlinear term in Burgers' equation, one cannot directly apply the LTM. Increment linearization technique is introduced to deal with the situation. This is a key idea in this paper. The increment linearization technique is the following: In time level t, we divide the solution u(x, t) into two parts: u(x, t^k) and w(x, t), t^k⩽t⩽t^k+1, and obtain a time‐dependent linear partial differential equation (PDE) for w(x, t). For this PDE, the LTM is applied to eliminate time dependency. The subsequent boundary value problem is solved by rational collocation method on transformed Chebyshev points. To face the well‐known computational challenge represented by the numerical inversion of the Laplace transform, Talbot's method is applied, consisting of numerically integrating the Bromwich integral on a special contour by means of trapezoidal or midpoint rules. Numerical experiments illustrate that the present method is effective and competitive. Copyright © 2009 John Wiley & Sons, Ltd.     

An operator splitting algorithm for the three-dimensional advection–diffusion equation

Operator splitting algorithms are frequently used for solving the advection–diffusion equation, especially to deal with advection dominated transport problems. In this paper an operator splitting algorithm for the three-dimensional advection–diffusion equation is presented. The algorithm represents a second-order-accurate adaptation of the Holly and Preissmann scheme for three-dimensional problems. The governing equation is split into an advection equation and a diffusion equation, and they are solved by a backward method of characteristics and a finite element method, respectively. The Hermite interpolation function is used for interpolation of concentration in the advection step. The spatial gradients of concentration in the Hermite interpolation are obtained by solving equations for concentration gradients in the advection step. To make the composite algorithm efficient, only three equations for first-order concentration derivatives are solved in the diffusion step of computation. The higher-order spatial concentration gradients, necessary to advance the solution in a computational cycle, are obtained by numerical differentiations based on the available information. The simulation characteristics and accuracy of the proposed algorithm are demonstrated by several advection dominated transport problems. © 1998 John Wiley & Sons, Ltd.     

Refining the submesh strategy in the two‐level finite element method: application to the advection–diffusion equation

We introduce a new submesh strategy for the two‐level finite element method. The numerical results show that the new submesh is able to better capture the boundary layer which is caused by the choice of bubble functions. The effect of an improved approximation of the residual free bubbles is studied for the advective–diffusive equation. Copyright © 2002 John Wiley & Sons, Ltd.     

A multiscale control volume finite element method for advection–diffusion equations

We present a new stabilized method for advection–diffusion equations, which combines a control volume FEM formulation of the governing equations with a novel multiscale approximation of the total flux. The latter incorporates information about the exact solution that cannot be represented on the mesh. To define this flux, we solve the governing equations along suitable mesh segments under the assumption that the flux varies linearly along these segments. This procedure yields second‐order accurate fluxes on the edges of the mesh. Then, we use curl‐conforming elements of the same order to lift these edge fluxes into the mesh elements. In so doing, we obtain a stabilized control volume FEM formulation that is second‐order accurate and does not require mesh‐dependent stabilization parameters. Numerical convergence studies on uniform and nonuniform grids along with several standard advection tests illustrate the computational properties of the new method. Published 2015. This article is a U.S. Government work and is in the public domain in the USA.     

Insights on a sign‐preserving numerical method for the advection–diffusion equation

In this paper we explore theoretically and numerically the application of the advection transport algorithm introduced by Smolarkiewicz to the one‐dimensional unsteady advection–diffusion equation. The scheme consists of a sequence of upwind iterations, where the initial iteration is the first‐order accurate upwind scheme, while the subsequent iterations are designed to compensate for the truncation error of the preceding step. Two versions of the method are discussed. One, the classical version of the method, regards the second‐order terms of the truncation error and the other considers additionally the third‐order terms. Stability and convergence are discussed and the theoretical considerations are illustrated through numerical tests. The numerical tests will also indicate in which situations are advantageous to use the numerical methods presented. Copyright © 2008 John Wiley & Sons, Ltd.     

Comparison of Galerkin and control volume finite element for advection–diffusion problems

The control volume finite element method (CVFEM) was developed to combine the local numerical conservation property of control volume methods with the unstructured grid and generality of finite element methods (FEMs). Most implementations of CVFEM include mass‐lumping and upwinding techniques typical of control volume schemes. In this work we compare, via numerical error analysis, CVFEM and FEM utilizing consistent and lumped mass implementations, and stabilized Petrov–Galerkin streamline upwind schemes in the context of advection–diffusion processes. For this type of problem, we find no apparent advantage to the local numerical conservation aspect of CVFEM as compared to FEM. The stabilized schemes improve accuracy and degree of positivity on coarse grids, and also reduce iteration counts for advection‐dominated problems. Published in 2005 by John Wiley & Sons, Ltd.     

A stabilized formulation for the advection–diffusion equation using the Generalized Finite Element Method

This paper presents a stable formulation for the advection–diffusion equation based on the Generalized (or eXtended) Finite Element Method, GFEM (or X‐FEM). Using enrichment functions that represent the exponential character of the exact solution, smooth numerical solutions are obtained for problems with steep gradients and high Péclet numbers in one‐ and two‐dimensions. In contrast with traditional stabilized methods that require the construction of stability parameters and stabilization terms, the present work avoids numerical instabilities by improving the classical Galerkin solution with enrichment functions (that need not be polynomials) using GFEM, which is an instance of the partition of unity framework. This work also presents a strategy for constructing enrichment functions for problems involving complex geometries by employing a global–local‐type approach. Representative numerical results are presented to illustrate the performance of the proposed method. Copyright © 2010 John Wiley & Sons, Ltd.     

Finite difference methods for solving the two-dimensional advection–diffusion equation

Using weighted discretization with the modified equivalent partial differential equation approach, several accurate finite difference methods are developed to solve the two-dimensional advection–diffusion equation following the success of its application to the one-dimensional case. These new methods are compared with the conventional finite difference methods in terms of stability and accuracy. The new methods are more accurate and often more stable than the conventional schemes.     

The use of Sinc‐collocation method for solving Falkner–Skan boundary‐layer equation

The MHD Falkner–Skan equation arises in the study of laminar boundary layers exhibiting similarity on the semi‐infinite domain. The proposed approach is equipped by the orthogonal Sinc functions that have perfect properties. This method solves the problem on the semi‐infinite domain without truncating it to a finite domain and transforming domain of the problem to a finite domain. In addition, the governing partial differential equations are transformed into a system of ordinary differential equations using similarity variables, and then they are solved numerically by the Sinc‐collocation method. It is shown that the Sinc‐collocation method converges to the solution at an exponential rate. Copyright © 2010 John Wiley & Sons, Ltd.     

Exponential spline interpolation in characteristic based scheme for solving the advective–diffusion equation

This paper demonstrates the use of shape‐preserving exponential spline interpolation in a characteristic based numerical scheme for the solution of the linear advective–diffusion equation. The results from this scheme are compared with results from a number of numerical schemes in current use using test problems in one and two dimensions. These test cases are used to assess the merits of using shape‐preserving interpolation in a characteristic based scheme. The evaluation of the schemes is based on accuracy, efficiency, and complexity. The use of the shape‐preserving interpolation in a characteristic based scheme is accurate, captures discontinuities, does not introduce spurious oscillations, and preserves the monotonicity and positivity properties of the exact solution. However, fitting exponential spline interpolants to the nodal concentrations is computationally expensive. Exponential spline interpolants were also fitted to the integral of the concentration profile. The integral of the concentration profile is a smoother function than the concentration profile. It requires less computational effort to fit an exponential spline interpolant to the integral than the nodal concentrations. By differentiating the interpolant, the nodal concentrations are obtained. This results in a more efficient and more accurate numerical scheme. Copyright © 2000 John Wiley & Sons, Ltd.     

A lattice Boltzmann method for solute transport

A lattice Boltzmann method is developed for solute transport. Proper expressions for the local equilibrium distribution functions enable the method to be formulated on rectangular lattice with the same simple procedure as that on a square lattice. This provides an additional advantage over a lattice Boltzmann method on a square lattice for problems characterized by dominant phenomenon in one direction and relatively weak in another such as solute transport in shear flow over a narrow channel, where the problems can efficiently be approached with fine and coarse meshes, respectively, resulting in more efficient algorithm. The stability conditions are also described. The proposed method on a square lattice is naturally recovered when a square lattice is used. It is verified by solving four tests and compared with the analytical/exact solutions. They are in good agreement, demonstrating that the method is simple, accurate and robust for solute transport. Copyright © 2008 John Wiley & Sons, Ltd.     

A new velocity–vorticity boundary integral formulation for Navier–Stokes equations

In the present work, an indirect boundary integral method for the numerical solution of Navier–Stokes equations formulated in velocity–vorticity dependent variables is proposed. This wholly integral approach, based on Helmholtz's decomposition, deals directly with the vorticity field and gives emphasis to the establishment of appropriate boundary conditions for the vorticity transport equation. The coupling between the vorticity and the vortical velocity fields is expressed by an iterative procedure. The present analysis shows the usefulness of an integral formulation not only in providing a potentially more efficient computational tool, but also in giving a better understanding to the physics of the phenomenon. Copyright © 2000 John Wiley & Sons, Ltd.     

An upwind finite‐volume element scheme and its maximum‐principle‐preserving property for nonlinear convection–diffusion problem

For a class of nonlinear convection–diffusion equation in multiple space dimensions, a kind of upwind finite‐volume element (UFVE) scheme is put forward. Some techniques, such as calculus of variations, commutating operators and prior estimates, are adopted. It is proved that the UFVE scheme is unconditionally stable and satisfies maximum principle. Optimal‐order estimates in H¹‐norm are derived to determine the error in the approximate solution. Numerical results are presented to observe the performance of the scheme. Copyright © 2007 John Wiley & Sons, Ltd.     

Fully coupled finite volume solutions of the incompressible Navier–Stokes and energy equations using an inexact Newton method

An inexact Newton method is used to solve the steady, incompressible Navier–Stokes and energy equation. Finite volume differencing is employed on a staggered grid using the power law scheme of Patankar. Natural convection in an enclosed cavity is studied as the model problem. Two conjugate-gradient -like algorithms based upon the Lanczos biorthogonalization procedure are used to solve the linear systems arising on each Newton iteration. The first conjugate-gradient-like algorithm is the transpose-free quasi-minimal residual algorithm (TFQMR) and the second is the conjugate gradients squared algorithm (CGS). Incomplete lower-upper (ILU) factorization of the Jacobian matrix is used as a right preconditioner. The performance of the Newton- TFQMR algorithm is studied with regard to different choices for the TFQMR convergence criteria and the amount of fill-in allowed in the ILU factorization. Performance data are compared with results using the Newton-CGS algorithm and previous results using LINPACK banded Gaussian elimination (direct-Newton). The inexact Newton algorithms were found to be CPU competetive with the direct-Newton algorithm for the model problem considered. Among the inexact Newton algorithms, Newton-CGS outperformed Newton- TFQMR with regard to CPU time but was less robust because of the sometimes erratic CGS convergence behaviour.     

Three‐dimensional transient Navier–Stokes solvers in cylindrical coordinate system based on a spectral collocation method using explicit treatment of the pressure

A spectral collocation method is developed for solving the three‐dimensional transient Navier–Stokes equations in cylindrical coordinate system. The Chebyshev–Fourier spectral collocation method is used for spatial approximation. A second‐order semi‐implicit scheme with explicit treatment of the pressure and implicit treatment of the viscous term is used for the time discretization. The pressure Poisson equation enforces the incompressibility constraint for the velocity field, and the pressure is solved through the pressure Poisson equation with a Neumann boundary condition. We demonstrate by numerical results that this scheme is stable under the standard Courant–Friedrichs–Lewy (CFL) condition, and is second‐order accurate in time for the velocity, pressure, and divergence. Further, we develop three accurate, stable, and efficient solvers based on this algorithm by selecting different collocation points in r‐, ? ‐, and z‐directions. Additionally, we compare two sets of collocation points used to avoid the axis, and the numerical results indicate that using the Chebyshev Gauss–Radau points in radial direction to avoid the axis is more practical for solving our problem, and its main advantage is to save the CPU time compared with using the Chebyshev Gauss–Lobatto points in radial direction to avoid the axis. Copyright © 2010 John Wiley & Sons, Ltd.     

Linearized and rational approximation method for solving non‐linear Burgers' equation

A new numerical method called linearized and rational approximation method is presented to solve non‐linear evolution equations. The utility of the method is demonstrated for the case of differentiation of functions involving steep gradients. The solution of Burgers' equation is presented to illustrate the effectiveness of the technique for the solution of non‐linear evolution equations exhibiting nearly discontinuous solutions. Copyright © 2004 John Wiley & Sons, Ltd.     

Control strategies for timestep selection in finite element simulation of incompressible flows and coupled reaction–convection–diffusion processes

We propose two timestep selection algorithms, based on feedback control theory, for finite element simulation of steady state and transient 2D viscous flow and coupled reaction–convection–diffusion processes. To illustrate performance of the schemes in practice, we solve Rayleigh–Benard–Marangoni flows, flow across a backward‐facing step, unsteady flow around a circular cylinder and chemical reaction systems. Numerical experiments confirm that the feedback controllers produce in some cases a very smooth stepsize variation, suggesting that robust control algorithms are possible. These experiments also show that parameter selection can improve timesteps when co‐ordinated with the convergence control of non‐linear iterations. Further, computational cost of the selection procedures is negligible, since they involve only storing a few extra vectors, computation of norms and evaluation of kinetic energy. Copyright © 2004 John Wiley & Sons, Ltd.     

A pressure correction method for fluid–particle interaction flow: Direct‐forcing method and sedimentation flow

A direct‐forcing pressure correction method is developed to simulate fluid–particle interaction problems. In this paper, the sedimentation flow is investigated. This method uses a pressure correction method to solve incompressible flow fields. A direct‐forcing method is introduced to capture the particle motions. It is found that the direct‐forcing method can also be served as a wall‐boundary condition. By applying Gauss's divergence theorem, the formulas for computing the hydrodynamic force and torque acting on the particle from flows are derived from the volume integral of the particle instead of the particle surface. The order of accuracy of the present method is demonstrated by the errors of velocity, pressure, and wall stress. To demonstrate the efficiency and capability of the present method, sedimentations of many spherical particles in an enclosure are simulated. Copyright © 2010 John Wiley & Sons, Ltd.