--- manual/s_algorithm/text/spatial-discrete.tex 2004/10/17 04:14:21 1.18 +++ manual/s_algorithm/text/spatial-discrete.tex 2006/06/27 19:10:32 1.20 @@ -1,4 +1,4 @@ -% $Header: /home/ubuntu/mnt/e9_copy/manual/s_algorithm/text/spatial-discrete.tex,v 1.18 2004/10/17 04:14:21 jmc Exp $ +% $Header: /home/ubuntu/mnt/e9_copy/manual/s_algorithm/text/spatial-discrete.tex,v 1.20 2006/06/27 19:10:32 jmc Exp $ % $Name: $ \section{Spatial discretization of the dynamical equations} @@ -13,8 +13,6 @@ representation of the position of the boundary. We treat the horizontal and vertical directions as separable and differently. -\input{part2/notation} - \subsection{The finite volume method: finite volumes versus finite difference} \begin{rawhtml} @@ -150,8 +148,8 @@ The model domain is decomposed into tiles and within each tile a quasi-regular grid is used. A tile is the basic unit of domain decomposition for parallelization but may be used whether parallelized -or not; see section \ref{sect:tiles} for more details. Although the -tiles may be patched together in an unstructured manner +or not; see section \ref{sect:domain_decomposition} for more details. +Although the tiles may be patched together in an unstructured manner (i.e. irregular or non-tessilating pattern), the interior of tiles is a structured grid of quadrilateral cells. The horizontal coordinate system is orthogonal curvilinear meaning we can not necessarily treat