class LaplaceProblem
{
public:
- LaplaceProblem (const unsigned int deg);
+ LaplaceProblem (const unsigned int degree);
void run ();
private:
const unsigned int degree;
// The following four objects are the only additional member variables,
- // compared to step-6. They first three represent the operators that act
+ // compared to step-6. The first three represent the operators that act
// on individual levels of the multilevel hierarchy, rather than on the
// finest mesh as do the objects above while the last object stores
// information about the boundary indices on each level and information
// @sect4{LaplaceProblem::assemble_system}
- // The following function assembles the linear system on the finesh level of
+ // The following function assembles the linear system on the finest level of
// the mesh. It is almost exactly the same as in step-6, with the exception
// that we don't eliminate hanging nodes and boundary values after
// assembling, but while copying local contributions into the global
// The indices just identified will later be used to decide where the
// assembled value has to be added into on each level. On the other hand,
// we also have to impose zero boundary conditions on the external
- // boundary of each level. But this the <code>MGConstraints</code> knows
- // it. So we simply ask for them by calling <code>get_boundary_indices
- // ()</code>. The third step is to construct constraints on all those
+ // boundary of each level. But this the <code>MGConstraints</code> knows.
+ // So we simply ask for them by calling <code>get_boundary_indices()</code>.
+ // The third step is to construct constraints on all those
// degrees of freedom: their value should be zero after each application
// of the level operators. To this end, we construct ConstraintMatrix
// objects for each level, and add to each of these constraints for each
// communicator object that only links a subset of all processes), and call
// the Utilities helper functions to determine the number of processes and
// where the present one fits into this picture. In addition, we make sure
- // that output is only generated by the (globally) first process. As,
- // this_mpi_process is determined after creation of pcout, we cannot set the
- // condition through the constructor, i.e. by pcout(std::cout,
- // this_mpi_process==0), but set the condition separately.
+ // that output is only generated by the (globally) first process. As
+ // <code>this_mpi_process</code> is determined after creation of pcout, we
+ // cannot set the condition through the constructor, i.e. by
+ // <code>pcout(std::cout, this_mpi_process==0)</code>, but set the
+ // condition separately.
template <int dim>
ElasticProblem<dim>::ElasticProblem ()
:
// The last argument to the call just performed allows for some
// optimizations. It controls whether we should also delete the column
// corresponding to a boundary node, or keep it (and passing
- // <code>true</code> as above means: yes, do eliminate the column). If we
+ // <code>true</code> means: yes, do eliminate the column). If we
// do, then the resulting matrix will be symmetric again if it was before;
// if we don't, then it won't. The solution of the resulting system should
// be the same, though. The only reason why we may want to make the system
projects / dealii.git / commitdiff