--- manual/s_algorithm/text/spatial-discrete.tex	2004/10/16 03:40:12	1.17
+++ manual/s_algorithm/text/spatial-discrete.tex	2006/04/05 01:16:27	1.19
@@ -1,4 +1,4 @@
-% $Header: /home/ubuntu/mnt/e9_copy/manual/s_algorithm/text/spatial-discrete.tex,v 1.17 2004/10/16 03:40:12 edhill Exp $
+% $Header: /home/ubuntu/mnt/e9_copy/manual/s_algorithm/text/spatial-discrete.tex,v 1.19 2006/04/05 01:16:27 jmc Exp $
 % $Name:  $
 
 \section{Spatial discretization of the dynamical equations}
@@ -150,8 +150,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
@@ -370,7 +370,7 @@
 The above grid (Fig.~\ref{fig:vgrid}a) is known as the cell centered
 approach because the tracer points are at cell centers; the cell
 centers are mid-way between the cell interfaces. 
-This discretisation is selected when the thickness of the
+This discretization is selected when the thickness of the
 levels are provided ({\bf delR}, parameter file {\em data}, 
 namelist {\em PARM04})
 An alternative, the vertex or interface centered approach, is shown in