Search

PISO (pressure-implicit with splitting of operators) is an algorithm devised to solve the transient incompressible Navier-Stokes and energy equations. In that it uses separate equations for each of two pressure corrections, velocity components and transported scalars, PISO is known as a segregated solution procedure. Preconditioned, generalized conjugate gradient (GCG) methods in combination with schemes for vectorization and storage minimization are described in the paper for the purpose of solving both the symmetric and non-symmetric algebraic equation systems that result from the PISO algorithm. Of particular interest in the paper is a comparison of the present procedure with a procedure described by Chin et al. (1992) in which preconditioned conjugate gradient methods are used to solve the Jacobian matrix used in the Newton iteration of the fully coupled non-linear equations. The two methods are similar in that both techniques are based on a discretization using staggered control volumes with the power-law method for modelling advection-diffusion transport. [ABSTRACT FROM AUTHOR]

In a recent paper we presented a data structure to be used with multigrid techniques on non- homogeneously refined FEM meshes. This paper focuses on the adaptive refinement techniques used there. The error estimate is obtained from standard Taylor series. For each element we compute its efficiency in terms of the size, the norm of the second derivatives of the unknown and the parameter p, where Lp is the chosen norm. The way the norm influences the optimal mesh is studied. The number of elements to be refined at each step is such to produce a fast convergence to the optimal mesh, followed by successive homogeneous refinements. We hope that the analysis of these two subjects could be of value for people working with other (perhaps very dissimilar) adaptive refinement techniques (error estimate and data structure, for instance). [ABSTRACT FROM AUTHOR]

The paper describes a new numerical algorithm for pure advection at large Courant numbers. The DISCUS scheme uses an accurate and proven control volume algorithm (QUICKEST) within a Lagrangian treatment of advection. By being in sympathy with the information flow dictated by characteristic lines, the scheme performs exceedingly well at Courant numbers greater than one. In contrast to existing Lagrangian schemes which use the characteristics to determine the grid points from which concentrations are interpolated, in DISCUS the characteristics are used to determine the appropriate location for the control volume. The scheme is of comparable accuracy to Eulerian schemes at Courant numbers less than one, but it increasingly outperforms them as the Courant number increases. Indeed, the results reported illustrate the futility of using an Eulerian scheme at high Courant numbers. [ABSTRACT FROM AUTHOR]

This paper presents an algorithm for obtaining the inverse of a tridiagonal matrix numerically. The algorithm does not require diagonal dominance in the matrix and is also computationally efficient. [ABSTRACT FROM AUTHOR]

In this paper an algorithm for generating pure triangular or pure quadrilateral meshes for arbitrary polygonal domains is presented. The first part shows a triangulation procedure being as suitable for local mesh refinement as for local mesh coarsening. In the second part an algorithm for transformation of triangular grids to quadrilateral meshes of the same relative mesh density is introduced. Two simple strategies are shown which can easily be implemented into any existing triangulation algorithm. [ABSTRACT FROM AUTHOR]