/usr/include/deal.II/multigrid/mg_smoother.h is in libdeal.ii-dev 6.3.1-1.1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 | //---------------------------------------------------------------------------
// $Id: mg_smoother.h 21223 2010-06-17 23:45:51Z kanschat $
// Version: $Name$
//
// Copyright (C) 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2009, 2010 by the deal.II authors
//
// This file is subject to QPL and may not be distributed
// without copyright and license information. Please refer
// to the file deal.II/doc/license.html for the text and
// further information on this license.
//
//---------------------------------------------------------------------------
#ifndef __deal2__mg_smoother_h
#define __deal2__mg_smoother_h
#include <base/config.h>
#include <base/smartpointer.h>
#include <lac/pointer_matrix.h>
#include <lac/vector_memory.h>
#include <multigrid/mg_base.h>
#include <base/mg_level_object.h>
#include <vector>
DEAL_II_NAMESPACE_OPEN
template <int dim, int spacedim> class MGDoFHandler;
/*
* MGSmootherBase is defined in mg_base.h
*/
/*!@addtogroup mg */
/*@{*/
/**
* A base class for smoother handling information on smoothing.
* While not adding to the abstract interface in MGSmootherBase, this
* class stores information on the number and type of smoothing steps,
* which in turn can be used by a derived class.
*
* @author Guido Kanschat 2009
*/
template <class VECTOR>
class MGSmoother : public MGSmootherBase<VECTOR>
{
public:
/**
* Constructor. Sets smoothing
* parameters and creates a
* private GrowingVectorMemory
* object to be used to retrieve vectors.
*/
MGSmoother(const unsigned int steps = 1,
const bool variable = false,
const bool symmetric = false,
const bool transpose = false);
/**
* @deprecated Since
* GrowingVectorMemory now uses a
* joint memory pool, it is
* recommended to use the
* constructor without the memory
* object.
*
* Constructor. Sets memory and
* smoothing parameters.
*/
MGSmoother(VectorMemory<VECTOR>& mem,
const unsigned int steps = 1,
const bool variable = false,
const bool symmetric = false,
const bool transpose = false);
/**
* Modify the number of smoothing
* steps on finest level.
*/
void set_steps (const unsigned int);
/**
* Switch on/off variable
* smoothing.
*/
void set_variable (const bool);
/**
* Switch on/off symmetric
* smoothing.
*/
void set_symmetric (const bool);
/**
* Switch on/off transposed
* smoothing. The effect is
* overriden by set_symmetric().
*/
void set_transpose (const bool);
/**
* Set #debug to a nonzero value
* to get debug information
* logged to #deallog. Increase
* to get more information
*/
void set_debug (const unsigned int level);
private:
/**
* The memory object to be used
* if none is given to the
* constructor.
*/
GrowingVectorMemory<VECTOR> my_memory;
protected:
/**
* Number of smoothing steps on
* the finest level. If no
* #variable smoothing is chosen,
* this is the number of steps on
* all levels.
*/
unsigned int steps;
/**
* Variable smoothing: double the
* number of smoothing steps
* whenever going to the next
* coarser level
*/
bool variable;
/**
* Symmetric smoothing: in the
* smoothing iteration, alternate
* between the relaxation method
* and its transpose.
*/
bool symmetric;
/*
* Use the transpose of the
* relaxation method instead of
* the method itself. This has no
* effect if #symmetric smoothing
* is chosen.
*/
bool transpose;
/**
* Output debugging information
* to #deallog if this is
* nonzero.
*/
unsigned int debug;
/**
* Memory for auxiliary vectors.
*/
SmartPointer<VectorMemory<VECTOR>, MGSmoother<VECTOR> > mem;
};
/**
* Smoother doing nothing. This class is not useful for many applications other
* than for testing some multigrid procedures. Also some applications might
* get convergence without smoothing and then this class brings you the
* cheapest possible multigrid.
*
* @author Guido Kanschat, 1999, 2002
*/
template <class VECTOR>
class MGSmootherIdentity : public MGSmootherBase<VECTOR>
{
public:
/**
* Implementation of the
* interface for @p Multigrid.
* This function does nothing,
* which by comparison with the
* definition of this function
* means that the the smoothing
* operator equals the null
* operator.
*/
virtual void smooth (const unsigned int level,
VECTOR& u,
const VECTOR& rhs) const;
virtual void clear ();
};
/**
* Smoother using relaxation classes.
*
* A relaxation class is an object that has two member functions,
* @code
* void step(VECTOR& x, const VECTOR& d) const;
* void Tstep(VECTOR& x, const VECTOR& d) const;
* @endcode
* performing one step of the smoothing scheme.
*
* This class performs smoothing on each level. The operation can be
* controlled by several parameters. First, the relaxation parameter
* @p omega is used in the underlying relaxation method. @p steps is
* the number of relaxation steps on the finest level (on all levels
* if @p variable is off). If @p variable is @p true, the number of
* smoothing steps is doubled on each coarser level. This results in a
* method having the complexity of the W-cycle, but saving grid
* transfers. This is the method proposed by Bramble at al.
*
* The option @p symmetric switches on alternating between the
* smoother and its transpose in each step as proposed by Bramble.
*
* @p transpose uses the transposed smoothing operation using
* <tt>Tstep</tt> instead of the regular <tt>step</tt> of the
* relaxation scheme.
*
* If you are using block matrices, the second @p initialize function
* offers the possibility to extract a single block for smoothing. In
* this case, the multigrid method must be used only with the vector
* associated to that single block.
*
* The library contains instantiation for <tt>SparseMatrix<.></tt> and
* <tt>Vector<.></tt>, where the template arguments are all combinations of
* @p float and @p double. Additional instantiations may be created
* by including the file mg_smoother.templates.h.
*
* @note If '--enable-mgcompatibility' was used on configuring
* deal.II, this class behaves like MGSmootherPrecondition.
*
* @author Guido Kanschat, 2003
*/
template<class MATRIX, class RELAX, class VECTOR>
class MGSmootherRelaxation : public MGSmoother<VECTOR>
{
public:
/**
* Constructor. Sets memory and
* smoothing parameters.
*/
MGSmootherRelaxation(VectorMemory<VECTOR>& mem,
const unsigned int steps = 1,
const bool variable = false,
const bool symmetric = false,
const bool transpose = false);
/**
* Initialize for matrices. This
* function stores pointers to
* the level matrices and
* initializes the smoothing
* operator with the same smoother
* for each level.
*
* @p additional_data is an
* object of type
* @p RELAX::AdditionalData and
* is handed to the
* initialization function of the
* relaxation method.
*/
template <class MATRIX2>
void initialize (const MGLevelObject<MATRIX2>& matrices,
const typename RELAX::AdditionalData & additional_data = typename RELAX::AdditionalData());
/**
* Initialize for matrices. This
* function stores pointers to
* the level matrices and
* initializes the smoothing
* operator with the according
* smoother for each level.
*
* @p additional_data is an
* object of type
* @p RELAX::AdditionalData and
* is handed to the
* initialization function of the
* relaxation method.
*/
template <class MATRIX2, class DATA>
void initialize (const MGLevelObject<MATRIX2>& matrices,
const MGLevelObject<DATA>& additional_data);
/**
* Initialize for single blocks
* of matrices. Of this block
* matrix, the block indicated by
* @p block_row and
* @p block_col is selected on
* each level. This function
* stores pointers to the level
* matrices and initializes the
* smoothing operator with the
* same smoother for each
* level.
*
* @p additional_data is an
* object of type
* @p RELAX::AdditionalData and
* is handed to the
* initialization function of the
* relaxation method.
*/
template <class MATRIX2, class DATA>
void initialize (const MGLevelObject<MATRIX2>& matrices,
const DATA& additional_data,
const unsigned int block_row,
const unsigned int block_col);
/**
* Initialize for single blocks
* of matrices. Of this block
* matrix, the block indicated by
* @p block_row and
* @p block_col is selected on
* each level. This function
* stores pointers to the level
* matrices and initializes the
* smoothing operator with the
* according smoother for each
* level.
*
* @p additional_data is an
* object of type
* @p RELAX::AdditionalData and
* is handed to the
* initialization function of the
* relaxation method.
*/
template <class MATRIX2, class DATA>
void initialize (const MGLevelObject<MATRIX2>& matrices,
const MGLevelObject<DATA>& additional_data,
const unsigned int block_row,
const unsigned int block_col);
/**
* Empty all vectors.
*/
void clear ();
/**
* The actual smoothing method.
*/
virtual void smooth (const unsigned int level,
VECTOR& u,
const VECTOR& rhs) const;
/**
* Object containing relaxation
* methods.
*/
MGLevelObject<RELAX> smoothers;
/**
* Memory used by this object.
*/
unsigned int memory_consumption () const;
private:
/**
* Pointer to the matrices.
*/
MGLevelObject<PointerMatrix<MATRIX, VECTOR> > matrices;
};
/**
* Smoother using preconditioner classes.
*
* This class performs smoothing on each level. The operation can be
* controlled by several parameters. First, the relaxation parameter
* @p omega is used in the underlying relaxation method. @p steps is
* the number of relaxation steps on the finest level (on all levels
* if @p variable is off). If @p variable is @p true, the number of
* smoothing steps is doubled on each coarser level. This results in a
* method having the complexity of the W-cycle, but saving grid
* transfers. This is the method proposed by Bramble at al.
*
* The option @p symmetric switches on alternating between the
* smoother and its transpose in each step as proposed by Bramble.
*
* @p transpose uses the transposed smoothing operation using
* <tt>Tvmult</tt> instead of the regular <tt>vmult</tt> of the
* relaxation scheme.
*
* If you are using block matrices, the second @p initialize function
* offers the possibility to extract a single block for smoothing. In
* this case, the multigrid method must be used only with the vector
* associated to that single block.
*
* The library contains instantiation for <tt>SparseMatrix<.></tt> and
* <tt>Vector<.></tt>, where the template arguments are all combinations of
* @p float and @p double. Additional instantiations may be created
* by including the file mg_smoother.templates.h.
*
* @author Guido Kanschat, 2009
*/
template<class MATRIX, class PRECONDITIONER, class VECTOR>
class MGSmootherPrecondition : public MGSmoother<VECTOR>
{
public:
/**
* Constructor. Sets memory and
* smoothing parameters.
*/
MGSmootherPrecondition(VectorMemory<VECTOR>& mem,
const unsigned int steps = 1,
const bool variable = false,
const bool symmetric = false,
const bool transpose = false);
/**
* Initialize for matrices. This
* function stores pointers to
* the level matrices and
* initializes the smoothing
* operator with the same smoother
* for each level.
*
* @p additional_data is an
* object of type
* @p PRECONDITIONER::AdditionalData and
* is handed to the
* initialization function of the
* relaxation method.
*/
template <class MATRIX2>
void initialize (const MGLevelObject<MATRIX2>& matrices,
const typename PRECONDITIONER::AdditionalData& additional_data = typename PRECONDITIONER::AdditionalData());
/**
* Initialize for matrices. This
* function stores pointers to
* the level matrices and
* initializes the smoothing
* operator with the according
* smoother for each level.
*
* @p additional_data is an
* object of type
* @p PRECONDITIONER::AdditionalData and
* is handed to the
* initialization function of the
* relaxation method.
*/
template <class MATRIX2, class DATA>
void initialize (const MGLevelObject<MATRIX2>& matrices,
const MGLevelObject<DATA>& additional_data);
/**
* Initialize for single blocks
* of matrices. Of this block
* matrix, the block indicated by
* @p block_row and
* @p block_col is selected on
* each level. This function
* stores pointers to the level
* matrices and initializes the
* smoothing operator with the
* same smoother for each
* level.
*
* @p additional_data is an
* object of type
* @p PRECONDITIONER::AdditionalData and
* is handed to the
* initialization function of the
* relaxation method.
*/
template <class MATRIX2, class DATA>
void initialize (const MGLevelObject<MATRIX2>& matrices,
const DATA& additional_data,
const unsigned int block_row,
const unsigned int block_col);
/**
* Initialize for single blocks
* of matrices. Of this block
* matrix, the block indicated by
* @p block_row and
* @p block_col is selected on
* each level. This function
* stores pointers to the level
* matrices and initializes the
* smoothing operator with the
* according smoother for each
* level.
*
* @p additional_data is an
* object of type
* @p PRECONDITIONER::AdditionalData and
* is handed to the
* initialization function of the
* relaxation method.
*/
template <class MATRIX2, class DATA>
void initialize (const MGLevelObject<MATRIX2>& matrices,
const MGLevelObject<DATA>& additional_data,
const unsigned int block_row,
const unsigned int block_col);
/**
* Empty all vectors.
*/
void clear ();
/**
* The actual smoothing method.
*/
virtual void smooth (const unsigned int level,
VECTOR& u,
const VECTOR& rhs) const;
/**
* Object containing relaxation
* methods.
*/
MGLevelObject<PRECONDITIONER> smoothers;
/**
* Memory used by this object.
*/
unsigned int memory_consumption () const;
private:
/**
* Pointer to the matrices.
*/
MGLevelObject<PointerMatrix<MATRIX, VECTOR> > matrices;
};
/*@}*/
/* ------------------------------- Inline functions -------------------------- */
#ifndef DOXYGEN
template <class VECTOR>
inline void
MGSmootherIdentity<VECTOR>::smooth (
const unsigned int, VECTOR&,
const VECTOR&) const
{}
template <class VECTOR>
inline void
MGSmootherIdentity<VECTOR>::clear ()
{}
//---------------------------------------------------------------------------
template <class VECTOR>
inline
MGSmoother<VECTOR>::MGSmoother(
const unsigned int steps,
const bool variable,
const bool symmetric,
const bool transpose)
:
steps(steps),
variable(variable),
symmetric(symmetric),
transpose(transpose),
debug(0),
mem(&my_memory)
{}
template <class VECTOR>
inline
MGSmoother<VECTOR>::MGSmoother(
VectorMemory<VECTOR>& mem,
const unsigned int steps,
const bool variable,
const bool symmetric,
const bool transpose)
:
steps(steps),
variable(variable),
symmetric(symmetric),
transpose(transpose),
debug(0),
mem(&mem)
{}
template <class VECTOR>
inline void
MGSmoother<VECTOR>::set_steps (const unsigned int s)
{
steps = s;
}
template <class VECTOR>
inline void
MGSmoother<VECTOR>::set_debug (const unsigned int s)
{
debug = s;
}
template <class VECTOR>
inline void
MGSmoother<VECTOR>::set_variable (const bool flag)
{
variable = flag;
}
template <class VECTOR>
inline void
MGSmoother<VECTOR>::set_symmetric (const bool flag)
{
symmetric = flag;
}
template <class VECTOR>
inline void
MGSmoother<VECTOR>::set_transpose (const bool flag)
{
transpose = flag;
}
//----------------------------------------------------------------------//
template <class MATRIX, class RELAX, class VECTOR>
inline
MGSmootherRelaxation<MATRIX, RELAX, VECTOR>::MGSmootherRelaxation(
VectorMemory<VECTOR>& mem,
const unsigned int steps,
const bool variable,
const bool symmetric,
const bool transpose)
:
MGSmoother<VECTOR>(mem, steps, variable, symmetric, transpose)
{}
template <class MATRIX, class RELAX, class VECTOR>
inline void
MGSmootherRelaxation<MATRIX, RELAX, VECTOR>::clear ()
{
smoothers.clear();
unsigned int i=matrices.get_minlevel(),
max_level=matrices.get_maxlevel();
for (; i<=max_level; ++i)
matrices[i]=0;
}
template <class MATRIX, class RELAX, class VECTOR>
template <class MATRIX2>
inline void
MGSmootherRelaxation<MATRIX, RELAX, VECTOR>::initialize (
const MGLevelObject<MATRIX2>& m,
const typename RELAX::AdditionalData& data)
{
const unsigned int min = m.get_minlevel();
const unsigned int max = m.get_maxlevel();
matrices.resize(min, max);
smoothers.resize(min, max);
for (unsigned int i=min;i<=max;++i)
{
matrices[i] = &m[i];
smoothers[i].initialize(m[i], data);
}
}
template <class MATRIX, class RELAX, class VECTOR>
template <class MATRIX2, class DATA>
inline void
MGSmootherRelaxation<MATRIX, RELAX, VECTOR>::initialize (
const MGLevelObject<MATRIX2>& m,
const MGLevelObject<DATA>& data)
{
const unsigned int min = m.get_minlevel();
const unsigned int max = m.get_maxlevel();
Assert (data.get_minlevel() == min,
ExcDimensionMismatch(data.get_minlevel(), min));
Assert (data.get_maxlevel() == max,
ExcDimensionMismatch(data.get_maxlevel(), max));
matrices.resize(min, max);
smoothers.resize(min, max);
for (unsigned int i=min;i<=max;++i)
{
matrices[i] = &m[i];
smoothers[i].initialize(m[i], data[i]);
}
}
template <class MATRIX, class RELAX, class VECTOR>
template <class MATRIX2, class DATA>
inline void
MGSmootherRelaxation<MATRIX, RELAX, VECTOR>::initialize (
const MGLevelObject<MATRIX2>& m,
const DATA& data,
const unsigned int row,
const unsigned int col)
{
const unsigned int min = m.get_minlevel();
const unsigned int max = m.get_maxlevel();
matrices.resize(min, max);
smoothers.resize(min, max);
for (unsigned int i=min;i<=max;++i)
{
matrices[i] = &(m[i].block(row, col));
smoothers[i].initialize(m[i].block(row, col), data);
}
}
template <class MATRIX, class RELAX, class VECTOR>
template <class MATRIX2, class DATA>
inline void
MGSmootherRelaxation<MATRIX, RELAX, VECTOR>::initialize (
const MGLevelObject<MATRIX2>& m,
const MGLevelObject<DATA>& data,
const unsigned int row,
const unsigned int col)
{
const unsigned int min = m.get_minlevel();
const unsigned int max = m.get_maxlevel();
Assert (data.get_minlevel() == min,
ExcDimensionMismatch(data.get_minlevel(), min));
Assert (data.get_maxlevel() == max,
ExcDimensionMismatch(data.get_maxlevel(), max));
matrices.resize(min, max);
smoothers.resize(min, max);
for (unsigned int i=min;i<=max;++i)
{
matrices[i] = &(m[i].block(row, col));
smoothers[i].initialize(m[i].block(row, col), data[i]);
}
}
#ifdef DEAL_II_MULTIGRID_COMPATIBILITY
template <class MATRIX, class RELAX, class VECTOR>
inline void
MGSmootherRelaxation<MATRIX, RELAX, VECTOR>::smooth(
const unsigned int level,
VECTOR& u,
const VECTOR& rhs) const
{
unsigned int maxlevel = matrices.get_maxlevel();
unsigned int steps2 = this->steps;
if (this->variable)
steps2 *= (1<<(maxlevel-level));
typename VectorMemory<VECTOR>::Pointer r(*this->mem);
typename VectorMemory<VECTOR>::Pointer d(*this->mem);
r->reinit(u);
d->reinit(u);
bool T = this->transpose;
if (this->symmetric && (steps2 % 2 == 0))
T = false;
if (this->debug > 0)
deallog << 'S' << level << ' ';
for (unsigned int i=0; i<steps2; ++i)
{
if (T)
{
if (this->debug > 0)
deallog << 'T';
matrices[level].vmult(*r,u);
r->sadd(-1.,1.,rhs);
if (this->debug > 2)
deallog << ' ' << r->l2_norm() << ' ';
smoothers[level].Tvmult(*d, *r);
if (this->debug > 1)
deallog << ' ' << d->l2_norm() << ' ';
} else {
if (this->debug > 0)
deallog << 'N';
matrices[level].vmult(*r,u);
r->sadd(-1.,1.,rhs);
if (this->debug > 2)
deallog << ' ' << r->l2_norm() << ' ';
smoothers[level].vmult(*d, *r);
if (this->debug > 1)
deallog << ' ' << d->l2_norm() << ' ';
}
u += *d;
if (this->symmetric)
T = !T;
}
if (this->debug > 0)
deallog << std::endl;
}
#else
template <class MATRIX, class RELAX, class VECTOR>
inline void
MGSmootherRelaxation<MATRIX, RELAX, VECTOR>::smooth(
const unsigned int level,
VECTOR& u,
const VECTOR& rhs) const
{
unsigned int maxlevel = matrices.get_maxlevel();
unsigned int steps2 = this->steps;
if (this->variable)
steps2 *= (1<<(maxlevel-level));
bool T = this->transpose;
if (this->symmetric && (steps2 % 2 == 0))
T = false;
if (this->debug > 0)
deallog << 'S' << level << ' ';
for (unsigned int i=0; i<steps2; ++i)
{
if (T)
smoothers[level].Tstep(u, rhs);
else
smoothers[level].step(u, rhs);
if (this->symmetric)
T = !T;
}
}
#endif
template <class MATRIX, class RELAX, class VECTOR>
inline unsigned int
MGSmootherRelaxation<MATRIX, RELAX, VECTOR>::
memory_consumption () const
{
return sizeof(*this)
+ matrices.memory_consumption()
+ smoothers.memory_consumption()
+ this->mem->memory_consumption();
}
//----------------------------------------------------------------------//
template <class MATRIX, class PRECONDITIONER, class VECTOR>
inline
MGSmootherPrecondition<MATRIX, PRECONDITIONER, VECTOR>::MGSmootherPrecondition(
VectorMemory<VECTOR>& mem,
const unsigned int steps,
const bool variable,
const bool symmetric,
const bool transpose)
:
MGSmoother<VECTOR>(mem, steps, variable, symmetric, transpose)
{}
template <class MATRIX, class PRECONDITIONER, class VECTOR>
inline void
MGSmootherPrecondition<MATRIX, PRECONDITIONER, VECTOR>::clear ()
{
smoothers.clear();
unsigned int i=matrices.get_minlevel(),
max_level=matrices.get_maxlevel();
for (; i<=max_level; ++i)
matrices[i]=0;
}
template <class MATRIX, class PRECONDITIONER, class VECTOR>
template <class MATRIX2>
inline void
MGSmootherPrecondition<MATRIX, PRECONDITIONER, VECTOR>::initialize (
const MGLevelObject<MATRIX2>& m,
const typename PRECONDITIONER::AdditionalData& data)
{
const unsigned int min = m.get_minlevel();
const unsigned int max = m.get_maxlevel();
matrices.resize(min, max);
smoothers.resize(min, max);
for (unsigned int i=min;i<=max;++i)
{
matrices[i] = &m[i];
smoothers[i].initialize(m[i], data);
}
}
template <class MATRIX, class PRECONDITIONER, class VECTOR>
template <class MATRIX2, class DATA>
inline void
MGSmootherPrecondition<MATRIX, PRECONDITIONER, VECTOR>::initialize (
const MGLevelObject<MATRIX2>& m,
const MGLevelObject<DATA>& data)
{
const unsigned int min = m.get_minlevel();
const unsigned int max = m.get_maxlevel();
Assert (data.get_minlevel() == min,
ExcDimensionMismatch(data.get_minlevel(), min));
Assert (data.get_maxlevel() == max,
ExcDimensionMismatch(data.get_maxlevel(), max));
matrices.resize(min, max);
smoothers.resize(min, max);
for (unsigned int i=min;i<=max;++i)
{
matrices[i] = &m[i];
smoothers[i].initialize(m[i], data[i]);
}
}
template <class MATRIX, class PRECONDITIONER, class VECTOR>
template <class MATRIX2, class DATA>
inline void
MGSmootherPrecondition<MATRIX, PRECONDITIONER, VECTOR>::initialize (
const MGLevelObject<MATRIX2>& m,
const DATA& data,
const unsigned int row,
const unsigned int col)
{
const unsigned int min = m.get_minlevel();
const unsigned int max = m.get_maxlevel();
matrices.resize(min, max);
smoothers.resize(min, max);
for (unsigned int i=min;i<=max;++i)
{
matrices[i] = &(m[i].block(row, col));
smoothers[i].initialize(m[i].block(row, col), data);
}
}
template <class MATRIX, class PRECONDITIONER, class VECTOR>
template <class MATRIX2, class DATA>
inline void
MGSmootherPrecondition<MATRIX, PRECONDITIONER, VECTOR>::initialize (
const MGLevelObject<MATRIX2>& m,
const MGLevelObject<DATA>& data,
const unsigned int row,
const unsigned int col)
{
const unsigned int min = m.get_minlevel();
const unsigned int max = m.get_maxlevel();
Assert (data.get_minlevel() == min,
ExcDimensionMismatch(data.get_minlevel(), min));
Assert (data.get_maxlevel() == max,
ExcDimensionMismatch(data.get_maxlevel(), max));
matrices.resize(min, max);
smoothers.resize(min, max);
for (unsigned int i=min;i<=max;++i)
{
matrices[i] = &(m[i].block(row, col));
smoothers[i].initialize(m[i].block(row, col), data[i]);
}
}
template <class MATRIX, class PRECONDITIONER, class VECTOR>
inline void
MGSmootherPrecondition<MATRIX, PRECONDITIONER, VECTOR>::smooth(
const unsigned int level,
VECTOR& u,
const VECTOR& rhs) const
{
unsigned int maxlevel = matrices.get_maxlevel();
unsigned int steps2 = this->steps;
if (this->variable)
steps2 *= (1<<(maxlevel-level));
typename VectorMemory<VECTOR>::Pointer r(*this->mem);
typename VectorMemory<VECTOR>::Pointer d(*this->mem);
r->reinit(u,true);
d->reinit(u,true);
bool T = this->transpose;
if (this->symmetric && (steps2 % 2 == 0))
T = false;
if (this->debug > 0)
deallog << 'S' << level << ' ';
for (unsigned int i=0; i<steps2; ++i)
{
if (T)
{
if (this->debug > 0)
deallog << 'T';
matrices[level].Tvmult(*r,u);
r->sadd(-1.,1.,rhs);
if (this->debug > 2)
deallog << ' ' << r->l2_norm() << ' ';
smoothers[level].Tvmult(*d, *r);
if (this->debug > 1)
deallog << ' ' << d->l2_norm() << ' ';
} else {
if (this->debug > 0)
deallog << 'N';
matrices[level].vmult(*r,u);
r->sadd(-1.,rhs);
if (this->debug > 2)
deallog << ' ' << r->l2_norm() << ' ';
smoothers[level].vmult(*d, *r);
if (this->debug > 1)
deallog << ' ' << d->l2_norm() << ' ';
}
u += *d;
if (this->symmetric)
T = !T;
}
if (this->debug > 0)
deallog << std::endl;
}
template <class MATRIX, class PRECONDITIONER, class VECTOR>
inline unsigned int
MGSmootherPrecondition<MATRIX, PRECONDITIONER, VECTOR>::
memory_consumption () const
{
return sizeof(*this)
+ matrices.memory_consumption()
+ smoothers.memory_consumption()
+ this->mem->memory_consumption();
}
#endif // DOXYGEN
DEAL_II_NAMESPACE_CLOSE
#endif
|