Yongsheng Lian ¹

CMES-Computer Modeling in Engineering & Sciences, Vol.72, No.1, pp. 1-16, 2011, DOI:10.3970/cmes.2011.072.001

Abstract In this paper we simulate the unsteady, incompressible, and laminar flow behavior over a flat plate with round leading and trailing edges. A pressure-Poisson method is used to solve the incompressible Navier-Stokes equations. Both convection and diffusion terms are discretized using a second-order accurate central difference method. A second-order accurate split-step scheme with an Adam's predictor corrector time-stepping method is adopted for the time integration. An overlapping moving grid approach is employed to dynamically update the grid due to the plate motion. The effects of the pitch rate, Reynolds number, location of pitch axis, and computational domain size are investigated.… More >

Ruben Avila¹, Zhidong Han², Satya N. Atluri³

CMES-Computer Modeling in Engineering & Sciences, Vol.71, No.4, pp. 363-396, 2011, DOI:10.3970/cmes.2011.071.363

Abstract The two dimensional steady state Stokes equations are solved by using a novel MLPG-Mixed Finite Volume method, that is based on the independent meshless interpolations of the deviatoric velocity strain tensor, the volumetric velocity strain tensor, the velocity vector and the pressure. The pressure field directly obtained from this method does not suffer from the malady of checker-board patterns. Numerical simulations of the flow field, and trajectories of passive fluid elements in a new complex Stokes flow are also presented. The new flow geometry consists of three coaxial cylinders two of smaller diameter, that steadily rotate independently, inside a third… More >

Jianxin Zhu¹, Zheqi Shen¹

CMES-Computer Modeling in Engineering & Sciences, Vol.71, No.4, pp. 347-362, 2011, DOI:10.3970/cmes.2011.071.347

Abstract It is known that the perfectly matched layer (PML) is a powerful tool to truncate the unbounded domain. Recently, the PML technique has been introduced in the computation of nonlinear Schrödinger equations (NSE), in which the nonlinearity is separated by some efficient time-splitting methods. A major task in the study of PML is that the original equation is modified by a factor c which varies fast inside the layer. And a large number of grid points are needed to capture the profile of c in the discretization. In this paper, the possibility is discussed for using some nonuniform finite difference… More >

Jin Li ¹, De-hao Yu ²

CMES-Computer Modeling in Engineering & Sciences, Vol.71, No.4, pp. 331-346, 2011, DOI:10.3970/cmes.2011.071.331

Abstract The composite rectangle (midpoint) rule for the computation of multi-dimensional singular integrals is discussed, and the superconvergence results is obtained. When the local coordinate is coincided with certain priori known coordinates, we get the convergence rate one order higher than the global one. At last, numerical examples are presented to illustrate our theoretical analysis which agree with it very well. More >

G.A. Gravvanis¹, K.M. Giannoutakis²

CMES-Computer Modeling in Engineering & Sciences, Vol.71, No.4, pp. 305-330, 2011, DOI:10.3970/cmes.2011.071.305

Abstract In this paper we present parallel explicit approximate inverse matrix techniques for solving sparse linear systems on shared memory systems, which are derived using the finite element method for biharmonic equations in three space variables. Our approach for solving such equations is by considering the biharmonic equation as a coupled equation approach (pair of Poisson equation), using a FE approximation scheme, yielding an inner-outer iteration method. Additionally, parallel approximate inverse matrix algorithms are introduced for the efficient solution of sparse linear systems, based on an anti-diagonal computational approach that eliminates the data dependencies. Parallel explicit preconditioned conjugate gradient-type schemes in… More >

Chein-Shan Liu¹, Satya N. Atluri²

CMES-Computer Modeling in Engineering & Sciences, Vol.71, No.3, pp. 279-304, 2011, DOI:10.3970/cmes.2011.071.279

Abstract For solving a system of nonlinear algebraic equations (NAEs) of the type: F(x)=0, or F_i(x_j) = 0, i,j = 1,...,n, a Newton-like algorithm has several drawbacks such as local convergence, being sensitive to the initial guess of solution, and the time-penalty involved in finding the inversion of the Jacobian matrix ∂F_i/∂x_j. Based-on an invariant manifold defined in the space of (x,t) in terms of the residual-norm of the vector F(x), we can derive a gradient-flow system of nonlinear ordinary differential equations (ODEs) governing the evolution of x with a fictitious time-like variable t as an independent variable. We can prove… More >