/
multigrid.h
998 lines (857 loc) · 31.3 KB
/
multigrid.h
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
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
// ---------------------------------------------------------------------
//
// Copyright (C) 1999 - 2020 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.md at
// the top level directory of deal.II.
//
// ---------------------------------------------------------------------
#ifndef dealii_multigrid_h
#define dealii_multigrid_h
#include <deal.II/base/config.h>
#include <deal.II/base/mg_level_object.h>
#include <deal.II/base/smartpointer.h>
#include <deal.II/base/subscriptor.h>
#include <deal.II/distributed/tria.h>
#include <deal.II/dofs/dof_handler.h>
#include <deal.II/lac/sparse_matrix.h>
#include <deal.II/lac/vector.h>
#include <deal.II/multigrid/mg_base.h>
#include <vector>
DEAL_II_NAMESPACE_OPEN
#ifdef signals
# error \
"The name 'signals' is already defined. You are most likely using the QT library \
and using the 'signals' keyword. You can either #include the Qt headers (or any conflicting headers) \
*after* the deal.II headers or you can define the 'QT_NO_KEYWORDS' macro and use the 'Q_SIGNALS' macro."
#endif
/*!@addtogroup mg */
/*@{*/
namespace mg
{
/**
* A structure containing boost::signal objects for optional processing in
* multigrid solvers.
*
* Each of these signals is called twice, once before and once after
* the action is performed. The two function calls differ in the
* boolean argument @p before, which is true the first time and
* false the second.
*/
struct Signals
{
/**
* This signal is triggered before (@p before is true) and after (@p before
* is false) the call to MGTransfer::copy_to_mg which transfers the vector
* given to it to a multi-level vector.
*/
boost::signals2::signal<void(const bool before)> transfer_to_mg;
/**
* This signal is triggered before (@p before is true) and after (@p before
* is false) the call to MGTransfer::copy_from_mg which transfers the
* multi-level vector given to it to a normal vector.
*/
boost::signals2::signal<void(const bool before)> transfer_to_global;
/**
* This signal is triggered before (@p before is true) and after (@p before
* is
* false) the call to the coarse solver on @p level.
*
* The coarse solve will be done with ``defect[leve]`` and returned in
* ``solution[level]``, which can be inspected by the user using this
* signal.
*/
boost::signals2::signal<void(const bool before, const unsigned int level)>
coarse_solve;
/**
* This signal is triggered before (@p before is true) and after (@p before
* is false) the call to MGTransfer::restrict_and_add() which restricts a
* vector from @p level to the next coarser one (@p level - 1).
*
* The vector ``defect[level-1]`` will be updated between these two
* triggers and can be inspected by the user using this signal.
*/
boost::signals2::signal<void(const bool before, const unsigned int level)>
restriction;
/**
* This signal is triggered before (@p before is true) and after (@p before
* is false) the call to MGTransfer::prolongate() which prolongs a vector to
* @p level from the next coarser one (@p level - 1).
*/
boost::signals2::signal<void(const bool before, const unsigned int level)>
prolongation;
/**
* This signal is triggered before (@p before is true) and after (@p before
* is false) the call to a pre-smoothing step via MGPreSmoother::apply() on
* @p level.
*
* The smoother result will be stored in ``solution[level]`` and can be
* inspected by the user using this signal.
*/
boost::signals2::signal<void(const bool before, const unsigned int level)>
pre_smoother_step;
/**
* This signal is triggered before (@p before is true) and after (@p before
* is false) the call to a post-smoothing step via MGPostSmoother::apply()
* on @p level.
*/
boost::signals2::signal<void(const bool before, const unsigned int level)>
post_smoother_step;
/**
* This signal is triggered before (@p before is true) and after (@p before
* is false) the computation of the residual vector on @p level, including
* the result of edge_out and edge_down.
*/
boost::signals2::signal<void(const bool before, const unsigned int level)>
residual_step;
/**
* This signal is triggered before (@p before is true) and after (@p before
* is false) the execution of edge_in and edge_up.
*/
boost::signals2::signal<void(const bool before, const unsigned int level)>
edge_prolongation;
};
} // namespace mg
/**
* Implementation of the multigrid method. The implementation supports both
* continuous and discontinuous elements and follows the procedure described in
* the
* @ref mg_paper "multigrid paper by Janssen and Kanschat".
*
* The function which starts a multigrid cycle on the finest level is cycle().
* Depending on the cycle type chosen with the constructor (see enum Cycle),
* this function triggers one of the cycles level_v_step() or level_step(),
* where the latter one can do different types of cycles.
*
* Using this class, it is expected that the right hand side has been
* converted from a vector living on the locally finest level to a multilevel
* vector. This is a nontrivial operation, usually initiated automatically by
* the class PreconditionMG and performed by the classes derived from
* MGTransferBase.
*
* @note The interface of this class is still very clumsy. In particular, you
* will have to set up quite a few auxiliary objects before you can use it.
* Unfortunately, it seems that this can be avoided only be restricting the
* flexibility of this class in an unacceptable way.
*/
template <typename VectorType>
class Multigrid : public Subscriptor
{
public:
/**
* List of implemented cycle types.
*/
enum Cycle
{
/// The V-cycle
v_cycle,
/// The W-cycle
w_cycle,
/// The F-cycle
f_cycle
};
using vector_type = VectorType;
using const_vector_type = const VectorType;
/**
* Constructor. <tt>transfer</tt> is an object performing prolongation and
* restriction. For levels in [minlevel, maxlevel] matrix has to contain
* valid matrices. By default the maxlevel is set to the maximal valid level.
*
* This function already initializes the vectors which will be used later in
* the course of the computations. You should therefore create objects of
* this type as late as possible.
*/
Multigrid(const MGMatrixBase<VectorType> & matrix,
const MGCoarseGridBase<VectorType> &coarse,
const MGTransferBase<VectorType> & transfer,
const MGSmootherBase<VectorType> & pre_smooth,
const MGSmootherBase<VectorType> & post_smooth,
const unsigned int minlevel = 0,
const unsigned int maxlevel = numbers::invalid_unsigned_int,
Cycle cycle = v_cycle);
/**
* Reinit this class according to #minlevel and #maxlevel.
*/
void
reinit(const unsigned int minlevel, const unsigned int maxlevel);
/**
* Execute one multigrid cycle. The type of cycle is selected by the
* constructor argument cycle. See the enum Cycle for available types.
*/
void
cycle();
/**
* Execute one step of the V-cycle algorithm. This function assumes, that
* the multilevel vector #defect is filled with the residual of an outer
* defect correction scheme. This is usually taken care of by
* PreconditionMG). After vcycle(), the result is in the multilevel vector
* #solution. See <tt>copy_*_mg</tt> in the MGTools namespace if you want to
* use these vectors yourself.
*
* The actual work for this function is done in level_v_step().
*/
void
vcycle();
/**
* Set additional matrices to correct residual computation at refinement
* edges. Since we only smoothen in the interior of the refined part of the
* mesh, the coupling across the refinement edge is missing. This coupling
* is provided by these two matrices.
*
* @note While <tt>edge_out.vmult</tt> is used, for the second argument, we
* use <tt>edge_in.Tvmult</tt>. Thus, <tt>edge_in</tt> should be assembled
* in transposed form. This saves a second sparsity pattern for
* <tt>edge_in</tt>. In particular, for symmetric operators, both arguments
* can refer to the same matrix, saving assembling of one of them.
*/
void
set_edge_matrices(const MGMatrixBase<VectorType> &edge_out,
const MGMatrixBase<VectorType> &edge_in);
/**
* Set additional matrices to correct residual computation at refinement
* edges. These matrices originate from discontinuous Galerkin methods (see
* FE_DGQ etc.), where they correspond to the edge fluxes at the refinement
* edge between two levels.
*
* @note While <tt>edge_down.vmult</tt> is used, for the second argument, we
* use <tt>edge_up.Tvmult</tt>. Thus, <tt>edge_up</tt> should be assembled
* in transposed form. This saves a second sparsity pattern for
* <tt>edge_up</tt>. In particular, for symmetric operators, both arguments
* can refer to the same matrix, saving assembling of one of them.
*/
void
set_edge_flux_matrices(const MGMatrixBase<VectorType> &edge_down,
const MGMatrixBase<VectorType> &edge_up);
/**
* Return the finest level for multigrid.
*/
unsigned int
get_maxlevel() const;
/**
* Return the coarsest level for multigrid.
*/
unsigned int
get_minlevel() const;
/**
* Set the highest level for which the multilevel method is performed. By
* default, this is the finest level of the Triangulation. Accepted are
* values not smaller than the current #minlevel.
*/
void
set_maxlevel(const unsigned int);
/**
* Set the coarsest level for which the multilevel method is performed. By
* default, this is zero. Accepted are non-negative values not larger than
* the current #maxlevel.
*
* If <tt>relative</tt> is <tt>true</tt>, then this function determines the
* number of levels used, that is, it sets #minlevel to
* #maxlevel-<tt>level</tt>.
*
* @note The mesh on the coarsest level must cover the whole domain. There
* may not be hanging nodes on #minlevel.
*
* @note If #minlevel is set to a nonzero value, do not forget to adjust
* your coarse grid solver!
*/
void
set_minlevel(const unsigned int level, bool relative = false);
/**
* Chance #cycle_type used in cycle().
*/
void set_cycle(Cycle);
/**
* Connect a function to mg::Signals::pre_smoother_step.
*/
boost::signals2::connection
connect_pre_smoother_step(
const std::function<void(const bool, const unsigned int)> &slot);
/**
* Connect a function to mg::Signals::residual_step.
*/
boost::signals2::connection
connect_residual_step(
const std::function<void(const bool, const unsigned int)> &slot);
/**
* Connect a function to mg::Signals::restriction.
*/
boost::signals2::connection
connect_restriction(
const std::function<void(const bool, const unsigned int)> &slot);
/**
* Connect a function to mg::Signals::coarse_solve.
*/
boost::signals2::connection
connect_coarse_solve(
const std::function<void(const bool, const unsigned int)> &slot);
/**
* Connect a function to mg::Signals::prolongation.
*/
boost::signals2::connection
connect_prolongation(
const std::function<void(const bool, const unsigned int)> &slot);
/**
* Connect a function to mg::Signals::edge_prolongation.
*/
boost::signals2::connection
connect_edge_prolongation(
const std::function<void(const bool, const unsigned int)> &slot);
/**
* Connect a function to mg::Signals::post_smoother_step.
*/
boost::signals2::connection
connect_post_smoother_step(
const std::function<void(const bool, const unsigned int)> &slot);
private:
/**
* Signals for the various actions that the Multigrid algorithm uses.
*/
mg::Signals signals;
/**
* The V-cycle multigrid method. <tt>level</tt> is the level the function
* starts on. It will usually be called for the highest level from outside,
* but will then call itself recursively for <tt>level-1</tt>, unless we are
* on #minlevel where the coarse grid solver solves the problem exactly.
*/
void
level_v_step(const unsigned int level);
/**
* The actual W-cycle or F-cycle multigrid method. <tt>level</tt> is the
* level the function starts on. It will usually be called for the highest
* level from outside, but will then call itself recursively for
* <tt>level-1</tt>, unless we are on #minlevel where the coarse grid solver
* solves the problem exactly.
*/
void
level_step(const unsigned int level, Cycle cycle);
/**
* Cycle type performed by the method cycle().
*/
Cycle cycle_type;
/**
* Level for coarse grid solution.
*/
unsigned int minlevel;
/**
* Highest level of cells.
*/
unsigned int maxlevel;
public:
/**
* Input vector for the cycle. Contains the defect of the outer method
* projected to the multilevel vectors.
*/
MGLevelObject<VectorType> defect;
/**
* The solution update after the multigrid step.
*/
MGLevelObject<VectorType> solution;
private:
/**
* Auxiliary vector.
*/
MGLevelObject<VectorType> t;
/**
* Auxiliary vector for W- and F-cycles. Left uninitialized in V-cycle.
*/
MGLevelObject<VectorType> defect2;
/**
* The matrix for each level.
*/
SmartPointer<const MGMatrixBase<VectorType>, Multigrid<VectorType>> matrix;
/**
* The matrix for each level.
*/
SmartPointer<const MGCoarseGridBase<VectorType>, Multigrid<VectorType>>
coarse;
/**
* Object for grid transfer.
*/
SmartPointer<const MGTransferBase<VectorType>, Multigrid<VectorType>>
transfer;
/**
* The pre-smoothing object.
*/
SmartPointer<const MGSmootherBase<VectorType>, Multigrid<VectorType>>
pre_smooth;
/**
* The post-smoothing object.
*/
SmartPointer<const MGSmootherBase<VectorType>, Multigrid<VectorType>>
post_smooth;
/**
* Edge matrix from the interior of the refined part to the refinement edge.
*
* @note Only <tt>vmult</tt> is used for these matrices.
*/
SmartPointer<const MGMatrixBase<VectorType>> edge_out;
/**
* Transpose edge matrix from the refinement edge to the interior of the
* refined part.
*
* @note Only <tt>Tvmult</tt> is used for these matrices.
*/
SmartPointer<const MGMatrixBase<VectorType>> edge_in;
/**
* Edge matrix from fine to coarse.
*
* @note Only <tt>vmult</tt> is used for these matrices.
*/
SmartPointer<const MGMatrixBase<VectorType>, Multigrid<VectorType>> edge_down;
/**
* Transpose edge matrix from coarse to fine.
*
* @note Only <tt>Tvmult</tt> is used for these matrices.
*/
SmartPointer<const MGMatrixBase<VectorType>, Multigrid<VectorType>> edge_up;
template <int dim, class OtherVectorType, class TRANSFER>
friend class PreconditionMG;
};
/**
* Multi-level preconditioner. Here, we collect all information needed for
* multi-level preconditioning and provide the standard interface for LAC
* iterative methods.
*
* Furthermore, it needs functions <tt>void copy_to_mg(const VectorType&)</tt>
* to store @p src in the right hand side of the multi-level method and
* <tt>void copy_from_mg(VectorType&)</tt> to store the result of the v-cycle
* in @p dst.
*
* If VectorType is in fact a block vector and the TRANSFER object supports
* use of a separate DoFHandler for each block, this class also allows
* to be initialized with a separate DoFHandler for each block.
*/
template <int dim, typename VectorType, class TRANSFER>
class PreconditionMG : public Subscriptor
{
public:
/**
* Constructor. Arguments are the multigrid object, pre-smoother, post-
* smoother and coarse grid solver.
*/
PreconditionMG(const DoFHandler<dim> &dof_handler,
Multigrid<VectorType> &mg,
const TRANSFER & transfer);
/**
* Same as above in case every component of a block vector
* uses its own DoFHandler.
*/
PreconditionMG(const std::vector<const DoFHandler<dim> *> &dof_handler,
Multigrid<VectorType> & mg,
const TRANSFER & transfer);
/**
* Dummy function needed by other classes.
*/
bool
empty() const;
/**
* Preconditioning operator. Calls the @p vcycle function of the @p MG
* object passed to the constructor.
*
* This is the operator used by LAC iterative solvers.
*/
template <class OtherVectorType>
void
vmult(OtherVectorType &dst, const OtherVectorType &src) const;
/**
* Preconditioning operator. Calls the @p vcycle function of the @p MG
* object passed to the constructor.
*/
template <class OtherVectorType>
void
vmult_add(OtherVectorType &dst, const OtherVectorType &src) const;
/**
* Transposed preconditioning operator.
*
* Not implemented, but the definition may be needed.
*/
template <class OtherVectorType>
void
Tvmult(OtherVectorType &dst, const OtherVectorType &src) const;
/**
* Transposed preconditioning operator.
*
* Not implemented, but the definition may be needed.
*/
template <class OtherVectorType>
void
Tvmult_add(OtherVectorType &dst, const OtherVectorType &src) const;
/**
* Return the partitioning of the range space of this preconditioner, i.e.,
* the partitioning of the vectors that are result from matrix-vector
* products. By default, the respective information for the first DoFHandler
* object are returned.
*/
IndexSet
locally_owned_range_indices(const unsigned int block = 0) const;
/**
* Return the partitioning of the domain space of this preconditioner, i.e.,
* the partitioning of the vectors this matrix has to be multiplied with.
* By default, the respective information for the first DoFHandler object
* are returned.
*/
IndexSet
locally_owned_domain_indices(const unsigned int block = 0) const;
/**
* Return the MPI communicator object in use with this preconditioner.
*/
MPI_Comm
get_mpi_communicator() const;
/**
* Connect a function to mg::Signals::transfer_to_mg.
*/
boost::signals2::connection
connect_transfer_to_mg(const std::function<void(bool)> &slot);
/**
* Connect a function to mg::Signals::transfer_to_global.
*/
boost::signals2::connection
connect_transfer_to_global(const std::function<void(bool)> &slot);
/**
* Return the Multigrid object passed to the constructor.
*/
Multigrid<VectorType> &
get_multigrid();
/**
* Return the Multigrid object passed to the constructor.
*/
const Multigrid<VectorType> &
get_multigrid() const;
private:
/**
* Associated @p DoFHandler.
*/
std::vector<SmartPointer<const DoFHandler<dim>,
PreconditionMG<dim, VectorType, TRANSFER>>>
dof_handler_vector;
/**
* Storage for the pointers to the DoFHandler objects
* without SmartPointer wrapper.
*/
std::vector<const DoFHandler<dim> *> dof_handler_vector_raw;
/**
* The multigrid object.
*/
SmartPointer<Multigrid<VectorType>, PreconditionMG<dim, VectorType, TRANSFER>>
multigrid;
/**
* Object for grid transfer.
*/
SmartPointer<const TRANSFER, PreconditionMG<dim, VectorType, TRANSFER>>
transfer;
/**
* Flag to indicate if the object is initialized with a single DoFHandler
* or with one for each block.
*/
const bool uses_dof_handler_vector;
/**
* Signals used by this object
*/
mg::Signals signals;
};
/*@}*/
#ifndef DOXYGEN
/* --------------------------- inline functions --------------------- */
template <typename VectorType>
Multigrid<VectorType>::Multigrid(const MGMatrixBase<VectorType> & matrix,
const MGCoarseGridBase<VectorType> &coarse,
const MGTransferBase<VectorType> & transfer,
const MGSmootherBase<VectorType> & pre_smooth,
const MGSmootherBase<VectorType> &post_smooth,
const unsigned int min_level,
const unsigned int max_level,
Cycle cycle)
: cycle_type(cycle)
, matrix(&matrix, typeid(*this).name())
, coarse(&coarse, typeid(*this).name())
, transfer(&transfer, typeid(*this).name())
, pre_smooth(&pre_smooth, typeid(*this).name())
, post_smooth(&post_smooth, typeid(*this).name())
, edge_out(nullptr, typeid(*this).name())
, edge_in(nullptr, typeid(*this).name())
, edge_down(nullptr, typeid(*this).name())
, edge_up(nullptr, typeid(*this).name())
{
if (max_level == numbers::invalid_unsigned_int)
maxlevel = matrix.get_maxlevel();
else
maxlevel = max_level;
reinit(min_level, maxlevel);
}
template <typename VectorType>
inline unsigned int
Multigrid<VectorType>::get_maxlevel() const
{
return maxlevel;
}
template <typename VectorType>
inline unsigned int
Multigrid<VectorType>::get_minlevel() const
{
return minlevel;
}
/* --------------------------- inline functions --------------------- */
namespace internal
{
namespace PreconditionMGImplementation
{
template <int dim,
typename VectorType,
class TRANSFER,
typename OtherVectorType>
typename std::enable_if<TRANSFER::supports_dof_handler_vector>::type
vmult(
const std::vector<const dealii::DoFHandler<dim> *> &dof_handler_vector,
dealii::Multigrid<VectorType> & multigrid,
const TRANSFER & transfer,
OtherVectorType & dst,
const OtherVectorType & src,
const bool uses_dof_handler_vector,
const typename dealii::mg::Signals &signals,
int)
{
signals.transfer_to_mg(true);
if (uses_dof_handler_vector)
transfer.copy_to_mg(dof_handler_vector, multigrid.defect, src);
else
transfer.copy_to_mg(*dof_handler_vector[0], multigrid.defect, src);
signals.transfer_to_mg(false);
multigrid.cycle();
signals.transfer_to_global(true);
if (uses_dof_handler_vector)
transfer.copy_from_mg(dof_handler_vector, dst, multigrid.solution);
else
transfer.copy_from_mg(*dof_handler_vector[0], dst, multigrid.solution);
signals.transfer_to_global(false);
}
template <int dim,
typename VectorType,
class TRANSFER,
typename OtherVectorType>
void
vmult(
const std::vector<const dealii::DoFHandler<dim> *> &dof_handler_vector,
dealii::Multigrid<VectorType> & multigrid,
const TRANSFER & transfer,
OtherVectorType & dst,
const OtherVectorType & src,
const bool uses_dof_handler_vector,
const typename dealii::mg::Signals &signals,
...)
{
(void)uses_dof_handler_vector;
Assert(!uses_dof_handler_vector, ExcInternalError());
signals.transfer_to_mg(true);
transfer.copy_to_mg(*dof_handler_vector[0], multigrid.defect, src);
signals.transfer_to_mg(false);
multigrid.cycle();
signals.transfer_to_global(true);
transfer.copy_from_mg(*dof_handler_vector[0], dst, multigrid.solution);
signals.transfer_to_global(false);
}
template <int dim,
typename VectorType,
class TRANSFER,
typename OtherVectorType>
typename std::enable_if<TRANSFER::supports_dof_handler_vector>::type
vmult_add(
const std::vector<const dealii::DoFHandler<dim> *> &dof_handler_vector,
dealii::Multigrid<VectorType> & multigrid,
const TRANSFER & transfer,
OtherVectorType & dst,
const OtherVectorType & src,
const bool uses_dof_handler_vector,
const typename dealii::mg::Signals &signals,
int)
{
signals.transfer_to_mg(true);
if (uses_dof_handler_vector)
transfer.copy_to_mg(dof_handler_vector, multigrid.defect, src);
else
transfer.copy_to_mg(*dof_handler_vector[0], multigrid.defect, src);
signals.transfer_to_mg(false);
multigrid.cycle();
signals.transfer_to_global(true);
if (uses_dof_handler_vector)
transfer.copy_from_mg_add(dof_handler_vector, dst, multigrid.solution);
else
transfer.copy_from_mg_add(*dof_handler_vector[0],
dst,
multigrid.solution);
signals.transfer_to_global(false);
}
template <int dim,
typename VectorType,
class TRANSFER,
typename OtherVectorType>
void
vmult_add(
const std::vector<const dealii::DoFHandler<dim> *> &dof_handler_vector,
dealii::Multigrid<VectorType> & multigrid,
const TRANSFER & transfer,
OtherVectorType & dst,
const OtherVectorType & src,
const bool uses_dof_handler_vector,
const typename dealii::mg::Signals &signals,
...)
{
(void)uses_dof_handler_vector;
Assert(!uses_dof_handler_vector, ExcInternalError());
signals.transfer_to_mg(true);
transfer.copy_to_mg(*dof_handler_vector[0], multigrid.defect, src);
signals.transfer_to_mg(false);
multigrid.cycle();
signals.transfer_to_global(true);
transfer.copy_from_mg_add(*dof_handler_vector[0],
dst,
multigrid.solution);
signals.transfer_to_global(false);
}
} // namespace PreconditionMGImplementation
} // namespace internal
template <int dim, typename VectorType, class TRANSFER>
PreconditionMG<dim, VectorType, TRANSFER>::PreconditionMG(
const DoFHandler<dim> &dof_handler,
Multigrid<VectorType> &mg,
const TRANSFER & transfer)
: dof_handler_vector(1, &dof_handler)
, dof_handler_vector_raw(1, &dof_handler)
, multigrid(&mg)
, transfer(&transfer)
, uses_dof_handler_vector(false)
{}
template <int dim, typename VectorType, class TRANSFER>
PreconditionMG<dim, VectorType, TRANSFER>::PreconditionMG(
const std::vector<const DoFHandler<dim> *> &dof_handler,
Multigrid<VectorType> & mg,
const TRANSFER & transfer)
: dof_handler_vector(dof_handler.size())
, dof_handler_vector_raw(dof_handler.size())
, multigrid(&mg)
, transfer(&transfer)
, uses_dof_handler_vector(true)
{
for (unsigned int i = 0; i < dof_handler.size(); ++i)
{
dof_handler_vector[i] = dof_handler[i];
dof_handler_vector_raw[i] = dof_handler[i];
}
}
template <int dim, typename VectorType, class TRANSFER>
inline bool
PreconditionMG<dim, VectorType, TRANSFER>::empty() const
{
return false;
}
template <int dim, typename VectorType, class TRANSFER>
template <class OtherVectorType>
void
PreconditionMG<dim, VectorType, TRANSFER>::vmult(
OtherVectorType & dst,
const OtherVectorType &src) const
{
internal::PreconditionMGImplementation::vmult(dof_handler_vector_raw,
*multigrid,
*transfer,
dst,
src,
uses_dof_handler_vector,
this->signals,
0);
}
template <int dim, typename VectorType, class TRANSFER>
IndexSet
PreconditionMG<dim, VectorType, TRANSFER>::locally_owned_range_indices(
const unsigned int block) const
{
AssertIndexRange(block, dof_handler_vector.size());
return dof_handler_vector[block]->locally_owned_dofs();
}
template <int dim, typename VectorType, class TRANSFER>
IndexSet
PreconditionMG<dim, VectorType, TRANSFER>::locally_owned_domain_indices(
const unsigned int block) const
{
AssertIndexRange(block, dof_handler_vector.size());
return dof_handler_vector[block]->locally_owned_dofs();
}
template <int dim, typename VectorType, class TRANSFER>
MPI_Comm
PreconditionMG<dim, VectorType, TRANSFER>::get_mpi_communicator() const
{
// currently parallel GMG works with parallel triangulations only,
// so it should be a safe bet to use it to query MPI communicator:
const Triangulation<dim> &tria = dof_handler_vector[0]->get_triangulation();
const parallel::TriangulationBase<dim> *ptria =
dynamic_cast<const parallel::TriangulationBase<dim> *>(&tria);
Assert(ptria != nullptr, ExcInternalError());
return ptria->get_communicator();
}
template <int dim, typename VectorType, class TRANSFER>
boost::signals2::connection
PreconditionMG<dim, VectorType, TRANSFER>::connect_transfer_to_mg(
const std::function<void(bool)> &slot)
{
return this->signals.transfer_to_mg.connect(slot);
}
template <int dim, typename VectorType, class TRANSFER>
boost::signals2::connection
PreconditionMG<dim, VectorType, TRANSFER>::connect_transfer_to_global(
const std::function<void(bool)> &slot)
{
return this->signals.transfer_to_global.connect(slot);
}
template <int dim, typename VectorType, class TRANSFER>
template <class OtherVectorType>
void
PreconditionMG<dim, VectorType, TRANSFER>::vmult_add(
OtherVectorType & dst,
const OtherVectorType &src) const
{
internal::PreconditionMGImplementation::vmult_add(dof_handler_vector_raw,
*multigrid,
*transfer,
dst,
src,
uses_dof_handler_vector,
this->signals,
0);
}
template <int dim, typename VectorType, class TRANSFER>
template <class OtherVectorType>
void
PreconditionMG<dim, VectorType, TRANSFER>::Tvmult(OtherVectorType &,
const OtherVectorType &) const
{
Assert(false, ExcNotImplemented());
}
template <int dim, typename VectorType, class TRANSFER>
template <class OtherVectorType>
void
PreconditionMG<dim, VectorType, TRANSFER>::Tvmult_add(
OtherVectorType &,
const OtherVectorType &) const
{
Assert(false, ExcNotImplemented());
}
template <int dim, typename VectorType, class TRANSFER>
Multigrid<VectorType> &
PreconditionMG<dim, VectorType, TRANSFER>::get_multigrid()
{
return *this->multigrid;
}
template <int dim, typename VectorType, class TRANSFER>
const Multigrid<VectorType> &
PreconditionMG<dim, VectorType, TRANSFER>::get_multigrid() const
{
return *this->multigrid;
}
#endif // DOXYGEN
DEAL_II_NAMESPACE_CLOSE
#endif