1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
|
// ---------------------------------------------------------------------
//
// Copyright (C) 2006 - 2015 by the deal.II authors
//
// This file is part of the deal.II library.
//
// The deal.II library is free software; you can use it, redistribute
// it, and/or modify it under the terms of the GNU Lesser General
// Public License as published by the Free Software Foundation; either
// version 2.1 of the License, or (at your option) any later version.
// The full text of the license can be found in the file LICENSE at
// the top level of the deal.II distribution.
//
// ---------------------------------------------------------------------
// See documentation of BlockDynamicSparsityPattern for documentation of this example
#include <deal.II/lac/block_sparsity_pattern.h>
#include <deal.II/lac/constraint_matrix.h>
#include <deal.II/grid/tria.h>
#include <deal.II/grid/tria_accessor.h>
#include <deal.II/grid/tria_iterator.h>
#include <deal.II/grid/grid_generator.h>
#include <deal.II/fe/fe_q.h>
#include <deal.II/fe/fe_system.h>
#include <deal.II/dofs/dof_handler.h>
#include <deal.II/dofs/dof_renumbering.h>
#include <deal.II/dofs/dof_tools.h>
#include <iostream>
using namespace dealii;
int main()
{
Triangulation<2> tr;
GridGenerator::subdivided_hyper_cube(tr, 3);
tr.begin_active()->set_refine_flag();
tr.execute_coarsening_and_refinement();
FE_Q<2> fe1(1);
FE_Q<2> fe2(2);
FESystem<2> fe(fe1, 2, fe2, 1);
DoFHandler<2> dof(tr);
dof.distribute_dofs(fe);
DoFRenumbering::Cuthill_McKee(dof);
DoFRenumbering::component_wise(dof);
ConstraintMatrix constraints;
DoFTools::make_hanging_node_constraints(dof, constraints);
constraints.close();
std::vector<unsigned int> dofs_per_block(fe.n_blocks());
DoFTools::count_dofs_per_block(dof, dofs_per_block);
BlockDynamicSparsityPattern dsp(fe.n_blocks(), fe.n_blocks());
for (unsigned int i=0; i<fe.n_blocks(); ++i)
for (unsigned int j=0; j<fe.n_blocks(); ++j)
dsp.block(i,j).reinit(dofs_per_block[i],dofs_per_block[j]);
dsp.collect_sizes();
DoFTools::make_sparsity_pattern(dof, dsp);
constraints.condense(dsp);
BlockSparsityPattern sparsity;
sparsity.copy_from(dsp);
unsigned int ig = 0;
for (unsigned int ib=0; ib<fe.n_blocks(); ++ib)
for (unsigned int i=0; i<dofs_per_block[ib]; ++i,++ig)
{
unsigned int jg = 0;
for (unsigned int jb=0; jb<fe.n_blocks(); ++jb)
for (unsigned int j=0; j<dofs_per_block[jb]; ++j,++jg)
{
if (sparsity.exists(ig,jg))
std::cout << ig << ' ' << jg
<< '\t' << ib << jb << std::endl;
}
}
}
|
