27.11.2012 Views

FLOW AROUND A CYLINDER - istiarto

FLOW AROUND A CYLINDER - istiarto

FLOW AROUND A CYLINDER - istiarto

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

– 4.47 –<br />

� reconstruct the mesh, maintain the number of cells in the vertical and their relative<br />

positions to the local depth<br />

� use linear interpolation to get variables at the new cell centers (see Fig. 4.11b) in<br />

order to maintain the continuity:<br />

�z<br />

uP �� � uP �z ��<br />

, v �z<br />

P �� � vP �z ��<br />

, wP �� � w P,<br />

�z<br />

kP �� � kP �z ��<br />

, � �z<br />

P �� � �P �z ��<br />

, pP �� � pP � � gz �h<br />

� continue the computation to the next time level<br />

4.6 Solution procedures<br />

4.6.1 Spatial discretisation<br />

Applying the discretized governing equations, Eqs. 4.52 and 4.68 requires spatial<br />

discretisation of the computational domain. The domain is divided into Ni–2, Nj–2, and<br />

Nk–2 cells in the x-, y-, z-directions, respectively, from which there are Ni, Nj, and Nk<br />

nodes (interior, boundary, and dummy nodes) in the corresponding directions. A typical<br />

spatial discretisation is shown in Fig. 4.12. The cell and node are denoted by a single<br />

index; the cells are indexed by ijk = 2,3,…,Nijkm, going along the y-direction (j =<br />

2,3,…,Nj–1), the x-direction (i = 2,3,…,Ni–1), and the z-direction (k = 2,3,…,Nk–1),<br />

while the nodes are indexed by ijk = 1,2,…,Nijk. With this indexing, the single-index ijk<br />

for a cell and for its six-neighbors can be easily obtained from their position in the (x,y,z)<br />

space (see Table 4.5).<br />

Writing Eq. 4.52 or 4.68 for all cells, ijk = 2,3,…,Nijkm, produces a series of algebraic<br />

linear equations which can be presented in a matrix form as follows:<br />

A � � B (4.97)<br />

The matrix A contains the coefficients of the equations, a nb and a P , � is a column matrix<br />

of the dependent variable, and B is a column matrix of the source terms. The matrix A<br />

has diagonal blocks which are themselves tridiagonal, and sub- and super-diagonal blocks<br />

in which each block has two diagonals, thus it has only 7 non-zero diagonals while the<br />

other elements are zero. It is then not necessary to store all elements of the matrix A; only<br />

those seven diagonals need to be stored. To facilitate the storage, each non-zero diagonal<br />

is stored in a separate column matrix, i.e. A nb , nb = EWNSTB, and A P . Fig. 4.13 shows<br />

the form of the matrix A.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!