FE_DGQ<dim> fe;
DoFHandler<dim> dof_handler;
- // The next four members
- // represent the linear system to
- // be solved. #system_matrix and
- // #right_hand_side are generated
- // by assemble_system(), the
- // #solution is computed in
- // solve(). The #sparsity_pattern
- // is used to determine the
- // location of nonzero elements
- // in #system_matrix.
+ // The next four members represent the
+ // linear system to be
+ // solved. <code>system_matrix</code> and
+ // <code>right_hand_side</code> are
+ // generated by
+ // <code>assemble_system()</code>, the
+ // <code>solution</code> is computed in
+ // <code>solve()</code>. The
+ // <code>sparsity_pattern</code> is used
+ // to determine the location of nonzero
+ // elements in
+ // <code>system_matrix</code>.
SparsityPattern sparsity_pattern;
SparseMatrix<double> system_matrix;
};
- // We start with the constructor. The
- // 1 in the constructor call of #fe
- // is the polynomial degree.
+ // We start with the constructor. The 1 in
+ // the constructor call of <code>fe</code> is
+ // the polynomial degree.
template <int dim>
Step12<dim>::Step12 ()
:
// need to distribute the DoFs.
dof_handler.distribute_dofs (fe);
- // We start by generating the
- // sparsity pattern. To this end,
- // we first fill an intermediate
- // object of type
- // CompressedSparsityPattern with
- // the couplings appearing in the
- // system. After building the
- // pattern, this object is copied
- // to #sparsity_pattern and can be
- // discarded.
+ // We start by generating the sparsity
+ // pattern. To this end, we first fill an
+ // intermediate object of type
+ // CompressedSparsityPattern with the
+ // couplings appearing in the system. After
+ // building the pattern, this object is
+ // copied to <code>sparsity_pattern</code>
+ // and can be discarded.
// To build the sparsity pattern for DG
// discretizations, we can call the