* on. If one of the two masks has more non-zero than the other, then the
* excess components will be ignored.
*
- * If the domain $B$ does not fall withing $\Omega$, an exception will be
+ * If the domain $B$ does not fall within $\Omega$, an exception will be
* thrown by the algorithm that computes the quadrature point locations. In
* particular, notice that this function only makes sens for `dim1` lower or
* equal than `dim0`. A static assert guards that this is actually the case.
* on. If one of the two masks has more non-zero entries non-zero than the
* other, then the excess components will be ignored.
*
- * If the domain $B$ does not fall withing $\Omega$, an exception will be
+ * If the domain $B$ does not fall within $\Omega$, an exception will be
* thrown by the algorithm that computes the quadrature point locations. In
* particular, notice that this function only makes sens for `dim1` lower or
* equal than `dim0`. A static assert guards that this is actually the case.
* in the main function @p approximate.
*
* Due to this way of operation, the class may be easily extended for higher
- * oder derivatives than are presently implemented. Basically, only an
+ * order derivatives than are presently implemented. Basically, only an
* additional class along the lines of the derivative descriptor classes @p
* Gradient and @p SecondDerivative has to be implemented, with the respective
* typedefs and functions replaced by the appropriate analogues for the
// file.
read_json (in, node_tree);
- // The xml function is reused to read in the xml into the paramter file.
+ // The xml function is reused to read in the xml into the parameter file.
// This means that only mangled files can be read.
read_xml_recursively (node_tree, "", path_separator, patterns, *entries);
}
if (space_gtl[comp_i] == immersed_gtl[comp_j])
for (unsigned int oq=0; oq<o_fe_v.n_quadrature_points; ++oq)
{
- // Get the corrisponding q point
+ // Get the corresponding q point
const unsigned int q=ids[oq];
cell_matrix(i,j) += ( fe_v.shape_value(j,q) *