This tutorial depends on step-6, step-12.
In this program, we use the interior penalty method and Nitsche's weak boundary conditions to solve Poisson's equation. We use multigrid methods on locally refined meshes, which are generated using a bulk criterion and a standard error estimator based on cell and face residuals. All operators are implemented using the MeshWorker interface.
Like in step-12, the discretization relies on finite element spaces, which are polynomial inside the mesh cells \(K\in \mathbb T_h\), but have no continuity between cells. Since such functions have two values on each interior face \(F\in \mathbb F_h^i\), one from each side, we define mean value and jump operators as follows: let K1 and K2 be the two cells sharing a face, and let the traces of functions ui and the outer normal vectors ni be labeled accordingly. Then, on the face, we let
\[ \{\!\{ u \}\!\} = \frac{u_1 + u_2}2 \]
Note, that if such an expression contains a normal vector, the averaging operator turns into a jump. The interior penalty method for the problem
\[ -\Delta u = f \text{ in }\Omega \qquad u = u^D \text{ on } \partial\Omega \]
becomes
\begin{multline*} \sum_{K\in \mathbb T_h} (\nabla u, \nabla v)_K \\ + \sum_{F \in F_h^i} \biggl\{4\sigma_F (\{\!\{ u \mathbf n\}\!\}, \{\!\{ v \mathbf n \}\!\})_F - 2 (\{\!\{ \nabla u \}\!\},\{\!\{ v\mathbf n \}\!\})_F - 2 (\{\!\{ \nabla v \}\!\},\{\!\{ u\mathbf n \}\!\})_F \biggr\} \\ + \sum_{F \in F_h^b} \biggl\{2\sigma_F (u, v)_F - (\partial_n u,v)_F - (\partial_n v,u)_F \biggr\} \\ = (f, v)_\Omega + \sum_{F \in F_h^b} \biggl\{ 2\sigma_F (u^D, v)_F - (\partial_n v,u^D)_F \biggr\}. \end{multline*}
Here, \(\sigma_F\) is the penalty parameter, which is chosen as follows: for a face F of a cell K, compute the value
\[ \sigma_{F,K} = p(p+1) \frac{|F|_{d-1}}{|K|_d}, \]
where p is the polynomial degree of the finite element functions and \(|\cdot|_d\) and \(|\cdot|_{d-1}\) denote the \(d\) and \(d-1\) dimensional Hausdorff measure of the corresponding object. If the face is at the boundary, choose \(\sigma_F = \sigma_{F,K}\). For an interior face, we take the average of the two values at this face.
In our finite element program, we distinguish three different integrals, corresponding to the sums over cells, interior faces and boundary faces above. Since the MeshWorker::loop organizes the sums for us, we only need to implement the integrals over each mesh element. The class MatrixIntegrator below has these three functions for the left hand side of the formula, the class RHSIntegrator for the right.
As we will see below, even the error estimate is of the same structure, since it can be written as
\begin{align*} \eta^2 &= \eta_K^2 + \eta_F^2 + \eta_B^2 \\ \eta_K^2 &= \sum_{K\in \mathbb T_h} h^2 \|f + \Delta u_h\|^2 \\ \eta_F^2 &= \sum_{F \in F_h^i} \biggl\{ 4 \sigma_F \| \{\!\{u_h\mathbf n\}\!\} \|^2 + h \|\{\!\{\partial_n u_h\}\!\}\|^2 \biggr\} \\ \eta_B^2 &= \sum_{F \in F_h^b} 2\sigma_F \| u_h-u^D \|^2. \end{align*}
Thus, the functions for assembling matrices, right hand side and error estimates below exhibit that these loops are all generic and can be programmed in the same way.
This program is related to step-12, in that it uses MeshWorker and discontinuous Galerkin methods. While there, we solved an advection problem, here it is a diffusion problem. Here, we also use multigrid preconditioning and a theoretically justified error estimator, see Karakashian and Pascal (2003). The multilevel scheme was discussed in detail in Kanschat (2004). The adaptive iteration and its convergence have been discussed (for triangular meshes) in Hoppe, Kanschat, and Warburton (2009).
The commented program
The include files for the linear algebra: A regular SparseMatrix, which in turn will include the necessary files for SparsityPattern and Vector classes.
#include <deal.II/lac/sparse_matrix.h>
#include <deal.II/lac/dynamic_sparsity_pattern.h>
#include <deal.II/lac/solver_cg.h>
#include <deal.II/lac/precondition.h>
#include <deal.II/lac/precondition_block.h>
#include <deal.II/lac/block_vector.h>
Include files for setting up the mesh
#include <deal.II/grid/grid_generator.h>
#include <deal.II/grid/grid_refinement.h>
Include files for FiniteElement classes and DoFHandler.
#include <deal.II/fe/fe_q.h>
#include <deal.II/fe/fe_dgp.h>
#include <deal.II/fe/fe_dgq.h>
#include <deal.II/dofs/dof_tools.h>
The include files for using the MeshWorker framework
#include <deal.II/meshworker/dof_info.h>
#include <deal.II/meshworker/integration_info.h>
#include <deal.II/meshworker/assembler.h>
#include <deal.II/meshworker/loop.h>
The include file for local integrators associated with the Laplacian
#include <deal.II/integrators/laplace.h>
Support for multigrid methods
#include <deal.II/multigrid/mg_tools.h>
#include <deal.II/multigrid/multigrid.h>
#include <deal.II/multigrid/mg_matrix.h>
#include <deal.II/multigrid/mg_transfer.h>
#include <deal.II/multigrid/mg_coarse.h>
#include <deal.II/multigrid/mg_smoother.h>
Finally, we take our exact solution from the library as well as quadrature and additional tools.
#include <deal.II/base/function_lib.h>
#include <deal.II/base/quadrature_lib.h>
#include <deal.II/numerics/vector_tools.h>
#include <deal.II/numerics/data_out.h>
#include <iostream>
#include <fstream>
All classes of the deal.II library are in the namespace dealii. In order to save typing, we tell the compiler to search names in there as well.
This is the function we use to set the boundary values and also the exact solution we compare to.
The local integrators
MeshWorker separates local integration from the loops over cells and faces. Thus, we have to write local integration classes for generating matrices, the right hand side and the error estimator.
All these classes have the same three functions for integrating over cells, boundary faces and interior faces, respectively. All the information needed for the local integration is provided by MeshWorker::IntegrationInfo<dim>. Note that the signature of the functions cannot be changed, because it is expected by MeshWorker::integration_loop().
The first class defining local integrators is responsible for computing cell and face matrices. It is used to assemble the global matrix as well as the level matrices.
template <int dim>
{
public:
};
On each cell, we integrate the Dirichlet form. We use the library of ready made integrals in LocalIntegrators to avoid writing these loops ourselves. Similarly, we implement Nitsche boundary conditions and the interior penalty fluxes between cells.
The boundary and flux terms need a penalty parameter, which should be adjusted to the cell size and the polynomial degree. A safe choice of this parameter for constant coefficients can be found in LocalIntegrators::Laplace::compute_penalty() and we use this below.
template <int dim>
void MatrixIntegrator<dim>::cell(
{
}
template <int dim>
void MatrixIntegrator<dim>::boundary(
{
const unsigned int deg = info.
fe_values(0).get_fe().tensor_degree();
}
Interior faces use the interior penalty method
template <int dim>
void MatrixIntegrator<dim>::face(
{
const unsigned int deg = info1.
fe_values(0).get_fe().tensor_degree();
dinfo1.
matrix(0,
false).matrix, dinfo1.
matrix(0,
true).matrix,
dinfo2.
matrix(0,
true).matrix, dinfo2.
matrix(0,
false).matrix,
}
The second local integrator builds the right hand side. In our example, the right hand side function is zero, such that only the boundary condition is set here in weak form.
template <int dim>
{
public:
};
template <int dim>
{}
template <int dim>
{
const unsigned int deg = fe.
get_fe().tensor_degree();
const double penalty = 2. * deg * (deg+1) * dinfo.
face->measure() / dinfo.
cell->measure();
local_vector(i) += (- fe.
shape_value(i,k) * penalty * boundary_values[k]
}
template <int dim>
{}
The third local integrator is responsible for the contributions to the error estimate. This is the standard energy estimator due to Karakashian and Pascal (2003).
template <int dim>
{
public:
};
The cell contribution is the Laplacian of the discrete solution, since the right hand side is zero.
template <int dim>
{
const std::vector<Tensor<2,dim> > &DDuh = info.
hessians[0][0];
{
const double t = dinfo.
cell->diameter() *
trace(DDuh[k]);
}
}
At the boundary, we use simply a weighted form of the boundary residual, namely the norm of the difference between the finite element solution and the correct boundary condition.
template <int dim>
{
const std::vector<double> &uh = info.
values[0][0];
const unsigned int deg = fe.
get_fe().tensor_degree();
const double penalty = 2. * deg * (deg+1) * dinfo.
face->measure() / dinfo.
cell->measure();
dinfo.
value(0) += penalty * (boundary_values[k] - uh[k]) * (boundary_values[k] - uh[k])
}
Finally, on interior faces, the estimator consists of the jumps of the solution and its normal derivative, weighted appropriately.
template <int dim>
{
const std::vector<double> &uh1 = info1.
values[0][0];
const std::vector<double> &uh2 = info2.
values[0][0];
const std::vector<Tensor<1,dim> > &Duh1 = info1.
gradients[0][0];
const std::vector<Tensor<1,dim> > &Duh2 = info2.
gradients[0][0];
const unsigned int deg = fe.
get_fe().tensor_degree();
const double penalty1 = deg * (deg+1) * dinfo1.
face->measure() / dinfo1.
cell->measure();
const double penalty2 = deg * (deg+1) * dinfo2.
face->measure() / dinfo2.
cell->measure();
const double penalty = penalty1 + penalty2;
const double h = dinfo1.
face->measure();
{
double diff1 = uh1[k] - uh2[k];
dinfo1.
value(0) += (penalty * diff1*diff1 + h * diff2*diff2)
}
}
Finally we have an integrator for the error. Since the energy norm for discontinuous Galerkin problems not only involves the difference of the gradient inside the cells, but also the jump terms across faces and at the boundary, we cannot just use VectorTools::integrate_difference(). Instead, we use the MeshWorker interface to compute the error ourselves.
There are several different ways to define this energy norm, but all of them are equivalent to each other uniformly with mesh size (some not uniformly with polynomial degree). Here, we choose
\[ \|u\|_{1,h} = \sum_{K\in \mathbb T_h} \|\nabla u\|_K^2 + \sum_{F \in F_h^i} 4\sigma_F\|\{\!\{ u \mathbf n\}\!\}\|^2_F + \sum_{F \in F_h^b} 2\sigma_F\|u\|^2_F \]
template <int dim>
{
public:
};
Here we have the integration on cells. There is currently no good interface in MeshWorker that would allow us to access values of regular functions in the quadrature points. Thus, we have to create the vectors for the exact function's values and gradients inside the cell integrator. After that, everything is as before and we just add up the squares of the differences.
Additionally to computing the error in the energy norm, we use the capability of the mesh worker to compute two functionals at the same time and compute the L2-error in the same loop. Obviously, this one does not have any jump terms and only appears in the integration on cells.
template <int dim>
void ErrorIntegrator<dim>::cell(
{
const std::vector<Tensor<1,dim> > &Duh = info.
gradients[0][0];
const std::vector<double> &uh = info.
values[0][0];
{
for (
unsigned int d=0;
d<dim; ++
d)
{
const double diff = exact_gradients[k][
d] - Duh[k][
d];
}
const double diff = exact_values[k] - uh[k];
dinfo.
value(1) += diff*diff * fe.
JxW(k);
}
}
template <int dim>
void ErrorIntegrator<dim>::boundary(
{
const std::vector<double> &uh = info.
values[0][0];
const unsigned int deg = fe.
get_fe().tensor_degree();
const double penalty = 2. * deg * (deg+1) * dinfo.
face->measure() / dinfo.
cell->measure();
{
const double diff = exact_values[k] - uh[k];
dinfo.
value(0) += penalty * diff * diff * fe.
JxW(k);
}
}
template <int dim>
void ErrorIntegrator<dim>::face(
{
const std::vector<double> &uh1 = info1.
values[0][0];
const std::vector<double> &uh2 = info2.
values[0][0];
const unsigned int deg = fe.
get_fe().tensor_degree();
const double penalty1 = deg * (deg+1) * dinfo1.
face->measure() / dinfo1.
cell->measure();
const double penalty2 = deg * (deg+1) * dinfo2.
face->measure() / dinfo2.
cell->measure();
const double penalty = penalty1 + penalty2;
{
double diff = uh1[k] - uh2[k];
dinfo1.
value(0) += (penalty * diff*diff)
}
}
The main class
This class does the main job, like in previous examples. For a description of the functions declared here, please refer to the implementation below.
template <int dim>
class InteriorPenaltyProblem
{
public:
void run(
unsigned int n_steps);
private:
void setup_system ();
void assemble_matrix ();
void assemble_mg_matrix ();
void assemble_right_hand_side ();
void error ();
double estimate ();
void solve ();
void output_results (const unsigned int cycle) const;
The member objects related to the discretization are here.
Then, we have the matrices and vectors related to the global discrete system.
Finally, we have a group of sparsity patterns and sparse matrices related to the multilevel preconditioner. First, we have a level matrix and its sparsity pattern.
When we perform multigrid with local smoothing on locally refined meshes, additional matrices are required; see Kanschat (2004). Here is the sparsity pattern for these edge matrices. We only need one, because the pattern of the up matrix is the transpose of that of the down matrix. Actually, we do not care too much about these details, since the MeshWorker is filling these matrices.
The flux matrix at the refinement edge, coupling fine level degrees of freedom to coarse level.
The transpose of the flux matrix at the refinement edge, coupling coarse level degrees of freedom to fine level.
The constructor simply sets up the coarse grid and the DoFHandler. The FiniteElement is provided as a parameter to allow flexibility.
template <int dim>
:
triangulation (
Triangulation<dim>::limit_level_difference_at_vertices),
mapping(),
fe(fe),
dof_handler(triangulation),
estimates(1)
{
}
In this function, we set up the dimension of the linear system and the sparsity patterns for the global matrix as well as the level matrices.
template <int dim>
void
InteriorPenaltyProblem<dim>::setup_system()
{
First, we use the finite element to distribute degrees of freedom over the mesh and number them.
unsigned int n_dofs = dof_handler.
n_dofs();
Then, we already know the size of the vectors representing finite element functions.
right_hand_side.reinit(n_dofs);
Next, we set up the sparsity pattern for the global matrix. Since we do not know the row sizes in advance, we first fill a temporary DynamicSparsityPattern object and copy it to the regular SparsityPattern once it is complete.
sparsity.copy_from(dsp);
const unsigned int n_levels = triangulation.n_levels();
The global system is set up, now we attend to the level matrices. We resize all matrix objects to hold one matrix per level.
mg_matrix.resize(0, n_levels-1);
mg_matrix.clear_elements();
mg_matrix_dg_up.resize(0, n_levels-1);
mg_matrix_dg_up.clear_elements();
mg_matrix_dg_down.resize(0, n_levels-1);
mg_matrix_dg_down.clear_elements();
It is important to update the sparsity patterns after clear() was called for the level matrices, since the matrices lock the sparsity pattern through the SmartPointer and Subscriptor mechanism.
mg_sparsity.resize(0, n_levels-1);
mg_sparsity_dg_interface.resize(0, n_levels-1);
Now all objects are prepared to hold one sparsity pattern or matrix per level. What's left is setting up the sparsity patterns on each level.
for (unsigned int level=mg_sparsity.min_level();
level<=mg_sparsity.max_level(); ++level)
{
These are roughly the same lines as above for the global matrix, now for each level.
mg_sparsity[level].copy_from(dsp);
mg_matrix[level].reinit(mg_sparsity[level]);
Additionally, we need to initialize the transfer matrices at the refinement edge between levels. They are stored at the index referring to the finer of the two indices, thus there is no such object on level 0.
if (level>0)
{
mg_sparsity_dg_interface[level].copy_from(dsp);
mg_matrix_dg_up[level].reinit(mg_sparsity_dg_interface[level]);
mg_matrix_dg_down[level].reinit(mg_sparsity_dg_interface[level]);
}
}
}
In this function, we assemble the global system matrix, where by global we indicate that this is the matrix of the discrete system we solve and it is covering the whole mesh.
template <int dim>
void
InteriorPenaltyProblem<dim>::assemble_matrix()
{
First, we need t set up the object providing the values we integrate. This object contains all FEValues and FEFaceValues objects needed and also maintains them automatically such that they always point to the current cell. To this end, we need to tell it first, where and what to compute. Since we are not doing anything fancy, we can rely on their standard choice for quadrature rules.
Since their default update flags are minimal, we add what we need additionally, namely the values and gradients of shape functions on all objects (cells, boundary and interior faces). Afterwards, we are ready to initialize the container, which will create all necessary FEValuesBase objects for integration.
This is the object into which we integrate local data. It is filled by the local integration routines in MatrixIntegrator and then used by the assembler to distribute the information into the global matrix.
Furthermore, we need an object that assembles the local matrix into the global matrix. These assembler objects have all the knowledge of the structures of the target object, in this case a SparseMatrix, possible constraints and the mesh structure.
Now comes the part we coded ourselves, the local integrator. This is the only part which is problem dependent.
MatrixIntegrator<dim> integrator;
Now, we throw everything into a MeshWorker::loop(), which here traverses all active cells of the mesh, computes cell and face matrices and assembles them into the global matrix. We use the variable dof_handler here in order to use the global numbering of degrees of freedom.
MeshWorker::integration_loop<dim, dim>(
dof_info, info_box,
integrator, assembler);
}
Now, we do the same for the level matrices. Not too surprisingly, this function looks like a twin of the previous one. Indeed, there are only two minor differences.
template <int dim>
void
InteriorPenaltyProblem<dim>::assemble_mg_matrix()
{
Obviously, the assembler needs to be replaced by one filling level matrices. Note that it automatically fills the edge matrices as well.
MatrixIntegrator<dim> integrator;
Here is the other difference to the previous function: we run over all cells, not only the active ones. And we use functions ending on _mg since we need the degrees of freedom on each level, not the global numbering.
MeshWorker::integration_loop<dim, dim> (
dof_info, info_box,
integrator, assembler);
}
Here we have another clone of the assemble function. The difference to assembling the system matrix consists in that we assemble a vector here.
template <int dim>
void
InteriorPenaltyProblem<dim>::assemble_right_hand_side()
{
Since this assembler allows us to fill several vectors, the interface is a little more complicated as above. The pointers to the vectors have to be stored in a AnyData object. While this seems to cause two extra lines of code here, it actually comes handy in more complex applications.
RHSIntegrator<dim> integrator;
MeshWorker::integration_loop<dim, dim>(
dof_info, info_box,
integrator, assembler);
right_hand_side *= -1.;
}
Now that we have coded all functions building the discrete linear system, it is about time that we actually solve it.
template <int dim>
void
InteriorPenaltyProblem<dim>::solve()
{
The solver of choice is conjugate gradient.
Now we are setting up the components of the multilevel preconditioner. First, we need transfer between grid levels. The object we are using here generates sparse matrices for these transfers.
Then, we need an exact solver for the matrix on the coarsest level.
While transfer and coarse grid solver are pretty much generic, more flexibility is offered for the smoother. First, we choose Gauss-Seidel as our smoothing method.
mg_smoother;
RELAXATION::AdditionalData smoother_data(1.);
Do two smoothing steps on each level.
Since the SOR method is not symmetric, but we use conjugate gradient iteration below, here is a trick to make the multilevel preconditioner a symmetric operator even for nonsymmetric smoothers.
The smoother class optionally implements the variable V-cycle, which we do not want here.
Finally, we must wrap our matrices in an object having the required multiplication functions.
Now, we are ready to set up the V-cycle operator and the multilevel preconditioner.
mg_coarse, mg_transfer,
mg_smoother, mg_smoother);
Let us not forget the edge matrices needed because of the adaptive refinement.
mg.set_edge_flux_matrices(mgdown, mgup);
After all preparations, wrap the Multigrid object into another object, which can be used as a regular preconditioner,
preconditioner(dof_handler,
mg, mg_transfer);
and use it to solve the system.
solver.solve(matrix, solution, right_hand_side, preconditioner);
}
Another clone of the assemble function. The big difference to the previous ones is here that we also have an input vector.
template <int dim>
double
InteriorPenaltyProblem<dim>::estimate()
{
The results of the estimator are stored in a vector with one entry per cell. Since cells in deal.II are not numbered, we have to create our own numbering in order to use this vector.
On the other hand, somebody might have used the user indices already. So, let's be good citizens and save them before tampering with them.
std::vector<unsigned int> old_user_indices;
triangulation.save_user_indices(old_user_indices);
estimates.block(0).reinit(triangulation.n_active_cells());
unsigned int i=0;
cell != triangulation.end(); ++cell,++i)
cell->set_user_index(i);
This starts like before,
but now we need to notify the info box of the finite element function we want to evaluate in the quadrature points. First, we create an AnyData object with this vector, which is the solution we just computed.
Then, we tell the Meshworker::VectorSelector for cells, that we need the second derivatives of this solution (to compute the Laplacian). Therefore, the Boolean arguments selecting function values and first derivatives a false, only the last one selecting second derivatives is true.
On interior and boundary faces, we need the function values and the first derivatives, but not second derivatives.
And we continue as before, with the exception that the default update flags are already adjusted to the values and derivatives we requested above.
info_box.
initialize(fe, mapping, solution_data, solution);
The assembler stores one number per cell, but else this is the same as in the computation of the right hand side.
Estimator<dim> integrator;
MeshWorker::integration_loop<dim, dim> (
dof_info, info_box,
integrator, assembler);
Right before we return the result of the error estimate, we restore the old user indices.
triangulation.load_user_indices(old_user_indices);
return estimates.
block(0).l2_norm();
}
Here we compare our finite element solution with the (known) exact solution and compute the mean quadratic error of the gradient and the function itself. This function is a clone of the estimation function right above.
Since we compute the error in the energy and the L2-norm, respectively, our block vector needs two blocks here.
template <int dim>
void
InteriorPenaltyProblem<dim>::error()
{
errors.block(0).reinit(triangulation.n_active_cells());
errors.block(1).reinit(triangulation.n_active_cells());
unsigned int i=0;
cell != triangulation.end(); ++cell,++i)
cell->set_user_index(i);
info_box.
initialize(fe, mapping, solution_data, solution);
ErrorIntegrator<dim> integrator;
MeshWorker::integration_loop<dim, dim> (
dof_info, info_box,
integrator, assembler);
deallog <<
"energy-error: " << errors.
block(0).l2_norm() << std::endl;
deallog <<
"L2-error: " << errors.
block(1).l2_norm() << std::endl;
}
Create graphical output. We produce the filename by collating the name from its various components, including the refinement cycle that we output with two digits.
template <int dim>
void InteriorPenaltyProblem<dim>::output_results (const unsigned int cycle) const
{
const std::string filename = "sol-" +
".gnuplot";
deallog << "Writing solution to <" << filename << ">..."
<< std::endl << std::endl;
std::ofstream gnuplot_output (filename.c_str());
data_out.add_data_vector (solution, "u");
data_out.add_data_vector (estimates.
block(0),
"est");
data_out.build_patches ();
data_out.write_gnuplot(gnuplot_output);
}
And finally the adaptive loop, more or less like in previous examples.
template <int dim>
void
InteriorPenaltyProblem<dim>::run(unsigned int n_steps)
{
deallog << "Element: " << fe.get_name() << std::endl;
for (unsigned int s=0; s<n_steps; ++s)
{
deallog << "Step " << s << std::endl;
if (estimates.
block(0).size() == 0)
triangulation.refine_global(1);
else
{
0.5, 0.0);
triangulation.execute_coarsening_and_refinement ();
}
deallog << "Triangulation "
<< triangulation.n_active_cells() << " cells, "
<< triangulation.n_levels() << " levels" << std::endl;
setup_system();
deallog <<
"DoFHandler " << dof_handler.
n_dofs() <<
" dofs, level dofs";
for (
unsigned int l=0;
l<triangulation.n_levels(); ++
l)
deallog <<
' ' << dof_handler.
n_dofs(l);
deallog << std::endl;
deallog << "Assemble matrix" << std::endl;
assemble_matrix();
deallog << "Assemble multilevel matrix" << std::endl;
assemble_mg_matrix();
deallog << "Assemble right hand side" << std::endl;
assemble_right_hand_side();
deallog << "Solve" << std::endl;
solve();
error();
deallog << "Estimate " << estimate() << std::endl;
output_results(s);
}
}
}
int main()
{
try
{
using namespace Step39;
std::ofstream logfile("deallog");
InteriorPenaltyProblem<2> test1(fe1);
test1.run(12);
}
catch (std::exception &exc)
{
std::cerr << std::endl << std::endl
<< "----------------------------------------------------"
<< std::endl;
std::cerr << "Exception on processing: " << std::endl
<< exc.what() << std::endl
<< "Aborting!" << std::endl
<< "----------------------------------------------------"
<< std::endl;
return 1;
}
catch (...)
{
std::cerr << std::endl << std::endl
<< "----------------------------------------------------"
<< std::endl;
std::cerr << "Unknown exception!" << std::endl
<< "Aborting!" << std::endl
<< "----------------------------------------------------"
<< std::endl;
return 1;
}
return 0;
}
Results
Logfile output
First, the program produces the usual logfile here stored in deallog. It reads (with omission of intermediate steps)
DEAL::Step 0
DEAL::Triangulation 4 cells, 1 levels
DEAL::DoFHandler 64 dofs, level dofs 64
DEAL::Assemble matrix
DEAL::Assemble multilevel matrix
DEAL::Assemble right hand side
DEAL::Solve
DEAL:cg::Starting value 27.1275
DEAL:cg::Convergence step 1 value 1.97998e-14
DEAL::Error 0.161172
DEAL::Estimate 1.35839
DEAL::Writing solution to <sol-00.gnuplot>...
DEAL::
DEAL::Step 1
DEAL::Triangulation 10 cells, 2 levels
DEAL::DoFHandler 160 dofs, level dofs 64 128
DEAL::Assemble matrix
DEAL::Assemble multilevel matrix
DEAL::Assemble right hand side
DEAL::Solve
DEAL:cg::Starting value 35.5356
DEAL:cg::Convergence step 14 value 3.21479e-13
DEAL::Error 0.164760
DEAL::Estimate 1.08528
DEAL::Writing solution to <sol-01.gnuplot>...
DEAL::
DEAL::Step 2
DEAL::Triangulation 16 cells, 2 levels
DEAL::DoFHandler 256 dofs, level dofs 64 256
DEAL::Assemble matrix
DEAL::Assemble multilevel matrix
DEAL::Assemble right hand side
DEAL::Solve
DEAL:cg::Starting value 37.0552
DEAL:cg::Convergence step 14 value 6.05416e-13
DEAL::Error 0.113503
DEAL::Estimate 0.990460
DEAL::Writing solution to <sol-02.gnuplot>...
...
DEAL::Step 10
DEAL::Triangulation 124 cells, 9 levels
DEAL::DoFHandler 1984 dofs, level dofs 64 256 512 512 256 256 256 256 256
DEAL::Assemble matrix
DEAL::Assemble multilevel matrix
DEAL::Assemble right hand side
DEAL::Solve
DEAL:cg::Starting value 38.5798
DEAL:cg::Convergence step 17 value 2.64999e-13
DEAL::Error 0.0101278
DEAL::Estimate 0.0957571
DEAL::Writing solution to <sol-10.gnuplot>...
DEAL::
DEAL::Step 11
DEAL::Triangulation 163 cells, 10 levels
DEAL::DoFHandler 2608 dofs, level dofs 64 256 768 576 512 256 256 256 256 256
DEAL::Assemble matrix
DEAL::Assemble multilevel matrix
DEAL::Assemble right hand side
DEAL::Solve
DEAL:cg::Starting value 44.1721
DEAL:cg::Convergence step 17 value 3.18657e-13
DEAL::Error 0.00716962
DEAL::Estimate 0.0681646
DEAL::Writing solution to <sol-11.gnuplot>...
DEAL::
This log for instance shows that the number of conjugate gradient iteration steps is constant at approximately 17.
Postprocessing of the logfile
Using the perl script postprocess.pl, we extract relevant data into output.dat, which can be used to plot graphs with gnuplot. The graph above for instance was produced with
set style data linespoints
set logscale
set xrange [50:3000]
plot "output.dat" using 2:3 title "error", "" using 2:4 title "estimate", \
"" using 2:(3000*@f$2**-1.5) title "3rd order"
The plain program
#include <deal.II/lac/sparse_matrix.h>
#include <deal.II/lac/dynamic_sparsity_pattern.h>
#include <deal.II/lac/solver_cg.h>
#include <deal.II/lac/precondition.h>
#include <deal.II/lac/precondition_block.h>
#include <deal.II/lac/block_vector.h>
#include <deal.II/grid/grid_generator.h>
#include <deal.II/grid/grid_refinement.h>
#include <deal.II/fe/fe_q.h>
#include <deal.II/fe/fe_dgp.h>
#include <deal.II/fe/fe_dgq.h>
#include <deal.II/dofs/dof_tools.h>
#include <deal.II/meshworker/dof_info.h>
#include <deal.II/meshworker/integration_info.h>
#include <deal.II/meshworker/assembler.h>
#include <deal.II/meshworker/loop.h>
#include <deal.II/integrators/laplace.h>
#include <deal.II/multigrid/mg_tools.h>
#include <deal.II/multigrid/multigrid.h>
#include <deal.II/multigrid/mg_matrix.h>
#include <deal.II/multigrid/mg_transfer.h>
#include <deal.II/multigrid/mg_coarse.h>
#include <deal.II/multigrid/mg_smoother.h>
#include <deal.II/base/function_lib.h>
#include <deal.II/base/quadrature_lib.h>
#include <deal.II/numerics/vector_tools.h>
#include <deal.II/numerics/data_out.h>
#include <iostream>
#include <fstream>
namespace Step39
{
template <int dim>
{
public:
};
template <int dim>
void MatrixIntegrator<dim>::cell(
{
}
template <int dim>
void MatrixIntegrator<dim>::boundary(
{
const unsigned int deg = info.
fe_values(0).get_fe().tensor_degree();
}
template <int dim>
void MatrixIntegrator<dim>::face(
{
const unsigned int deg = info1.
fe_values(0).get_fe().tensor_degree();
dinfo1.
matrix(0,
false).matrix, dinfo1.
matrix(0,
true).matrix,
dinfo2.
matrix(0,
true).matrix, dinfo2.
matrix(0,
false).matrix,
}
template <int dim>
{
public:
};
template <int dim>
{}
template <int dim>
{
const unsigned int deg = fe.
get_fe().tensor_degree();
const double penalty = 2. * deg * (deg+1) * dinfo.
face->measure() / dinfo.
cell->measure();
local_vector(i) += (- fe.
shape_value(i,k) * penalty * boundary_values[k]
}
template <int dim>
{}
template <int dim>
{
public:
};
template <int dim>
{
const std::vector<Tensor<2,dim> > &DDuh = info.
hessians[0][0];
{
const double t = dinfo.
cell->diameter() *
trace(DDuh[k]);
}
}
template <int dim>
{
const std::vector<double> &uh = info.
values[0][0];
const unsigned int deg = fe.
get_fe().tensor_degree();
const double penalty = 2. * deg * (deg+1) * dinfo.
face->measure() / dinfo.
cell->measure();
dinfo.
value(0) += penalty * (boundary_values[k] - uh[k]) * (boundary_values[k] - uh[k])
}
template <int dim>
{
const std::vector<double> &uh1 = info1.
values[0][0];
const std::vector<double> &uh2 = info2.
values[0][0];
const std::vector<Tensor<1,dim> > &Duh1 = info1.
gradients[0][0];
const std::vector<Tensor<1,dim> > &Duh2 = info2.
gradients[0][0];
const unsigned int deg = fe.
get_fe().tensor_degree();
const double penalty1 = deg * (deg+1) * dinfo1.
face->measure() / dinfo1.
cell->measure();
const double penalty2 = deg * (deg+1) * dinfo2.
face->measure() / dinfo2.
cell->measure();
const double penalty = penalty1 + penalty2;
const double h = dinfo1.
face->measure();
{
double diff1 = uh1[k] - uh2[k];
dinfo1.
value(0) += (penalty * diff1*diff1 + h * diff2*diff2)
}
}
template <int dim>
{
public:
};
template <int dim>
void ErrorIntegrator<dim>::cell(
{
const std::vector<Tensor<1,dim> > &Duh = info.
gradients[0][0];
const std::vector<double> &uh = info.
values[0][0];
{
for (
unsigned int d=0;
d<dim; ++
d)
{
const double diff = exact_gradients[k][
d] - Duh[k][
d];
}
const double diff = exact_values[k] - uh[k];
dinfo.
value(1) += diff*diff * fe.
JxW(k);
}
}
template <int dim>
void ErrorIntegrator<dim>::boundary(
{
const std::vector<double> &uh = info.
values[0][0];
const unsigned int deg = fe.
get_fe().tensor_degree();
const double penalty = 2. * deg * (deg+1) * dinfo.
face->measure() / dinfo.
cell->measure();
{
const double diff = exact_values[k] - uh[k];
dinfo.
value(0) += penalty * diff * diff * fe.
JxW(k);
}
}
template <int dim>
void ErrorIntegrator<dim>::face(
{
const std::vector<double> &uh1 = info1.
values[0][0];
const std::vector<double> &uh2 = info2.
values[0][0];
const unsigned int deg = fe.
get_fe().tensor_degree();
const double penalty1 = deg * (deg+1) * dinfo1.
face->measure() / dinfo1.
cell->measure();
const double penalty2 = deg * (deg+1) * dinfo2.
face->measure() / dinfo2.
cell->measure();
const double penalty = penalty1 + penalty2;
{
double diff = uh1[k] - uh2[k];
dinfo1.
value(0) += (penalty * diff*diff)
}
}
template <int dim>
class InteriorPenaltyProblem
{
public:
void run(
unsigned int n_steps);
private:
void setup_system ();
void assemble_matrix ();
void assemble_mg_matrix ();
void assemble_right_hand_side ();
void error ();
double estimate ();
void solve ();
void output_results (const unsigned int cycle) const;
};
template <int dim>
:
triangulation (
Triangulation<dim>::limit_level_difference_at_vertices),
mapping(),
fe(fe),
dof_handler(triangulation),
estimates(1)
{
}
template <int dim>
void
InteriorPenaltyProblem<dim>::setup_system()
{
unsigned int n_dofs = dof_handler.
n_dofs();
right_hand_side.
reinit(n_dofs);
sparsity.copy_from(dsp);
const unsigned int n_levels = triangulation.n_levels();
mg_matrix.resize(0, n_levels-1);
mg_matrix.clear_elements();
mg_matrix_dg_up.resize(0, n_levels-1);
mg_matrix_dg_up.clear_elements();
mg_matrix_dg_down.resize(0, n_levels-1);
mg_matrix_dg_down.clear_elements();
mg_sparsity.resize(0, n_levels-1);
mg_sparsity_dg_interface.resize(0, n_levels-1);
for (unsigned int level=mg_sparsity.min_level();
level<=mg_sparsity.max_level(); ++level)
{
mg_sparsity[level].copy_from(dsp);
mg_matrix[level].reinit(mg_sparsity[level]);
if (level>0)
{
mg_sparsity_dg_interface[level].copy_from(dsp);
mg_matrix_dg_up[level].reinit(mg_sparsity_dg_interface[level]);
mg_matrix_dg_down[level].reinit(mg_sparsity_dg_interface[level]);
}
}
}
template <int dim>
void
InteriorPenaltyProblem<dim>::assemble_matrix()
{
MatrixIntegrator<dim> integrator;
MeshWorker::integration_loop<dim, dim>(
dof_info, info_box,
integrator, assembler);
}
template <int dim>
void
InteriorPenaltyProblem<dim>::assemble_mg_matrix()
{
MatrixIntegrator<dim> integrator;
MeshWorker::integration_loop<dim, dim> (
dof_info, info_box,
integrator, assembler);
}
template <int dim>
void
InteriorPenaltyProblem<dim>::assemble_right_hand_side()
{
RHSIntegrator<dim> integrator;
MeshWorker::integration_loop<dim, dim>(
dof_info, info_box,
integrator, assembler);
right_hand_side *= -1.;
}
template <int dim>
void
InteriorPenaltyProblem<dim>::solve()
{
mg_smoother;
RELAXATION::AdditionalData smoother_data(1.);
mg_coarse, mg_transfer,
mg_smoother, mg_smoother);
mg.set_edge_flux_matrices(mgdown, mgup);
preconditioner(dof_handler,
mg, mg_transfer);
solver.solve(matrix, solution, right_hand_side, preconditioner);
}
template <int dim>
double
InteriorPenaltyProblem<dim>::estimate()
{
std::vector<unsigned int> old_user_indices;
triangulation.save_user_indices(old_user_indices);
estimates.
block(0).reinit(triangulation.n_active_cells());
unsigned int i=0;
cell != triangulation.end(); ++cell,++i)
cell->set_user_index(i);
info_box.
initialize(fe, mapping, solution_data, solution);
Estimator<dim> integrator;
MeshWorker::integration_loop<dim, dim> (
dof_info, info_box,
integrator, assembler);
triangulation.load_user_indices(old_user_indices);
return estimates.
block(0).l2_norm();
}
template <int dim>
void
InteriorPenaltyProblem<dim>::error()
{
errors.
block(0).reinit(triangulation.n_active_cells());
errors.
block(1).reinit(triangulation.n_active_cells());
unsigned int i=0;
cell != triangulation.end(); ++cell,++i)
cell->set_user_index(i);
info_box.
initialize(fe, mapping, solution_data, solution);
ErrorIntegrator<dim> integrator;
MeshWorker::integration_loop<dim, dim> (
dof_info, info_box,
integrator, assembler);
deallog <<
"energy-error: " << errors.
block(0).l2_norm() << std::endl;
deallog <<
"L2-error: " << errors.
block(1).l2_norm() << std::endl;
}
template <int dim>
void InteriorPenaltyProblem<dim>::output_results (const unsigned int cycle) const
{
const std::string filename = "sol-" +
".gnuplot";
deallog << "Writing solution to <" << filename << ">..."
<< std::endl << std::endl;
std::ofstream gnuplot_output (filename.c_str());
data_out.add_data_vector (solution, "u");
data_out.add_data_vector (estimates.
block(0),
"est");
data_out.build_patches ();
data_out.write_gnuplot(gnuplot_output);
}
template <int dim>
void
InteriorPenaltyProblem<dim>::run(unsigned int n_steps)
{
deallog << "Element: " << fe.get_name() << std::endl;
for (unsigned int s=0; s<n_steps; ++s)
{
deallog << "Step " << s << std::endl;
if (estimates.
block(0).size() == 0)
triangulation.refine_global(1);
else
{
0.5, 0.0);
triangulation.execute_coarsening_and_refinement ();
}
deallog << "Triangulation "
<< triangulation.n_active_cells() << " cells, "
<< triangulation.n_levels() << " levels" << std::endl;
setup_system();
deallog <<
"DoFHandler " << dof_handler.
n_dofs() <<
" dofs, level dofs";
for (
unsigned int l=0;
l<triangulation.n_levels(); ++
l)
deallog <<
' ' << dof_handler.
n_dofs(l);
deallog << std::endl;
deallog << "Assemble matrix" << std::endl;
assemble_matrix();
deallog << "Assemble multilevel matrix" << std::endl;
assemble_mg_matrix();
deallog << "Assemble right hand side" << std::endl;
assemble_right_hand_side();
deallog << "Solve" << std::endl;
solve();
error();
deallog << "Estimate " << estimate() << std::endl;
output_results(s);
}
}
}
int main()
{
try
{
using namespace Step39;
std::ofstream logfile("deallog");
InteriorPenaltyProblem<2> test1(fe1);
test1.run(12);
}
catch (std::exception &exc)
{
std::cerr << std::endl << std::endl
<< "----------------------------------------------------"
<< std::endl;
std::cerr << "Exception on processing: " << std::endl
<< exc.what() << std::endl
<< "Aborting!" << std::endl
<< "----------------------------------------------------"
<< std::endl;
return 1;
}
catch (...)
{
std::cerr << std::endl << std::endl
<< "----------------------------------------------------"
<< std::endl;
std::cerr << "Unknown exception!" << std::endl
<< "Aborting!" << std::endl
<< "----------------------------------------------------"
<< std::endl;
return 1;
}
return 0;
}
1.8.14