* face. This information is
* redundant to some fields in the
* derived classes but makes
- * writing dimension independant
+ * writing dimension independent
* programs easier.
*/
const unsigned int dofs_per_face;
* on a cell. This information is
* redundant to some fields in the
* derived classes but makes
- * writing dimension independant
+ * writing dimension independent
* programs easier.
*/
const unsigned int dofs_per_cell;
* problems and an algorithm to reorder cells such that they
* satisfy the conditions outlined above.
*
- * @item Copying a triangulation: when computing on time dependant meshes
+ * @item Copying a triangulation: when computing on time dependent meshes
* of when using adaptive refinement, you will often want to create a
* new triangulation to be the same as another one. This is facilitated
* by the @p{copy_triangulation} function.
* Store all information which belongs to one level of the multilevel hierarchy.
*
* In @ref{TriangulationLevel<0>} all data is stored which is not
- * dependant on the dimension, e.g. a field to store the
+ * dependent on the dimension, e.g. a field to store the
* refinement flag for the cells (what a cell actually is
* is declared elsewhere), etc. Actually, it is only cell-based
* data, like neighborship info or refinement flags. There is another
* The projection of the boundary values first, then eliminating them from
* the global system of equations is not needed usually. It may be necessary
* if you want to enforce special restrictions on the boundary values of the
- * projected function, for example in time dependant problems: you may want
+ * projected function, for example in time dependent problems: you may want
* to project the initial values but need consistency with the boundary
* values for later times. Since the latter are projected onto the boundary
* in each time step, it is necessary that we also project the boundary