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
grid blocks with a generic grid block having a fixed number of 4 grid
cells per coordinate direction independent of the refinement level. A
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
(*δ* *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
resolution from one refinement level to the next higher.
......
......