/**
* A structure that, together with
* its partial specializations
- * NumberTraits<std::complex<number> > ,
+ * NumberTraits<std::complex<number> >,
* provides traits and member
* functions that make it possible
* to write templates that work on
*
* @code
*
- * set Function constants = lambda=1. , alpha=2., gamma=3.
+ * set Function constants = lambda=1., alpha=2., gamma=3.
*
* @endcode
*
unsigned int degree () const;
/**
- * Return the name of the space ,
+ * Return the name of the space,
* which is <tt>ABF</tt>.
*/
std::string name () const;
unsigned int degree () const;
/**
- * Return the name of the space ,
+ * Return the name of the space,
* which is <tt>BDM</tt>.
*/
std::string name () const;
unsigned int degree () const;
/**
- * Return the name of the space ,
+ * Return the name of the space,
* which is <tt>Nedelec</tt>.
*/
std::string name () const;
* Raviart-Thomas-space, which is the degree
* of the largest tensor product
* polynomial space
- * <i>Q<sub>k</sub></i> contained.
+ * <i>Q<sub>k</sub></i> contains.
*/
PolynomialsRaviartThomas (const unsigned int k);
unsigned int degree () const;
/**
- * Return the name of the space ,
+ * Return the name of the space,
* which is <tt>RaviartThomas</tt>.
*/
std::string name () const;
*
* @todo This is for 2D only.
*
- * @todo Transformation works only for uniform, Cartesian meshes
+ * @todo Transformation works only for uniform, Cartesian meshes.
*
- * The matching pressure psace for FE_BDM of order <i>k</i> is the
+ * The matching pressure space for FE_BDM of order <i>k</i> is the
* element FE_DGP of order <i>k</i>.
*
* The BDM element of order @p p has <i>p+1</i> degrees of freedom on
{
public:
/**
- * Constructor for the Nédélec
+ * Constructor for the discontinuous Nédélec
* element of degree @p p.
*/
FE_DGNedelec (const unsigned int p);
{
public:
/**
- * Constructor for the Nédélec
+ * Constructor for the Raviart-Thomas
* element of degree @p p.
*/
FE_DGRaviartThomas (const unsigned int p);
{
public:
/**
- * Constructor for the Nédélec
+ * Constructor for the discontinuous BDM
* element of degree @p p.
*/
FE_DGBDM (const unsigned int p);
* Return a string that uniquely
* identifies a finite
* element. This class returns
- * <tt>FE_DGQArbitraryNodes<dim>(degree)</tt> ,
+ * <tt>FE_DGQArbitraryNodes<dim>(degree)</tt>,
* with <tt>dim</tt> and <tt>degree</tt>
* replaced by appropriate
* values.
* Return a string that uniquely
* identifies a finite
* element. This class returns
- * <tt>FE_DGQ<dim>(degree)</tt>, with
+ * <tt>FE_FaceQ<dim>(degree)</tt>, with
* <tt>dim</tt> and <tt>degree</tt>
* replaced by appropriate
* values.
* The node values above rely on integrals, which will be computed by
* quadrature rules themselves. The generalized support points are a
* set of points such that this quadrature can be performed with
- * sufficient accuracy. The points needed are thode of
+ * sufficient accuracy. The points needed are those of
* QGauss<sub>k+1</sub> on each edge and QGauss<sub>k+2</sub> on each face and in
* the interior of the cell (or none for N<sub>1</sub>).
*
* (we've closed a loop or
* unoriented sides).
*
- * 6) Repeat 2), 3) ,4) and
+ * 6) Repeat 2), 3), 4) and
* 5) on other unoriented
* sides of (A)
*
* An approximate eigenvalue is accepted
* as converged when it is determined to
* lie in an interval [a,b] of width less
- * than or equal to abs_accuracy + eps * max( |a|,|b| ) ,
+ * than or equal to abs_accuracy + eps * max( |a|,|b| ),
* where eps is the machine precision.
* If abs_accuracy is less than
* or equal to zero, then eps*|t| will
* other processes to join in on this. Since the other processes don't call
* this function, you will either get a time-out on the first process, or,
* worse, by the time the next a callto a PETSc function generates an MPI
- * message on the other processes , you will get a cryptic message that only a
+ * message on the other processes, you will get a cryptic message that only a
* subset of processes attempted a communication. These bugs can be very hard
* to figure out, unless you are well-acquainted with the communication model
* of MPI, and know which functions may generate MPI messages.
* all the other processes to join in on this. Since the other processes
* don't call this function, you will either get a time-out on the first
* process, or, worse, by the time the next a callto a Trilinos function
- * generates an MPI message on the other processes , you will get a
+ * generates an MPI message on the other processes, you will get a
* cryptic message that only a subset of processes attempted a
* communication. These bugs can be very hard to figure out, unless you
* are well-acquainted with the communication model of MPI, and know
projects / dealii-svn.git / commitdiff