/usr/include/deal.II/meshworker/simple.h is in libdeal.ii-dev 8.1.0-6ubuntu1.
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 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 | // ---------------------------------------------------------------------
// $Id: simple.h 31932 2013-12-08 02:15:54Z heister $
//
// Copyright (C) 2010 - 2013 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.
//
// ---------------------------------------------------------------------
#ifndef __deal2__mesh_worker_simple_h
#define __deal2__mesh_worker_simple_h
#include <deal.II/base/named_data.h>
#include <deal.II/base/smartpointer.h>
#include <deal.II/base/mg_level_object.h>
#include <deal.II/lac/block_vector.h>
#include <deal.II/meshworker/dof_info.h>
#include <deal.II/meshworker/functional.h>
#include <deal.II/multigrid/mg_constrained_dofs.h>
/**
* @file
* @brief MeshWorker::Assember objects for systems without block structure
*
* The header containing the classes
* MeshWorker::Assember::MatrixSimple,
* MeshWorker::Assember::MGMatrixSimple,
* MeshWorker::Assember::ResidualSimple, and
* MeshWorker::Assember::SystemSimple.
*/
DEAL_II_NAMESPACE_OPEN
namespace MeshWorker
{
namespace Assembler
{
/**
* Assemble residuals without block structure.
*
* The data structure for this Assembler class is a simple vector on
* each cell with entries from zero to
* FiniteElementData::dofs_per_cell and a simple global vector with
* entries numbered from zero to DoFHandler::n_dofs(). No BlockInfo is
* required and the global vector may be any type of vector having
* element access through <tt>operator() (unsigned int)</tt>
*
* @ingroup MeshWorker
* @author Guido Kanschat, 2009
*/
template <class VECTOR>
class ResidualSimple
{
public:
void initialize(NamedData<VECTOR *> &results);
/**
* Initialize the constraints.
*/
void initialize(const ConstraintMatrix &constraints);
/**
* @deprecated This function is of no effect. Only the block info
* structure in DoFInfo is being used.
*
* Store information on the local block structure. If the
* assembler is inititialized with this function,
* initialize_info() will generate one local matrix for each
* block row and column, which will be numbered
* lexicographically, row by row.
*
* In spite of using local block structure, all blocks will be
* enteres into the same global matrix, disregarding any global
* block structure.
*/
void initialize_local_blocks(const BlockIndices &);
/**
* Initialize the local data in the DoFInfo object used later
* for assembling.
*
* The info object refers to a cell if <code>!face</code>, or
* else to an interior or boundary face.
*/
template <class DOFINFO>
void initialize_info(DOFINFO &info, bool face) const;
/**
* Assemble the local residuals into the global residuals.
*
* Values are added to the previous contents. If constraints are
* active, ConstraintMatrix::distribute_local_to_global() is
* used.
*/
template <class DOFINFO>
void assemble(const DOFINFO &info);
/**
* Assemble both local residuals into the global residuals.
*/
template<class DOFINFO>
void assemble(const DOFINFO &info1,
const DOFINFO &info2);
private:
/**
* The global residal vectors filled by assemble().
*/
NamedData<SmartPointer<VECTOR,ResidualSimple<VECTOR> > > residuals;
/**
* A pointer to the object containing constraints.
*/
SmartPointer<const ConstraintMatrix,ResidualSimple<VECTOR> > constraints;
};
/**
* Assemble local matrices into a single global matrix. If this global
* matrix has a block structure, this structure is not used, but
* rather the global numbering of degrees of freedom.
*
* After being initialized with a SparseMatrix object (or another
* matrix offering the same functionality as SparseMatrix::add()),
* this class can be used in a MeshWorker::loop() to assemble the cell
* and face matrices into the global matrix.
*
* If a ConstraintMatrix has been provided during initialization, this
* matrix will be used
* (ConstraintMatrix::distribute_local_to_global(), to be precise) to
* enter the local matrix into the global sparse matrix.
*
* The assembler can handle two different types of local data. First,
* by default, the obvious choice of taking a single local matrix with
* dimensions equal to the number of degrees of freedom of the
* cell. Alternatively, a local block structure can be initialized
* in DoFInfo. After this, the local data will be
* arranged as an array of n by n FullMatrix blocks, which are
* ordered lexicographically in DoFInfo.
*
* @ingroup MeshWorker
* @author Guido Kanschat, 2009
*/
template <class MATRIX>
class MatrixSimple
{
public:
/**
* Constructor, initializing the #threshold, which limits how
* small numbers may be to be entered into the matrix.
*/
MatrixSimple(double threshold = 1.e-12);
/**
* Store the result matrix for later assembling.
*/
void initialize(MATRIX &m);
/**
* Initialize the constraints. After this function has been
* called with a valid ConstraintMatrix, the function
* ConstraintMatrix::distribute_local_to_global() will be used
* by assemble() to distribute the cell and face matrices into a
* global sparse matrix.
*/
void initialize(const ConstraintMatrix &constraints);
/**
* @deprecated This function is of no effect. Only the block info
* structure in DoFInfo is being used.
*
* Store information on the local block structure. If the
* assembler is inititialized with this function,
* initialize_info() will generate one local matrix for each
* block row and column, which will be numbered
* lexicographically, row by row.
*
* In spite of using local block structure, all blocks will be
* enteres into the same global matrix, disregarding any global
* block structure.
*/
void initialize_local_blocks(const BlockIndices &);
/**
* Initialize the local data in the DoFInfo object used later
* for assembling.
*
* The info object refers to a cell if <code>!face</code>, or
* else to an interior or boundary face.
*/
template <class DOFINFO>
void initialize_info(DOFINFO &info, bool face) const;
/**
* Assemble the matrix DoFInfo::M1[0] into the global matrix.
*/
template<class DOFINFO>
void assemble(const DOFINFO &info);
/**
* Assemble both local matrices in the info objects into the
* global matrix.
*/
template<class DOFINFO>
void assemble(const DOFINFO &info1,
const DOFINFO &info2);
private:
/**
* Assemble a single matrix
* into #matrix.
*/
void assemble(const FullMatrix<double> &M,
const std::vector<types::global_dof_index> &i1,
const std::vector<types::global_dof_index> &i2);
/**
* The global matrix being
* assembled.
*/
SmartPointer<MATRIX,MatrixSimple<MATRIX> > matrix;
/**
* A pointer to the object
* containing constraints.
*/
SmartPointer<const ConstraintMatrix,MatrixSimple<MATRIX> > constraints;
/**
* The smallest positive number that will be entered into the
* global matrix. All smaller absolute values will be treated as
* zero and will not be assembled.
*/
const double threshold;
};
/**
* Assemble local matrices into level matrices without using
* block structure.
*
* @todo The matrix structures needed for assembling level matrices
* with local refinement and continuous elements are missing.
*
* @ingroup MeshWorker
* @author Guido Kanschat, 2009
*/
template <class MATRIX>
class MGMatrixSimple
{
public:
/**
* Constructor, initializing the #threshold, which limits how
* small numbers may be to be entered into the matrix.
*/
MGMatrixSimple(double threshold = 1.e-12);
/**
* Store the result matrix for later assembling.
*/
void initialize(MGLevelObject<MATRIX> &m);
/**
* Initialize the multilevel constraints.
*/
void initialize(const MGConstrainedDoFs &mg_constrained_dofs);
/**
* @deprecated This function is of no effect. Only the block
* info structure in DoFInfo is being used.
*
* Store information on the local block structure. If the
* assembler is inititialized with this function,
* initialize_info() will generate one local matrix for each
* block row and column, which will be numbered
* lexicographically, row by row.
*
* In spite of using local block structure, all blocks will be
* enteres into the same global matrix, disregarding any global
* block structure.
*/
void initialize_local_blocks(const BlockIndices &);
/**
* Initialize the matrices #flux_up and #flux_down used for
* local refinement with discontinuous Galerkin methods.
*/
void initialize_fluxes(MGLevelObject<MATRIX> &flux_up,
MGLevelObject<MATRIX> &flux_down);
/**
* Initialize the matrices #interface_in and #interface_out used
* for local refinement with continuous Galerkin methods.
*/
void initialize_interfaces(MGLevelObject<MATRIX> &interface_in,
MGLevelObject<MATRIX> &interface_out);
/**
* Initialize the local data in the DoFInfo object used later
* for assembling.
*
* The info object refers to a cell if <code>!face</code>, or
* else to an interior or boundary face.
*/
template <class DOFINFO>
void initialize_info(DOFINFO &info, bool face) const;
/**
* Assemble the matrix DoFInfo::M1[0] into the global matrix.
*/
template<class DOFINFO>
void assemble(const DOFINFO &info);
/**
* Assemble both local matrices in the info objects into the
* global matrices.
*/
template<class DOFINFO>
void assemble(const DOFINFO &info1,
const DOFINFO &info2);
private:
/**
* Assemble a single matrix into a global matrix.
*/
void assemble(MATRIX &G,
const FullMatrix<double> &M,
const std::vector<types::global_dof_index> &i1,
const std::vector<types::global_dof_index> &i2);
/**
* Assemble a single matrix into a global matrix.
*/
void assemble(MATRIX &G,
const FullMatrix<double> &M,
const std::vector<types::global_dof_index> &i1,
const std::vector<types::global_dof_index> &i2,
const unsigned int level);
/**
* Assemble a single matrix into a global matrix.
*/
void assemble_up(MATRIX &G,
const FullMatrix<double> &M,
const std::vector<types::global_dof_index> &i1,
const std::vector<types::global_dof_index> &i2,
const unsigned int level = numbers::invalid_unsigned_int);
/**
* Assemble a single matrix into a global matrix.
*/
void assemble_down(MATRIX &G,
const FullMatrix<double> &M,
const std::vector<types::global_dof_index> &i1,
const std::vector<types::global_dof_index> &i2,
const unsigned int level = numbers::invalid_unsigned_int);
/**
* Assemble a single matrix into a global matrix.
*/
void assemble_in(MATRIX &G,
const FullMatrix<double> &M,
const std::vector<types::global_dof_index> &i1,
const std::vector<types::global_dof_index> &i2,
const unsigned int level = numbers::invalid_unsigned_int);
/**
* Assemble a single matrix into a global matrix.
*/
void assemble_out(MATRIX &G,
const FullMatrix<double> &M,
const std::vector<types::global_dof_index> &i1,
const std::vector<types::global_dof_index> &i2,
const unsigned int level = numbers::invalid_unsigned_int);
/**
* The global matrix being assembled.
*/
SmartPointer<MGLevelObject<MATRIX>,MGMatrixSimple<MATRIX> > matrix;
/**
* The matrix used for face flux terms across the refinement
* edge, coupling coarse to fine.
*/
SmartPointer<MGLevelObject<MATRIX>,MGMatrixSimple<MATRIX> > flux_up;
/**
* The matrix used for face flux terms across the refinement
* edge, coupling fine to coarse.
*/
SmartPointer<MGLevelObject<MATRIX>,MGMatrixSimple<MATRIX> > flux_down;
/**
* The matrix used for face contributions for continuous
* elements across the refinement edge, coupling coarse to fine.
*/
SmartPointer<MGLevelObject<MATRIX>,MGMatrixSimple<MATRIX> > interface_in;
/**
* The matrix used for face contributions for continuous
* elements across the refinement edge, coupling fine to coarse.
*/
SmartPointer<MGLevelObject<MATRIX>,MGMatrixSimple<MATRIX> > interface_out;
/**
* A pointer to the object containing constraints.
*/
SmartPointer<const MGConstrainedDoFs,MGMatrixSimple<MATRIX> > mg_constrained_dofs;
/**
* The smallest positive number that will be entered into the
* global matrix. All smaller absolute values will be treated as
* zero and will not be assembled.
*/
const double threshold;
};
/**
* Assemble a simple matrix and a simple right hand side at once. We
* use a combination of MatrixSimple and ResidualSimple to achieve
* this. Cell and face operators should fill the matrix and vector
* objects in LocalResults and this class will assemble
* them into matrix and vector objects.
*
* @ingroup MeshWorker
* @author Guido Kanschat, 2009
*/
template <class MATRIX, class VECTOR>
class SystemSimple :
private MatrixSimple<MATRIX>,
private ResidualSimple<VECTOR>
{
public:
/**
* Constructor setting the
* threshold value in
* MatrixSimple.
*/
SystemSimple(double threshold = 1.e-12);
/**
* Store the two objects data
* is assembled into.
*/
void initialize(MATRIX &m, VECTOR &rhs);
/**
* Initialize the constraints. After this function has been
* called with a valid ConstraintMatrix, the function
* ConstraintMatrix::distribute_local_to_global() will be used
* by assemble() to distribute the cell and face matrices into a
* global sparse matrix.
*/
void initialize(const ConstraintMatrix &constraints);
/**
* Initialize the local data
* in the
* DoFInfo
* object used later for
* assembling.
*
* The info object refers to
* a cell if
* <code>!face</code>, or
* else to an interior or
* boundary face.
*/
template <class DOFINFO>
void initialize_info(DOFINFO &info, bool face) const;
/**
* Assemble the matrix
* DoFInfo::M1[0]
* into the global matrix.
*/
template<class DOFINFO>
void assemble(const DOFINFO &info);
/**
* Assemble both local
* matrices in the info
* objects into the global
* matrix.
*/
template<class DOFINFO>
void assemble(const DOFINFO &info1,
const DOFINFO &info2);
};
//----------------------------------------------------------------------//
template <class VECTOR>
inline void
ResidualSimple<VECTOR>::initialize(NamedData<VECTOR *> &results)
{
residuals = results;
}
template <class VECTOR>
inline void
ResidualSimple<VECTOR>::initialize(const ConstraintMatrix &c)
{
constraints = &c;
}
template <class MATRIX>
inline void
ResidualSimple<MATRIX>::initialize_local_blocks(const BlockIndices &)
{}
template <class VECTOR>
template <class DOFINFO>
inline void
ResidualSimple<VECTOR>::initialize_info(DOFINFO &info, bool) const
{
info.initialize_vectors(residuals.size());
}
template <class VECTOR>
template <class DOFINFO>
inline void
ResidualSimple<VECTOR>::assemble(const DOFINFO &info)
{
for (unsigned int k=0; k<residuals.size(); ++k)
{
if (constraints == 0)
{
for (unsigned int i=0; i<info.vector(k).block(0).size(); ++i)
(*residuals(k))(info.indices[i]) += info.vector(k).block(0)(i);
}
else
{
if (info.indices_by_block.size() == 0)
constraints->distribute_local_to_global(info.vector(k).block(0), info.indices, (*residuals(k)));
else
for (unsigned int i=0; i != info.vector(k).n_blocks(); ++i)
constraints->distribute_local_to_global(info.vector(k).block(i), info.indices_by_block[i], (*residuals(k)));
}
}
}
template <class VECTOR>
template <class DOFINFO>
inline void
ResidualSimple<VECTOR>::assemble(const DOFINFO &info1,
const DOFINFO &info2)
{
for (unsigned int k=0; k<residuals.size(); ++k)
{
if (constraints == 0)
{
for (unsigned int i=0; i<info1.vector(k).block(0).size(); ++i)
(*residuals(k))(info1.indices[i]) += info1.vector(k).block(0)(i);
for (unsigned int i=0; i<info2.vector(k).block(0).size(); ++i)
(*residuals(k))(info2.indices[i]) += info2.vector(k).block(0)(i);
}
else
{
if (info1.indices_by_block.size() == 0 && info2.indices_by_block.size() == 0)
{
constraints->distribute_local_to_global
(info1.vector(k).block(0), info1.indices, (*residuals(k)));
constraints->distribute_local_to_global
(info2.vector(k).block(0), info2.indices, (*residuals(k)));
}
else if (info1.indices_by_block.size() != 0 && info2.indices_by_block.size() != 0)
{
for (unsigned int i=0; i<info1.vector(k).n_blocks(); ++i)
{
constraints->distribute_local_to_global
(info1.vector(k).block(i), info1.indices_by_block[i], (*residuals(k)));
constraints->distribute_local_to_global
(info2.vector(k).block(i), info2.indices_by_block[i], (*residuals(k)));
}
}
else
{
Assert(false, ExcNotImplemented());
}
}
}
}
//----------------------------------------------------------------------//
template <class MATRIX>
inline
MatrixSimple<MATRIX>::MatrixSimple(double threshold)
:
threshold(threshold)
{}
template <class MATRIX>
inline void
MatrixSimple<MATRIX>::initialize(MATRIX &m)
{
matrix = &m;
}
template <class MATRIX>
inline void
MatrixSimple<MATRIX>::initialize(const ConstraintMatrix &c)
{
constraints = &c;
}
template <class MATRIX>
inline void
MatrixSimple<MATRIX>::initialize_local_blocks(const BlockIndices &)
{}
template <class MATRIX >
template <class DOFINFO>
inline void
MatrixSimple<MATRIX>::initialize_info(DOFINFO &info, bool face) const
{
const unsigned int n = info.indices_by_block.size();
if (n == 0)
info.initialize_matrices(1, face);
else
{
info.initialize_matrices(n*n, face);
unsigned int k=0;
for (unsigned int i=0; i<n; ++i)
for (unsigned int j=0; j<n; ++j,++k)
{
info.matrix(k,false).row = i;
info.matrix(k,false).column = j;
if (face)
{
info.matrix(k,true).row = i;
info.matrix(k,true).column = j;
}
}
}
}
template <class MATRIX>
inline void
MatrixSimple<MATRIX>::assemble(const FullMatrix<double> &M,
const std::vector<types::global_dof_index> &i1,
const std::vector<types::global_dof_index> &i2)
{
AssertDimension(M.m(), i1.size());
AssertDimension(M.n(), i2.size());
if (constraints == 0)
{
for (unsigned int j=0; j<i1.size(); ++j)
for (unsigned int k=0; k<i2.size(); ++k)
if (std::fabs(M(j,k)) >= threshold)
matrix->add(i1[j], i2[k], M(j,k));
}
else
constraints->distribute_local_to_global(M, i1, i2, *matrix);
}
template <class MATRIX>
template <class DOFINFO>
inline void
MatrixSimple<MATRIX>::assemble(const DOFINFO &info)
{
Assert(!info.level_cell, ExcMessage("Cell may not access level dofs"));
if (info.indices_by_block.size() == 0)
assemble(info.matrix(0,false).matrix, info.indices, info.indices);
else
{
for (unsigned int k=0; k<info.n_matrices(); ++k)
{
assemble(info.matrix(k,false).matrix,
info.indices_by_block[info.matrix(k,false).row],
info.indices_by_block[info.matrix(k,false).column]);
}
}
}
template <class MATRIX>
template <class DOFINFO>
inline void
MatrixSimple<MATRIX>::assemble(const DOFINFO &info1, const DOFINFO &info2)
{
Assert(!info1.level_cell, ExcMessage("Cell may not access level dofs"));
Assert(!info2.level_cell, ExcMessage("Cell may not access level dofs"));
if (info1.indices_by_block.size() == 0 && info2.indices_by_block.size() == 0)
{
assemble(info1.matrix(0,false).matrix, info1.indices, info1.indices);
assemble(info1.matrix(0,true).matrix, info1.indices, info2.indices);
assemble(info2.matrix(0,false).matrix, info2.indices, info2.indices);
assemble(info2.matrix(0,true).matrix, info2.indices, info1.indices);
}
else if (info1.indices_by_block.size() != 0 && info2.indices_by_block.size() != 0)
for (unsigned int k=0; k<info1.n_matrices(); ++k)
{
const unsigned int row = info1.matrix(k,false).row;
const unsigned int column = info1.matrix(k,false).column;
assemble(info1.matrix(k,false).matrix,
info1.indices_by_block[row], info1.indices_by_block[column]);
assemble(info1.matrix(k,true).matrix,
info1.indices_by_block[row], info2.indices_by_block[column]);
assemble(info2.matrix(k,false).matrix,
info2.indices_by_block[row], info2.indices_by_block[column]);
assemble(info2.matrix(k,true).matrix,
info2.indices_by_block[row], info1.indices_by_block[column]);
}
else
{
Assert(false, ExcNotImplemented());
}
}
//----------------------------------------------------------------------//
template <class MATRIX>
inline
MGMatrixSimple<MATRIX>::MGMatrixSimple(double threshold)
:
threshold(threshold)
{}
template <class MATRIX>
inline void
MGMatrixSimple<MATRIX>::initialize(MGLevelObject<MATRIX> &m)
{
matrix = &m;
}
template <class MATRIX>
inline void
MGMatrixSimple<MATRIX>::initialize(const MGConstrainedDoFs &c)
{
mg_constrained_dofs = &c;
}
template <class MATRIX>
inline void
MGMatrixSimple<MATRIX>::initialize_local_blocks(const BlockIndices &)
{}
template <class MATRIX>
inline void
MGMatrixSimple<MATRIX>::initialize_fluxes(
MGLevelObject<MATRIX> &up, MGLevelObject<MATRIX> &down)
{
flux_up = &up;
flux_down = &down;
}
template <class MATRIX>
inline void
MGMatrixSimple<MATRIX>::initialize_interfaces(
MGLevelObject<MATRIX> &in, MGLevelObject<MATRIX> &out)
{
interface_in = ∈
interface_out = &out;
}
template <class MATRIX >
template <class DOFINFO>
inline void
MGMatrixSimple<MATRIX>::initialize_info(DOFINFO &info, bool face) const
{
const unsigned int n = info.indices_by_block.size();
if (n == 0)
info.initialize_matrices(1, face);
else
{
info.initialize_matrices(n*n, face);
unsigned int k=0;
for (unsigned int i=0; i<n; ++i)
for (unsigned int j=0; j<n; ++j,++k)
{
info.matrix(k,false).row = i;
info.matrix(k,false).column = j;
if (face)
{
info.matrix(k,true).row = i;
info.matrix(k,true).column = j;
}
}
}
}
template <class MATRIX>
inline void
MGMatrixSimple<MATRIX>::assemble(
MATRIX &G,
const FullMatrix<double> &M,
const std::vector<types::global_dof_index> &i1,
const std::vector<types::global_dof_index> &i2)
{
AssertDimension(M.m(), i1.size());
AssertDimension(M.n(), i2.size());
if (mg_constrained_dofs == 0)
{
for (unsigned int j=0; j<i1.size(); ++j)
for (unsigned int k=0; k<i2.size(); ++k)
if (std::fabs(M(j,k)) >= threshold)
G.add(i1[j], i2[k], M(j,k));
}
else
{
for (unsigned int j=0; j<i1.size(); ++j)
for (unsigned int k=0; k<i2.size(); ++k)
if (std::fabs(M(j,k)) >= threshold)
{
if (!mg_constrained_dofs->continuity_across_refinement_edges())
G.add(i1[j], i2[k], M(j,k));
}
}
}
template <class MATRIX>
inline void
MGMatrixSimple<MATRIX>::assemble(
MATRIX &G,
const FullMatrix<double> &M,
const std::vector<types::global_dof_index> &i1,
const std::vector<types::global_dof_index> &i2,
const unsigned int level)
{
AssertDimension(M.m(), i1.size());
AssertDimension(M.n(), i2.size());
if (mg_constrained_dofs == 0)
{
for (unsigned int j=0; j<i1.size(); ++j)
for (unsigned int k=0; k<i2.size(); ++k)
if (std::fabs(M(j,k)) >= threshold)
G.add(i1[j], i2[k], M(j,k));
}
else
{
for (unsigned int j=0; j<i1.size(); ++j)
for (unsigned int k=0; k<i2.size(); ++k)
if (std::fabs(M(j,k)) >= threshold)
if (!mg_constrained_dofs->at_refinement_edge(level, i1[j]) &&
!mg_constrained_dofs->at_refinement_edge(level, i2[k]))
{
if (mg_constrained_dofs->set_boundary_values())
{
// At the boundary, only enter the term on the
// diagonal, but not the coupling terms
if ((!mg_constrained_dofs->is_boundary_index(level, i1[j]) &&
!mg_constrained_dofs->is_boundary_index(level, i2[k]))
||
(mg_constrained_dofs->is_boundary_index(level, i1[j]) &&
mg_constrained_dofs->is_boundary_index(level, i2[k]) &&
i1[j] == i2[k]))
G.add(i1[j], i2[k], M(j,k));
}
else
G.add(i1[j], i2[k], M(j,k));
}
}
}
template <class MATRIX>
inline void
MGMatrixSimple<MATRIX>::assemble_up(
MATRIX &G,
const FullMatrix<double> &M,
const std::vector<types::global_dof_index> &i1,
const std::vector<types::global_dof_index> &i2,
const unsigned int level)
{
AssertDimension(M.n(), i1.size());
AssertDimension(M.m(), i2.size());
if (mg_constrained_dofs == 0)
{
for (unsigned int j=0; j<i1.size(); ++j)
for (unsigned int k=0; k<i2.size(); ++k)
if (std::fabs(M(k,j)) >= threshold)
G.add(i1[j], i2[k], M(k,j));
}
else
{
for (unsigned int j=0; j<i1.size(); ++j)
for (unsigned int k=0; k<i2.size(); ++k)
if (std::fabs(M(k,j)) >= threshold)
if (!mg_constrained_dofs->at_refinement_edge(level, i2[k]))
G.add(i1[j], i2[k], M(k,j));
}
}
template <class MATRIX>
inline void
MGMatrixSimple<MATRIX>::assemble_down(
MATRIX &G,
const FullMatrix<double> &M,
const std::vector<types::global_dof_index> &i1,
const std::vector<types::global_dof_index> &i2,
const unsigned int level)
{
AssertDimension(M.m(), i1.size());
AssertDimension(M.n(), i2.size());
if (mg_constrained_dofs == 0)
{
for (unsigned int j=0; j<i1.size(); ++j)
for (unsigned int k=0; k<i2.size(); ++k)
if (std::fabs(M(j,k)) >= threshold)
G.add(i1[j], i2[k], M(j,k));
}
else
{
for (unsigned int j=0; j<i1.size(); ++j)
for (unsigned int k=0; k<i2.size(); ++k)
if (std::fabs(M(j,k)) >= threshold)
if (!mg_constrained_dofs->at_refinement_edge(level, i2[k]))
G.add(i1[j], i2[k], M(j,k));
}
}
template <class MATRIX>
inline void
MGMatrixSimple<MATRIX>::assemble_in(
MATRIX &G,
const FullMatrix<double> &M,
const std::vector<types::global_dof_index> &i1,
const std::vector<types::global_dof_index> &i2,
const unsigned int level)
{
AssertDimension(M.m(), i1.size());
AssertDimension(M.n(), i2.size());
Assert(mg_constrained_dofs != 0, ExcInternalError());
for (unsigned int j=0; j<i1.size(); ++j)
for (unsigned int k=0; k<i2.size(); ++k)
if (std::fabs(M(j,k)) >= threshold)
// Enter values into matrix only if j corresponds to a
// degree of freedom on the refinemenent edge, k does
// not, and both are not on the boundary. This is part
// the difference between the complete matrix with no
// boundary condition at the refinement edge and and
// the matrix assembled above by assemble().
// Thus the logic is: enter the row if it is
// constrained by hanging node constraints (actually,
// the whole refinement edge), but not if it is
// constrained by a boundary constraint.
if (mg_constrained_dofs->at_refinement_edge(level, i1[j]) &&
!mg_constrained_dofs->at_refinement_edge(level, i2[k]))
{
if (mg_constrained_dofs->set_boundary_values())
{
if ((!mg_constrained_dofs->at_refinement_edge_boundary(level, i1[j]) &&
!mg_constrained_dofs->at_refinement_edge_boundary(level, i2[k]))
||
(mg_constrained_dofs->at_refinement_edge_boundary(level, i1[j]) &&
mg_constrained_dofs->at_refinement_edge_boundary(level, i2[k]) &&
i1[j] == i2[k]))
G.add(i1[j], i2[k], M(j,k));
}
else
G.add(i1[j], i2[k], M(j,k));
}
}
template <class MATRIX>
inline void
MGMatrixSimple<MATRIX>::assemble_out(
MATRIX &G,
const FullMatrix<double> &M,
const std::vector<types::global_dof_index> &i1,
const std::vector<types::global_dof_index> &i2,
const unsigned int level)
{
AssertDimension(M.n(), i1.size());
AssertDimension(M.m(), i2.size());
Assert(mg_constrained_dofs != 0, ExcInternalError());
for (unsigned int j=0; j<i1.size(); ++j)
for (unsigned int k=0; k<i2.size(); ++k)
if (std::fabs(M(k,j)) >= threshold)
if (mg_constrained_dofs->at_refinement_edge(level, i1[j]) &&
!mg_constrained_dofs->at_refinement_edge(level, i2[k]))
{
if (mg_constrained_dofs->set_boundary_values())
{
if ((!mg_constrained_dofs->at_refinement_edge_boundary(level, i1[j]) &&
!mg_constrained_dofs->at_refinement_edge_boundary(level, i2[k]))
||
(mg_constrained_dofs->at_refinement_edge_boundary(level, i1[j]) &&
mg_constrained_dofs->at_refinement_edge_boundary(level, i2[k]) &&
i1[j] == i2[k]))
G.add(i1[j], i2[k], M(k,j));
}
else
G.add(i1[j], i2[k], M(k,j));
}
}
template <class MATRIX>
template <class DOFINFO>
inline void
MGMatrixSimple<MATRIX>::assemble(const DOFINFO &info)
{
Assert(info.level_cell, ExcMessage("Cell must access level dofs"));
const unsigned int level = info.cell->level();
if (info.indices_by_block.size() == 0)
{
assemble((*matrix)[level], info.matrix(0,false).matrix,
info.indices, info.indices, level);
if (mg_constrained_dofs != 0)
{
assemble_in((*interface_in)[level], info.matrix(0,false).matrix,
info.indices, info.indices, level);
assemble_out((*interface_out)[level],info.matrix(0,false).matrix,
info.indices, info.indices, level);
}
}
else
for (unsigned int k=0; k<info.n_matrices(); ++k)
{
const unsigned int row = info.matrix(k,false).row;
const unsigned int column = info.matrix(k,false).column;
assemble((*matrix)[level], info.matrix(k,false).matrix,
info.indices_by_block[row], info.indices_by_block[column], level);
if (mg_constrained_dofs != 0)
{
assemble_in((*interface_in)[level], info.matrix(k,false).matrix,
info.indices_by_block[row], info.indices_by_block[column], level);
assemble_out((*interface_out)[level],info.matrix(k,false).matrix,
info.indices_by_block[column], info.indices_by_block[row], level);
}
}
}
template <class MATRIX>
template <class DOFINFO>
inline void
MGMatrixSimple<MATRIX>::assemble(const DOFINFO &info1,
const DOFINFO &info2)
{
Assert(info1.level_cell, ExcMessage("Cell must access level dofs"));
Assert(info2.level_cell, ExcMessage("Cell must access level dofs"));
const unsigned int level1 = info1.cell->level();
const unsigned int level2 = info2.cell->level();
if (info1.indices_by_block.size() == 0)
{
if (level1 == level2)
{
if (mg_constrained_dofs == 0)
{
assemble((*matrix)[level1], info1.matrix(0,false).matrix, info1.indices, info1.indices);
assemble((*matrix)[level1], info1.matrix(0,true).matrix, info1.indices, info2.indices);
assemble((*matrix)[level1], info2.matrix(0,false).matrix, info2.indices, info2.indices);
assemble((*matrix)[level1], info2.matrix(0,true).matrix, info2.indices, info1.indices);
}
else
{
assemble((*matrix)[level1], info1.matrix(0,false).matrix, info1.indices, info1.indices, level1);
assemble((*matrix)[level1], info1.matrix(0,true).matrix, info1.indices, info2.indices, level1);
assemble((*matrix)[level1], info2.matrix(0,false).matrix, info2.indices, info2.indices, level1);
assemble((*matrix)[level1], info2.matrix(0,true).matrix, info2.indices, info1.indices, level1);
}
}
else
{
Assert(level1 > level2, ExcInternalError());
// Do not add info2.M1,
// which is done by
// the coarser cell
assemble((*matrix)[level1], info1.matrix(0,false).matrix, info1.indices, info1.indices);
if (level1>0)
{
assemble_up((*flux_up)[level1],info1.matrix(0,true).matrix, info2.indices, info1.indices, level1);
assemble_down((*flux_down)[level1], info2.matrix(0,true).matrix, info2.indices, info1.indices, level1);
}
}
}
else
for (unsigned int k=0; k<info1.n_matrices(); ++k)
{
const unsigned int row = info1.matrix(k,false).row;
const unsigned int column = info1.matrix(k,false).column;
if (level1 == level2)
{
if (mg_constrained_dofs == 0)
{
assemble((*matrix)[level1], info1.matrix(k,false).matrix, info1.indices_by_block[row], info1.indices_by_block[column]);
assemble((*matrix)[level1], info1.matrix(k,true).matrix, info1.indices_by_block[row], info2.indices_by_block[column]);
assemble((*matrix)[level1], info2.matrix(k,false).matrix, info2.indices_by_block[row], info2.indices_by_block[column]);
assemble((*matrix)[level1], info2.matrix(k,true).matrix, info2.indices_by_block[row], info1.indices_by_block[column]);
}
else
{
assemble((*matrix)[level1], info1.matrix(k,false).matrix, info1.indices_by_block[row], info1.indices_by_block[column], level1);
assemble((*matrix)[level1], info1.matrix(k,true).matrix, info1.indices_by_block[row], info2.indices_by_block[column], level1);
assemble((*matrix)[level1], info2.matrix(k,false).matrix, info2.indices_by_block[row], info2.indices_by_block[column], level1);
assemble((*matrix)[level1], info2.matrix(k,true).matrix, info2.indices_by_block[row], info1.indices_by_block[column], level1);
}
}
else
{
Assert(level1 > level2, ExcInternalError());
// Do not add info2.M1,
// which is done by
// the coarser cell
assemble((*matrix)[level1], info1.matrix(k,false).matrix, info1.indices_by_block[row], info1.indices_by_block[column]);
if (level1>0)
{
assemble_up((*flux_up)[level1],info1.matrix(k,true).matrix, info2.indices_by_block[row], info1.indices_by_block[column], level1);
assemble_down((*flux_down)[level1], info2.matrix(k,true).matrix, info2.indices_by_block[row], info1.indices_by_block[column], level1);
}
}
}
}
//----------------------------------------------------------------------//
template <class MATRIX, class VECTOR>
SystemSimple<MATRIX,VECTOR>::SystemSimple(double t)
:
MatrixSimple<MATRIX>(t)
{}
template <class MATRIX, class VECTOR>
inline void
SystemSimple<MATRIX,VECTOR>::initialize(MATRIX &m, VECTOR &rhs)
{
NamedData<VECTOR *> data;
VECTOR *p = &rhs;
data.add(p, "right hand side");
MatrixSimple<MATRIX>::initialize(m);
ResidualSimple<VECTOR>::initialize(data);
}
template <class MATRIX, class VECTOR>
inline void
SystemSimple<MATRIX,VECTOR>::initialize(const ConstraintMatrix &c)
{
MatrixSimple<MATRIX>::initialize(c);
ResidualSimple<VECTOR>::initialize(c);
}
template <class MATRIX, class VECTOR>
template <class DOFINFO>
inline void
SystemSimple<MATRIX,VECTOR>::initialize_info(DOFINFO &info,
bool face) const
{
MatrixSimple<MATRIX>::initialize_info(info, face);
ResidualSimple<VECTOR>::initialize_info(info, face);
}
template <class MATRIX, class VECTOR>
template <class DOFINFO>
inline void
SystemSimple<MATRIX,VECTOR>::assemble(const DOFINFO &info)
{
MatrixSimple<MATRIX>::assemble(info);
ResidualSimple<VECTOR>::assemble(info);
}
template <class MATRIX, class VECTOR>
template <class DOFINFO>
inline void
SystemSimple<MATRIX,VECTOR>::assemble(const DOFINFO &info1,
const DOFINFO &info2)
{
MatrixSimple<MATRIX>::assemble(info1, info2);
ResidualSimple<VECTOR>::assemble(info1, info2);
}
}
}
DEAL_II_NAMESPACE_CLOSE
#endif
|