Update 3.1 Code basics authored by Udo Ziegler's avatar Udo Ziegler
...@@ -406,9 +406,9 @@ The mesh refinement algorithm relies on the oct-tree data structure ...@@ -406,9 +406,9 @@ The mesh refinement algorithm relies on the oct-tree data structure
grid blocks with a generic grid block having a fixed number of 4 grid grid blocks with a generic grid block having a fixed number of 4 grid
cells per coordinate direction independent of the refinement level. A cells per coordinate direction independent of the refinement level. A
generic grid block of refinement level *l* has grid spacings generic grid block of refinement level *l* has grid spacings
(**x*<sup>(*l*)</sup>, **y*<sup>(*l*)</sup>, **z*<sup>(*l*)</sup>) = (**x*<sup>(0)</sup>, **y*<sup>(0)</sup>, **z*<sup>(0)</sup>)/2<sup>*l*</sup> (*δx*<sup>(*l*)</sup>, *δy*<sup>(*l*)</sup>, *δz*<sup>(*l*)</sup>) = (*δx*<sup>(0)</sup>, *δy*<sup>(0)</sup>, *δz*<sup>(0)</sup>)/2<sup>*l*</sup>
where where
(**x*<sup>(0)</sup>, **y*<sup>(0)</sup>, **z*<sup>(0)</sup>) (*δx*<sup>(0)</sup>, *δy*<sup>(0)</sup>, *δz*<sup>(0)</sup>)
is the grid spacing of the base level, i.e., there is a doubling of is the grid spacing of the base level, i.e., there is a doubling of
resolution from one refinement level to the next higher. resolution from one refinement level to the next higher.
... ...
......