/usr/include/getfem/getfem_assembling.h is in libgetfem++-dev 4.2.1~beta1~svn4482~dfsg-2build1.
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 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 | /* -*- c++ -*- (enables emacs c++ mode) */
/*===========================================================================
Copyright (C) 2000-2012 Yves Renard, Julien Pommier
This file is a part of GETFEM++
Getfem++ is free software; you can 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 3 of the License, or
(at your option) any later version along with the GCC Runtime Library
Exception either version 3.1 or (at your option) any later version.
This program is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public
License and GCC Runtime Library Exception for more details.
You should have received a copy of the GNU Lesser General Public License
along with this program; if not, write to the Free Software Foundation,
Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA.
As a special exception, you may use this file as it is a part of a free
software library without restriction. Specifically, if other files
instantiate templates or use macros or inline functions from this file,
or you compile this file and link it with other files to produce an
executable, this file does not by itself cause the resulting executable
to be covered by the GNU Lesser General Public License. This exception
does not however invalidate any other reasons why the executable file
might be covered by the GNU Lesser General Public License.
===========================================================================*/
/** @file getfem_assembling.h
@author Yves Renard <Yves.Renard@insa-lyon.fr>
@author Julien Pommier <Julien.Pommier@insa-toulouse.fr>
@date November 17, 2000.
@brief Miscelleanous assembly routines for common PDEs.
*/
/** @defgroup asm Assembly routines */
#ifndef GETFEM_ASSEMBLING_H__
#define GETFEM_ASSEMBLING_H__
#include "getfem_assembling_tensors.h"
namespace getfem {
template <typename VEC>
scalar_type asm_mean_value(const mesh_im &mim, const mesh_fem &mf,
const VEC &U,
mesh_region rg = mesh_region::all_convexes()) {
// for parallelized getfem, work only on the mesh subset
// assigned to the current thread
mim.linked_mesh().intersect_with_mpi_region(rg);
generic_assembly assem;
std::vector<scalar_type> v(1), w(1);
GMM_ASSERT1(mf.get_qdim() == 1, "expecting qdim=1");
assem.set("u=data(#1); V$1()+=comp(); V$2()+=comp(Base(#1))(i).u(i);");
assem.push_mi(mim);
assem.push_mf(mf);
assem.push_data(U);
assem.push_vec(v);
assem.push_vec(w);
assem.assembly(rg);
v.push_back(w[0]);
w.resize(2);
MPI_SUM_VECTOR(v, w);
return w[1]/w[0];
}
/**
compute @f$ \|U\|_2 @f$, U might be real or complex
@ingroup asm
*/
template<typename VEC>
scalar_type asm_L2_norm(const mesh_im &mim, const mesh_fem &mf, const VEC &U,
const mesh_region &rg=mesh_region::all_convexes()) {
return
sqrt(asm_L2_norm_sqr(mim, mf, U, rg,
typename gmm::linalg_traits<VEC>::value_type()));
}
template<typename VEC, typename T>
scalar_type asm_L2_norm_sqr(const mesh_im &mim, const mesh_fem &mf,
const VEC &U, const mesh_region &rg_, T) {
mesh_region rg(rg_);
mim.linked_mesh().intersect_with_mpi_region(rg);
generic_assembly assem;
if (mf.get_qdim() == 1)
assem.set("u=data(#1); V()+=u(i).u(j).comp(Base(#1).Base(#1))(i,j)");
else
assem.set("u=data(#1);"
"V()+=u(i).u(j).comp(vBase(#1).vBase(#1))(i,k,j,k)");
assem.push_mi(mim);
assem.push_mf(mf);
assem.push_data(U);
std::vector<scalar_type> v(1);
assem.push_vec(v);
assem.assembly(rg);
return MPI_SUM_SCALAR(v[0]);
}
template<typename VEC, typename T>
scalar_type asm_L2_norm_sqr(const mesh_im &mim, const mesh_fem &mf,
const VEC &U,
const mesh_region &rg, std::complex<T>) {
return asm_L2_norm_sqr(mim, mf,gmm::real_part(U),rg,T()) +
asm_L2_norm_sqr(mim, mf,gmm::imag_part(U),rg,T());
}
/**
Compute the distance between U1 and U2, defined on two different
mesh_fems (but sharing the same mesh), without interpolating U1 on mf2.
@ingroup asm
*/
template<typename VEC1, typename VEC2>
scalar_type asm_L2_dist(const mesh_im &mim,
const mesh_fem &mf1, const VEC1 &U1,
const mesh_fem &mf2, const VEC2 &U2,
mesh_region rg = mesh_region::all_convexes()) {
mim.linked_mesh().intersect_with_mpi_region(rg);
generic_assembly assem;
if (mf1.get_qdim() == 1)
assem.set("u1=data$1(#1); u2=data$2(#2); "
"V()+=u1(i).u1(j).comp(Base(#1).Base(#1))(i,j)"
"+ u2(i).u2(j).comp(Base(#2).Base(#2))(i,j)"
"- 2*u1(i).u2(j).comp(Base(#1).Base(#2))(i,j)");
else
assem.set("u1=data$1(#1); u2=data$2(#2); "
"V()+=u1(i).u1(j).comp(vBase(#1).vBase(#1))(i,k,j,k)"
"+ u2(i).u2(j).comp(vBase(#2).vBase(#2))(i,k,j,k)"
"- 2*u1(i).u2(j).comp(vBase(#1).vBase(#2))(i,k,j,k)");
assem.push_mi(mim);
assem.push_mf(mf1);
assem.push_mf(mf2);
assem.push_data(U1);
assem.push_data(U2);
std::vector<scalar_type> v(1);
assem.push_vec(v);
assem.assembly(rg);
return sqrt(MPI_SUM_SCALAR(v[0]));
}
/**
compute @f$\|\nabla U\|_2@f$, U might be real or complex
@ingroup asm
*/
template<typename VEC>
scalar_type asm_H1_semi_norm
(const mesh_im &mim, const mesh_fem &mf, const VEC &U,
const mesh_region &rg = mesh_region::all_convexes()) {
typedef typename gmm::linalg_traits<VEC>::value_type T;
return sqrt(asm_H1_semi_norm_sqr(mim, mf, U, rg, T()));
}
template<typename VEC, typename T>
scalar_type asm_H1_semi_norm_sqr(const mesh_im &mim, const mesh_fem &mf,
const VEC &U, const mesh_region &rg_, T) {
mesh_region rg(rg_);
mim.linked_mesh().intersect_with_mpi_region(rg);
generic_assembly assem;
if (mf.get_qdim() == 1)
assem.set("u=data(#1); V()+=u(i).u(j).comp(Grad(#1).Grad(#1))(i,d,j,d)");
else
assem.set("u=data(#1);"
"V()+=u(i).u(j).comp(vGrad(#1).vGrad(#1))(i,k,d,j,k,d)");
assem.push_mi(mim);
assem.push_mf(mf);
assem.push_data(U);
std::vector<scalar_type> v(1);
assem.push_vec(v);
assem.assembly(rg);
return MPI_SUM_SCALAR(v[0]);
}
template<typename VEC, typename T>
scalar_type asm_H1_semi_norm_sqr(const mesh_im &mim, const mesh_fem &mf,
const VEC &U,
const mesh_region &rg, std::complex<T>) {
return asm_H1_semi_norm_sqr(mim, mf, gmm::real_part(U), rg, T()) +
asm_H1_semi_norm_sqr(mim, mf, gmm::imag_part(U), rg, T());
}
template<typename VEC1, typename VEC2>
scalar_type asm_H1_semi_dist(const mesh_im &mim,
const mesh_fem &mf1, const VEC1 &U1,
const mesh_fem &mf2, const VEC2 &U2,
mesh_region rg = mesh_region::all_convexes()) {
mim.linked_mesh().intersect_with_mpi_region(rg);
generic_assembly assem;
if (mf1.get_qdim() == 1)
assem.set("u1=data$1(#1); u2=data$2(#2); "
"V()+=u1(i).u1(j).comp(Grad(#1).Grad(#1))(i,d,j,d)"
"+ u2(i).u2(j).comp(Grad(#2).Grad(#2))(i,d,j,d)"
"- 2*u1(i).u2(j).comp(Grad(#1).Grad(#2))(i,d,j,d)");
else
assem.set("u1=data$1(#1); u2=data$2(#2); "
"V()+=u1(i).u1(j).comp(vGrad(#1).vGrad(#1))(i,k,d,j,k,d)"
"+ u2(i).u2(j).comp(vGrad(#2).vGrad(#2))(i,k,d,j,k,d)"
"- 2*u1(i).u2(j).comp(vGrad(#1).vGrad(#2))(i,k,d,j,k,d)");
assem.push_mi(mim);
assem.push_mf(mf1);
assem.push_mf(mf2);
assem.push_data(U1);
assem.push_data(U2);
std::vector<scalar_type> v(1);
assem.push_vec(v);
assem.assembly(rg);
return sqrt(MPI_SUM_SCALAR(v[0]));
}
/**
compute the H1 norm of U.
@ingroup asm
*/
template<typename VEC>
scalar_type asm_H1_norm(const mesh_im &mim, const mesh_fem &mf,
const VEC &U,
const mesh_region &rg
= mesh_region::all_convexes()) {
typedef typename gmm::linalg_traits<VEC>::value_type T;
return sqrt(asm_L2_norm_sqr(mim, mf, U, rg, T()) +
asm_H1_semi_norm_sqr(mim, mf, U, rg, T()));
}
/**
Compute the H1 distance between U1 and U2
@ingroup asm
*/
template<typename VEC1, typename VEC2>
scalar_type asm_H1_dist(const mesh_im &mim,
const mesh_fem &mf1, const VEC1 &U1,
const mesh_fem &mf2, const VEC2 &U2,
const mesh_region &rg
= mesh_region::all_convexes()) {
return sqrt(gmm::sqr(asm_L2_dist(mim,mf1,U1,mf2,U2,rg)) +
gmm::sqr(asm_H1_semi_dist(mim,mf1,U1,mf2,U2,rg)));
}
template<typename VEC, typename T>
scalar_type asm_H2_semi_norm_sqr(const mesh_im &mim, const mesh_fem &mf,
const VEC &U, const mesh_region &rg_, T) {
mesh_region rg(rg_);
mim.linked_mesh().intersect_with_mpi_region(rg);
generic_assembly assem;
if (mf.get_qdim() == 1)
assem.set("u=data(#1);"
"V()+=u(i).u(j).comp(Hess(#1).Hess(#1))(i,d,e,j,d,e)");
else
assem.set("u=data(#1);"
"V()+=u(i).u(j).comp(vHess(#1).vHess(#1))(i,k,d,e,j,k,d,e)");
assem.push_mi(mim);
assem.push_mf(mf);
assem.push_data(U);
std::vector<scalar_type> v(1);
assem.push_vec(v);
assem.assembly(rg);
return MPI_SUM_SCALAR(v[0]);
}
template<typename VEC, typename T>
scalar_type asm_H2_semi_norm_sqr(const mesh_im &mim, const mesh_fem &mf,
const VEC &U,
const mesh_region &rg, std::complex<T>) {
return asm_H2_semi_norm_sqr(mim, mf, gmm::real_part(U), rg, T()) +
asm_H2_semi_norm_sqr(mim, mf, gmm::imag_part(U), rg, T());
}
template<typename VEC1, typename VEC2>
scalar_type asm_H2_semi_dist(const mesh_im &mim,
const mesh_fem &mf1, const VEC1 &U1,
const mesh_fem &mf2, const VEC2 &U2,
mesh_region rg = mesh_region::all_convexes()) {
mim.linked_mesh().intersect_with_mpi_region(rg);
generic_assembly assem;
if (mf1.get_qdim() == 1)
assem.set("u1=data$1(#1); u2=data$2(#2); "
"V()+=u1(i).u1(j).comp(Hess(#1).Hess(#1))(i,d,e,j,d,e)"
"+ u2(i).u2(j).comp(Hess(#2).Hess(#2))(i,d,e,j,d,e)"
"- 2*u1(i).u2(j).comp(Hess(#1).Hess(#2))(i,d,e,j,d,e)");
else
assem.set("u1=data$1(#1); u2=data$2(#2); "
"V()+=u1(i).u1(j).comp(vHess(#1).vHess(#1))(i,k,d,e,j,k,d,e)"
"+ u2(i).u2(j).comp(vHess(#2).vHess(#2))(i,k,d,e,j,k,d,e)"
"- 2*u1(i).u2(j).comp(vHess(#1).vHess(#2))(i,k,d,e,j,k,d,e)");
assem.push_mi(mim);
assem.push_mf(mf1);
assem.push_mf(mf2);
assem.push_data(U1);
assem.push_data(U2);
std::vector<scalar_type> v(1);
assem.push_vec(v);
assem.assembly(rg);
return sqrt(MPI_SUM_SCALAR(v[0]));
}
/**
compute @f$\|Hess U\|_2@f$, U might be real or complex. For C^1 elements
@ingroup asm
*/
template<typename VEC>
scalar_type asm_H2_semi_norm(const mesh_im &mim, const mesh_fem &mf,
const VEC &U,
const mesh_region &rg
= mesh_region::all_convexes()) {
typedef typename gmm::linalg_traits<VEC>::value_type T;
return sqrt(asm_H2_semi_norm_sqr(mim, mf, U, rg, T()));
}
/**
compute the H2 norm of U (for C^1 elements).
@ingroup asm
*/
template<typename VEC>
scalar_type asm_H2_norm(const mesh_im &mim, const mesh_fem &mf,
const VEC &U,
const mesh_region &rg
= mesh_region::all_convexes()) {
typedef typename gmm::linalg_traits<VEC>::value_type T;
return sqrt(asm_L2_norm_sqr(mim, mf, U, rg, T())
+ asm_H1_semi_norm_sqr(mim, mf, U, rg, T())
+ asm_H2_semi_norm_sqr(mim, mf, U, rg, T()));
}
/**
Compute the H2 distance between U1 and U2
@ingroup asm
*/
template<typename VEC1, typename VEC2>
scalar_type asm_H2_dist(const mesh_im &mim,
const mesh_fem &mf1, const VEC1 &U1,
const mesh_fem &mf2, const VEC2 &U2,
const mesh_region &rg
= mesh_region::all_convexes()) {
return sqrt(gmm::sqr(asm_L2_dist(mim,mf1,U1,mf2,U2,rg)) +
gmm::sqr(asm_H1_semi_dist(mim,mf1,U1,mf2,U2,rg)) +
gmm::sqr(asm_H2_semi_dist(mim,mf1,U1,mf2,U2,rg)));
}
/*
assembly of a matrix with 1 parameter (real or complex)
(the most common here for the assembly routines below)
*/
template <typename MAT, typename VECT>
void asm_real_or_complex_1_param
(MAT &M, const mesh_im &mim, const mesh_fem &mf_u, const mesh_fem &mf_data,
const VECT &A, const mesh_region &rg, const char *assembly_description,
const mesh_fem *mf_mult = 0) {
asm_real_or_complex_1_param_
(M, mim, mf_u, mf_data, A, rg, assembly_description, mf_mult,
typename gmm::linalg_traits<VECT>::value_type());
}
/* real version */
template<typename MAT, typename VECT, typename T>
void asm_real_or_complex_1_param_
(const MAT &M, const mesh_im &mim, const mesh_fem &mf_u,
const mesh_fem &mf_data, const VECT &A, const mesh_region &rg,
const char *assembly_description, const mesh_fem *mf_mult, T) {
generic_assembly assem(assembly_description);
assem.push_mi(mim);
assem.push_mf(mf_u);
assem.push_mf(mf_data);
if (mf_mult) assem.push_mf(*mf_mult);
assem.push_data(A);
assem.push_mat_or_vec(const_cast<MAT&>(M));
assem.assembly(rg);
}
/* complex version */
template<typename MAT, typename VECT, typename T>
void asm_real_or_complex_1_param_
(MAT &M, const mesh_im &mim, const mesh_fem &mf_u, const mesh_fem &mf_data,
const VECT &A, const mesh_region &rg,const char *assembly_description,
const mesh_fem *mf_mult, std::complex<T>) {
asm_real_or_complex_1_param_(gmm::real_part(M),mim,mf_u,mf_data,
gmm::real_part(A),rg,
assembly_description, mf_mult, T());
asm_real_or_complex_1_param_(gmm::imag_part(M),mim,mf_u,mf_data,
gmm::imag_part(A),rg,
assembly_description, mf_mult, T());
}
/**
generic mass matrix assembly (on the whole mesh or on the specified
convex set or boundary)
@ingroup asm
*/
template<typename MAT>
void asm_mass_matrix(const MAT &M, const mesh_im &mim,
const mesh_fem &mf_u1,
const mesh_region &rg = mesh_region::all_convexes()) {
generic_assembly assem;
if (mf_u1.get_qdim() == 1)
assem.set("M(#1,#1)+=sym(comp(Base(#1).Base(#1)))");
else
assem.set("M(#1,#1)+=sym(comp(vBase(#1).vBase(#1))(:,i,:,i));");
assem.push_mi(mim);
assem.push_mf(mf_u1);
assem.push_mat(const_cast<MAT &>(M));
assem.assembly(rg);
}
/**
* generic mass matrix assembly (on the whole mesh or on the specified
* boundary)
*/
template<typename MAT>
void asm_mass_matrix(const MAT &M, const mesh_im &mim, const mesh_fem &mf_u1,
const mesh_fem &mf_u2,
const mesh_region &rg = mesh_region::all_convexes()) {
generic_assembly assem;
if (mf_u1.get_qdim() == 1 && mf_u2.get_qdim() == 1)
assem.set("M(#1,#2)+=comp(Base(#1).Base(#2))");
else if (mf_u1.get_qdim() == 1)
assem.set("M(#1,#2)+=comp(Base(#1).vBase(#2))(:,:,1);"); // could be i in place of 1
else if (mf_u2.get_qdim() == 1)
assem.set("M(#1,#2)+=comp(vBase(#1).Base(#2))(:,1,:);");
else
assem.set("M(#1,#2)+=comp(vBase(#1).vBase(#2))(:,i,:,i);");
assem.push_mi(mim);
assem.push_mf(mf_u1);
assem.push_mf(mf_u2);
assem.push_mat(const_cast<MAT &>(M));
assem.assembly(rg);
}
/**
generic mass matrix assembly with an additional parameter
(on the whole mesh or on the specified boundary)
@ingroup asm
*/
template<typename MAT, typename VECT>
void asm_mass_matrix_param
(MAT &M, const mesh_im &mim, const mesh_fem &mf_u, const mesh_fem &mf_data,
const VECT &F, const mesh_region &rg = mesh_region::all_convexes()) {
asm_real_or_complex_1_param
(M, mim, mf_u, mf_data, F, rg, (mf_u.get_qdim() == 1) ?
"F=data(#2);"
"M(#1,#1)+=sym(comp(Base(#1).Base(#1).Base(#2))(:,:,i).F(i))"
: "F=data(#2);"
"M(#1,#1)+=sym(comp(vBase(#1).vBase(#1).Base(#2))(:,i,:,i,j).F(j));");
}
/**
generic mass matrix assembly with an additional parameter
(on the whole mesh or on the specified boundary)
@ingroup asm
*/
template<typename MAT, typename VECT>
void asm_mass_matrix_param
(MAT &M, const mesh_im &mim, const mesh_fem &mf_u1, const mesh_fem &mf_u2,
const mesh_fem &mf_data, const VECT &F,
const mesh_region &rg = mesh_region::all_convexes()) {
generic_assembly assem;
if (mf_u1.get_qdim() == 1 && mf_u2.get_qdim() == 1)
assem.set("F=data(#3);M(#1,#2)+=comp(Base(#1).Base(#2).Base(#3))(:,:,i).F(i)");
else
assem.set("F=data(#3);M(#1,#2)+=comp(vBase(#1).vBase(#2).Base(#3))(:,i,:,i,j).F(j);");
assem.push_mi(mim);
assem.push_mf(mf_u1);
assem.push_mf(mf_u2);
assem.push_mf(mf_data);
assem.push_mat(const_cast<MAT &>(M));
assem.push_data(F);
assem.assembly(rg);
}
/**
source term (for both volumic sources and boundary (Neumann) sources).
@ingroup asm
*/
template<typename VECT1, typename VECT2>
void asm_source_term(const VECT1 &B, const mesh_im &mim, const mesh_fem &mf,
const mesh_fem &mf_data, const VECT2 &F,
const mesh_region &rg = mesh_region::all_convexes()) {
GMM_ASSERT1(mf_data.get_qdim() == 1 ||
mf_data.get_qdim() == mf.get_qdim(),
"invalid data mesh fem (same Qdim or Qdim=1 required)");
const char *st;
if (mf.get_qdim() == 1)
st = "F=data(#2); V(#1)+=comp(Base(#1).Base(#2))(:,j).F(j);";
else if (mf_data.get_qdim() == 1)
st = "F=data(qdim(#1),#2);"
"V(#1)+=comp(vBase(#1).Base(#2))(:,i,j).F(i,j);";
else
st = "F=data(#2);"
"V(#1)+=comp(vBase(#1).vBase(#2))(:,i,j,i).F(j);";
asm_real_or_complex_1_param(const_cast<VECT1 &>(B),mim,mf,mf_data,F,rg,st);
}
/**
source term (for both volumic sources and boundary (Neumann) sources).
For an homogeneous term.
@ingroup asm
*/
template<typename VECT1, typename VECT2>
void asm_homogeneous_source_term(const VECT1 &B, const mesh_im &mim,
const mesh_fem &mf, const VECT2 &F,
const mesh_region &rg = mesh_region::all_convexes()) {
const char *st;
if (mf.get_qdim() == 1)
st = "F=data(1); V(#1)+=comp(Base(#1))(:).F(i);";
else
st = "F=data(qdim(#1)); V(#1)+=comp(vBase(#1))(:,i).F(i);";
asm_real_or_complex_1_param(const_cast<VECT1 &>(B),mim,mf,mf,F,rg,st);
}
/**
Normal source term (for boundary (Neumann) condition).
@ingroup asm
*/
template<typename VECT1, typename VECT2>
void asm_normal_source_term(VECT1 &B, const mesh_im &mim,
const mesh_fem &mf,
const mesh_fem &mf_data, const VECT2 &F,
const mesh_region &rg) {
GMM_ASSERT1(mf_data.get_qdim() == 1 ||
mf_data.get_qdim() == mf.get_qdim(),
"invalid data mesh_fem (same Qdim or Qdim=1 required)");
const char *st;
if (mf.get_qdim() == 1)
st = "F=data(mdim(#1),#2);"
"V(#1)+=comp(Base(#1).Base(#2).Normal())(:,j,k).F(k,j);";
else if (mf_data.get_qdim() == 1)
st = "F=data(qdim(#1),mdim(#1),#2);"
"V(#1)+=comp(vBase(#1).Base(#2).Normal())(:,i,j,k).F(i,k,j);";
else
st = "F=data(mdim(#1),#2);"
"V(#1)+=comp(vBase(#1).vBase(#2).Normal())(:,i,j,i,k).F(k,j);";
asm_real_or_complex_1_param(B, mim, mf, mf_data, F, rg, st);
}
/**
Homogeneous normal source term (for boundary (Neumann) condition).
@ingroup asm
*/
template<typename VECT1, typename VECT2>
void asm_homogeneous_normal_source_term(VECT1 &B, const mesh_im &mim,
const mesh_fem &mf,
const VECT2 &F,
const mesh_region &rg) {
const char *st;
if (mf.get_qdim() == 1)
st = "F=data(mdim(#1));"
"V(#1)+=comp(Base(#1).Normal())(:,k).F(k);";
else
st = "F=data(qdim(#1),mdim(#1));"
"V(#1)+=comp(vBase(#1).Normal())(:,i,j).F(i,j);";
asm_real_or_complex_1_param(B, mim, mf, mf, F, rg, st);
}
template <typename V> bool is_Q_symmetric(const V& Q, size_type q,
size_type nbd) {
/* detect the symmetricity of Q (in that case the symmetricity of
* the final matrix will be ensured, and computations will be
* slightly speed up */
for (size_type k=0; k < nbd; ++k)
for (size_type i=1; i < q; ++i)
for (size_type j=0; j < i; ++j)
if (Q[k*q*q+i*q+j] != Q[k*q*q+j*q+i])
return false;
return true;
}
/**
assembly of @f$\int{qu.v}@f$
(if @f$u@f$ is a vector field of size @f$N@f$, @f$q@f$ is a square
matrix @f$N\times N@f$ used by assem_general_boundary_conditions
convention: Q is of the form
Q1_11 Q2_11 ..... Qn_11
Q1_21 Q2_21 ..... Qn_21
Q1_12 Q2_12 ..... Qn_12
Q1_22 Q2_22 ..... Qn_22
if N = 2, and mf_d has n/N degree of freedom
Q is a vector, so the matrix is assumed to be stored by columns
(fortran style)
Works for both volumic assembly and boundary assembly
@ingroup asm
*/
template<typename MAT, typename VECT>
void asm_qu_term(MAT &M, const mesh_im &mim, const mesh_fem &mf_u,
const mesh_fem &mf_d, const VECT &Q,
const mesh_region &rg) {
generic_assembly assem;
GMM_ASSERT1(mf_d.get_qdim() == 1,
"invalid data mesh fem (Qdim=1 required)");
const char *asm_str = "";
if (mf_u.get_qdim() == 1)
asm_str = "Q=data$1(#2);"
"M(#1,#1)+=comp(Base(#1).Base(#1).Base(#2))(:,:,k).Q(k);";
else
if (is_Q_symmetric(Q,mf_u.get_qdim(),mf_d.nb_dof()))
asm_str = "Q=data$1(qdim(#1),qdim(#1),#2);"
"M(#1,#1)+=sym(comp(vBase(#1).vBase(#1).Base(#2))"
"(:,i,:,j,k).Q(i,j,k));";
else
asm_str = "Q=data$1(qdim(#1),qdim(#1),#2);"
"M(#1,#1)+=comp(vBase(#1).vBase(#1).Base(#2))"
"(:,i,:,j,k).Q(i,j,k);";
asm_real_or_complex_1_param(M, mim, mf_u, mf_d, Q, rg, asm_str);
}
template<typename MAT, typename VECT>
void asm_homogeneous_qu_term(MAT &M, const mesh_im &mim,
const mesh_fem &mf_u, const VECT &Q,
const mesh_region &rg) {
generic_assembly assem;
const char *asm_str = "";
if (mf_u.get_qdim() == 1)
asm_str = "Q=data$1(1);"
"M(#1,#1)+=comp(Base(#1).Base(#1))(:,:).Q(i);";
else
if (is_Q_symmetric(Q,mf_u.get_qdim(),1))
asm_str = "Q=data$1(qdim(#1),qdim(#1));"
"M(#1,#1)+=sym(comp(vBase(#1).vBase(#1))"
"(:,i,:,j).Q(i,j));";
else
asm_str = "Q=data$1(qdim(#1),qdim(#1));"
"M(#1,#1)+=comp(vBase(#1).vBase(#1))"
"(:,i,:,j).Q(i,j);";
asm_real_or_complex_1_param(M, mim, mf_u, mf_u, Q, rg, asm_str);
}
/**
Stiffness matrix for linear elasticity, with Lamé coefficients
@ingroup asm
*/
template<class MAT, class VECT>
void asm_stiffness_matrix_for_linear_elasticity
(const MAT &RM_, const mesh_im &mim, const mesh_fem &mf,
const mesh_fem &mf_data, const VECT &LAMBDA, const VECT &MU,
const mesh_region &rg = mesh_region::all_convexes()) {
MAT &RM = const_cast<MAT &>(RM_);
GMM_ASSERT1(mf_data.get_qdim() == 1,
"invalid data mesh fem (Qdim=1 required)");
GMM_ASSERT1(mf.get_qdim() == mf.linked_mesh().dim(),
"wrong qdim for the mesh_fem");
/* e = strain tensor,
M = 2*mu*e(u):e(v) + lambda*tr(e(u))*tr(e(v))
*/
generic_assembly assem("lambda=data$1(#2); mu=data$2(#2);"
"t=comp(vGrad(#1).vGrad(#1).Base(#2));"
//"e=(t{:,2,3,:,5,6,:}+t{:,3,2,:,5,6,:}"
//"+t{:,2,3,:,6,5,:}+t{:,3,2,:,6,5,:})/4;"
//"e=(t{:,2,3,:,5,6,:}+t{:,3,2,:,5,6,:})*0.5;"
/*"M(#1,#1)+= sym(2*e(:,i,j,:,i,j,k).mu(k)"
" + e(:,i,i,:,j,j,k).lambda(k))");*/
"M(#1,#1)+= sym(t(:,i,j,:,i,j,k).mu(k)"
"+ t(:,j,i,:,i,j,k).mu(k)"
"+ t(:,i,i,:,j,j,k).lambda(k))");
assem.push_mi(mim);
assem.push_mf(mf);
assem.push_mf(mf_data);
assem.push_data(LAMBDA);
assem.push_data(MU);
assem.push_mat(RM);
assem.assembly(rg);
}
/**
Stiffness matrix for linear elasticity, with constant Lamé coefficients
@ingroup asm
*/
template<class MAT, class VECT>
void asm_stiffness_matrix_for_homogeneous_linear_elasticity
(const MAT &RM_, const mesh_im &mim, const mesh_fem &mf,
const VECT &LAMBDA, const VECT &MU,
const mesh_region &rg = mesh_region::all_convexes()) {
MAT &RM = const_cast<MAT &>(RM_);
GMM_ASSERT1(mf.get_qdim() == mf.linked_mesh().dim(),
"wrong qdim for the mesh_fem");
generic_assembly assem("lambda=data$1(1); mu=data$2(1);"
"t=comp(vGrad(#1).vGrad(#1));"
"M(#1,#1)+= sym(t(:,i,j,:,i,j).mu(1)"
"+ t(:,j,i,:,i,j).mu(1)"
"+ t(:,i,i,:,j,j).lambda(1))");
assem.push_mi(mim);
assem.push_mf(mf);
assem.push_data(LAMBDA);
assem.push_data(MU);
assem.push_mat(RM);
assem.assembly(rg);
}
/**
Stiffness matrix for linear elasticity, with a general Hooke
tensor. This is more a demonstration of generic assembly than
something useful !
Note that this function is just an alias for
asm_stiffness_matrix_for_vector_elliptic.
@ingroup asm
*/
template<typename MAT, typename VECT> void
asm_stiffness_matrix_for_linear_elasticity_Hooke
(MAT &RM, const mesh_im &mim, const mesh_fem &mf, const mesh_fem &mf_data,
const VECT &H, const mesh_region &rg = mesh_region::all_convexes()) {
asm_stiffness_matrix_for_vector_elliptic(RM, mim, mf, mf_data, H, rg);
}
/** two-in-one assembly of stokes equation:
linear elasticty part and p.div(v) term are assembled at the
same time.
@ingroup asm
*/
template<typename MAT, typename VECT>
void asm_stokes(MAT &K, MAT &BT,
const mesh_im &mim,
const mesh_fem &mf_u, const mesh_fem &mf_p,
const mesh_fem &mf_d, const VECT &viscos,
const mesh_region &rg = mesh_region::all_convexes()) {
GMM_ASSERT1(mf_d.get_qdim() == 1,
"invalid data mesh fem (Qdim=1 required)");
generic_assembly assem("visc=data$1(#3); "
"t=comp(vGrad(#1).vGrad(#1).Base(#3));"
"e=(t{:,2,3,:,5,6,:}+t{:,3,2,:,5,6,:}"
" +t{:,2,3,:,6,5,:}+t{:,3,2,:,6,5,:})/4;"
// visc*D(u):D(v)
"M$1(#1,#1)+=sym(e(:,i,j,:,i,j,k).visc(k));"
// p.div v
"M$2(#1,#2)+=comp(vGrad(#1).Base(#2))(:,i,i,:);");
assem.push_mi(mim);
assem.push_mf(mf_u);
assem.push_mf(mf_p);
assem.push_mf(mf_d);
assem.push_data(viscos);
assem.push_mat(K);
assem.push_mat(BT);
assem.assembly(rg);
}
/**
Build the mixed pressure term @f$ B = - \int p.div u @f$
@ingroup asm
*/
template<typename MAT>
void asm_stokes_B(MAT &B, const mesh_im &mim, const mesh_fem &mf_u,
const mesh_fem &mf_p,
const mesh_region &rg = mesh_region::all_convexes()) {
GMM_ASSERT1(mf_p.get_qdim() == 1,
"invalid data mesh fem (Qdim=1 required)");
//generic_assembly assem("M$1(#1,#2)+=comp(vGrad(#1).Base(#2))(:,i,i,:);");
generic_assembly assem("M$1(#1,#2)+=-comp(Base(#1).vGrad(#2))(:,:,i,i);");
assem.push_mi(mim);
assem.push_mf(mf_p);
assem.push_mf(mf_u);
assem.push_mat(B);
assem.assembly(rg);
}
/**
assembly of @f$\int_\Omega \nabla u.\nabla v@f$.
@ingroup asm
*/
template<typename MAT>
void asm_stiffness_matrix_for_homogeneous_laplacian
(const MAT &M_, const mesh_im &mim, const mesh_fem &mf,
const mesh_region &rg = mesh_region::all_convexes()) {
MAT &M = const_cast<MAT &>(M_);
generic_assembly
assem("M$1(#1,#1)+=sym(comp(Grad(#1).Grad(#1))(:,i,:,i))");
assem.push_mi(mim);
assem.push_mf(mf);
assem.push_mat(M);
assem.assembly(rg);
}
/**
assembly of @f$\int_\Omega \nabla u.\nabla v@f$.
@ingroup asm
*/
template<typename MAT>
void asm_stiffness_matrix_for_homogeneous_laplacian_componentwise
(const MAT &M_, const mesh_im &mim, const mesh_fem &mf,
const mesh_region &rg = mesh_region::all_convexes()) {
MAT &M = const_cast<MAT &>(M_);
generic_assembly
assem("M$1(#1,#1)+="
"sym(comp(vGrad(#1).vGrad(#1))(:,k,i,:,k,i))");
assem.push_mi(mim);
assem.push_mf(mf);
assem.push_mat(M);
assem.assembly(rg);
}
/**
assembly of @f$\int_\Omega a(x)\nabla u.\nabla v@f$ , where @f$a(x)@f$
is scalar.
@ingroup asm
*/
template<typename MAT, typename VECT>
void asm_stiffness_matrix_for_laplacian
(MAT &M, const mesh_im &mim, const mesh_fem &mf, const mesh_fem &mf_data,
const VECT &A, const mesh_region &rg = mesh_region::all_convexes()) {
GMM_ASSERT1(mf_data.get_qdim() == 1,
"invalid data mesh fem (Qdim=1 required)");
asm_real_or_complex_1_param
(M, mim, mf, mf_data, A, rg, "a=data$1(#2); M$1(#1,#1)+="
"sym(comp(Grad(#1).Grad(#1).Base(#2))(:,i,:,i,j).a(j))");
}
/** The same as getfem::asm_stiffness_matrix_for_laplacian , but on
each component of mf when mf has a qdim > 1
*/
template<typename MAT, typename VECT>
void asm_stiffness_matrix_for_laplacian_componentwise
(MAT &M, const mesh_im &mim, const mesh_fem &mf, const mesh_fem &mf_data,
const VECT &A, const mesh_region &rg = mesh_region::all_convexes()) {
GMM_ASSERT1(mf_data.get_qdim() == 1,
"invalid data mesh fem (Qdim=1 required)");
asm_real_or_complex_1_param
(M, mim, mf, mf_data, A, rg, "a=data$1(#2); M$1(#1,#1)+="
"sym(comp(vGrad(#1).vGrad(#1).Base(#2))(:,k,i,:,k,i,j).a(j))");
}
/**
assembly of @f$\int_\Omega A(x)\nabla u.\nabla v@f$, where @f$A(x)@f$
is a (symmetric positive definite) NxN matrix.
Arguments:
@param M a sparse matrix of dimensions mf.nb_dof() x mf.nb_dof()
@param mim the mesh_im.
@param mf : the mesh_fem that describes the solution, with
@c mf.get_qdim() == @c N.
@param mf_data the mesh_fem that describes the coefficients of @c A
(@c mf_data.get_qdim() == 1).
@param A a (very large) vector, which is a flattened (n x n x
mf_data.nb_dof()) 3D array. For each dof of mf_data, it contains
the n x n coefficients of @f$A@f$. As usual, the order is the
"fortran-order", i.e. @c A = [A_11(dof1) A_21(dof1) A_31(dof1)
A_12(dof1) A_22(dof1) ... A_33(dof) A_11(dof2)
.... A_33(lastdof)]
@ingroup asm
*/
template<typename MAT, typename VECT>
void asm_stiffness_matrix_for_scalar_elliptic
(MAT &M, const mesh_im &mim, const mesh_fem &mf, const mesh_fem &mf_data,
const VECT &A, const mesh_region &rg = mesh_region::all_convexes()) {
/*GMM_ASSERT1(mf_data.get_qdim() == 1,
"invalid data mesh fem (Qdim=1 required)");*/
asm_real_or_complex_1_param(M,mim,mf,mf_data,A,rg,
"a=data$1(mdim(#1),mdim(#1),#2);"
"M$1(#1,#1)+=comp(Grad(#1).Grad(#1).Base(#2))"
"(:,i,:,j,k).a(j,i,k)");
}
/** The same but with a constant matrix
*/
template<typename MAT, typename VECT>
void asm_stiffness_matrix_for_homogeneous_scalar_elliptic
(MAT &M, const mesh_im &mim, const mesh_fem &mf,
const VECT &A, const mesh_region &rg = mesh_region::all_convexes()) {
/*GMM_ASSERT1(mf_data.get_qdim() == 1,
"invalid data mesh fem (Qdim=1 required)");*/
asm_real_or_complex_1_param(M,mim,mf,mf,A,rg,
"a=data$1(mdim(#1),mdim(#1));"
"M$1(#1,#1)+=comp(Grad(#1).Grad(#1))"
"(:,i,:,j).a(j,i)");
}
/** The same but on each component of mf when mf has a qdim > 1
*/
template<typename MAT, typename VECT>
void asm_stiffness_matrix_for_scalar_elliptic_componentwise
(MAT &M, const mesh_im &mim, const mesh_fem &mf,
const mesh_fem &mf_data, const VECT &A,
const mesh_region &rg = mesh_region::all_convexes()) {
/* GMM_ASSERT1(mf_data.get_qdim() == 1,
"invalid data mesh fem (Qdim=1 required)");*/
asm_real_or_complex_1_param
(M,mim,mf,mf_data,A,rg, "a=data$1(mdim(#1),mdim(#1),#2);"
"M$1(#1,#1)+=comp(vGrad(#1).vGrad(#1).Base(#2))"
"(:,l,i,:,l,j,k).a(j,i,k)");
}
/** The same but with a constant matrix
*/
template<typename MAT, typename VECT>
void asm_stiffness_matrix_for_homogeneous_scalar_elliptic_componentwise
(MAT &M, const mesh_im &mim, const mesh_fem &mf, const VECT &A,
const mesh_region &rg = mesh_region::all_convexes()) {
/* GMM_ASSERT1(mf_data.get_qdim() == 1,
"invalid data mesh fem (Qdim=1 required)");*/
asm_real_or_complex_1_param
(M,mim,mf,mf,A,rg, "a=data$1(mdim(#1),mdim(#1));"
"M$1(#1,#1)+=comp(vGrad(#1).vGrad(#1))"
"(:,l,i,:,l,j).a(j,i)");
}
/**
Assembly of @f$\int_\Omega A(x)\nabla u.\nabla v@f$, where @f$A(x)@f$
is a NxNxNxN (symmetric positive definite) tensor defined on mf_data.
*/
template<typename MAT, typename VECT> void
asm_stiffness_matrix_for_vector_elliptic
(MAT &M, const mesh_im &mim, const mesh_fem &mf, const mesh_fem &mf_data,
const VECT &A, const mesh_region &rg = mesh_region::all_convexes()) {
/* GMM_ASSERT1(mf_data.get_qdim() == 1,
"invalid data mesh fem (Qdim=1 required)");*/
/*
M = a_{i,j,k,l}D_{i,j}(u)D_{k,l}(v)
*/
asm_real_or_complex_1_param
(M,mim,mf,mf_data,A,rg,
"a=data$1(qdim(#1),mdim(#1),qdim(#1),mdim(#1),#2);"
"t=comp(vGrad(#1).vGrad(#1).Base(#2));"
"M(#1,#1)+= t(:,i,j,:,k,l,p).a(i,j,k,l,p)");
}
/**
Assembly of @f$\int_\Omega A(x)\nabla u.\nabla v@f$, where @f$A(x)@f$
is a NxNxNxN (symmetric positive definite) constant tensor.
*/
template<typename MAT, typename VECT> void
asm_stiffness_matrix_for_homogeneous_vector_elliptic
(MAT &M, const mesh_im &mim, const mesh_fem &mf,
const VECT &A, const mesh_region &rg = mesh_region::all_convexes()) {
/*
M = a_{i,j,k,l}D_{i,j}(u)D_{k,l}(v)
*/
asm_real_or_complex_1_param
(M,mim,mf,mf,A,rg,
"a=data$1(qdim(#1),mdim(#1),qdim(#1),mdim(#1));"
"t=comp(vGrad(#1).vGrad(#1));"
"M(#1,#1)+= t(:,i,j,:,k,l).a(i,j,k,l)");
}
/**
assembly of the term @f$\int_\Omega Kuv - \nabla u.\nabla v@f$,
for the helmholtz equation (@f$\Delta u + k^2u = 0@f$, with @f$K=k^2@f$).
The argument K_squared may be a real or a complex-valued vector.
@ingroup asm
*/
template<typename MAT, typename VECT>
void asm_Helmholtz(MAT &M, const mesh_im &mim, const mesh_fem &mf_u,
const mesh_fem &mf_data, const VECT &K_squared,
const mesh_region &rg = mesh_region::all_convexes()) {
asm_Helmholtz(M, mim, mf_u, mf_data, K_squared,rg,
typename gmm::linalg_traits<VECT>::value_type());
}
template<typename MAT, typename VECT, typename T>
void asm_Helmholtz(MAT &M, const mesh_im &mim, const mesh_fem &mf_u,
const mesh_fem &mf_data,
const VECT &K_squared, const mesh_region &rg, T) {
asm_Helmholtz_real(M, mim, mf_u, mf_data, K_squared, rg);
}
template<typename MAT, typename VECT, typename T>
void asm_Helmholtz(MAT &M, const mesh_im &mim, const mesh_fem &mf_u,
const mesh_fem &mf_data, const VECT &K_squared,
const mesh_region &rg, std::complex<T>) {
asm_Helmholtz_cplx(gmm::real_part(M), gmm::imag_part(M), mim, mf_u,
mf_data, gmm::real_part(K_squared),
gmm::imag_part(K_squared), rg);
}
template<typename MATr, typename MATi, typename VECTr, typename VECTi>
void asm_Helmholtz_cplx(const MATr &Mr, const MATi &Mi, const mesh_im &mim,
const mesh_fem &mf_u, const mesh_fem &mf_data,
const VECTr &K_squaredr, const VECTi &K_squaredi,
const mesh_region &rg=mesh_region::all_convexes()) {
generic_assembly assem("Kr=data$1(#2); Ki=data$2(#2);"
"m = comp(Base(#1).Base(#1).Base(#2)); "
"M$1(#1,#1)+=sym(m(:,:,i).Kr(i) - "
"comp(Grad(#1).Grad(#1))(:,i,:,i));"
"M$2(#1,#1)+=sym(m(:,:,i).Ki(i));");
assem.push_mi(mim);
assem.push_mf(mf_u);
assem.push_mf(mf_data);
assem.push_data(K_squaredr); //gmm::real_part(K_squared));
assem.push_data(K_squaredi); //gmm::imag_part(K_squared));
assem.push_mat(const_cast<MATr&>(Mr));
assem.push_mat(const_cast<MATi&>(Mi));
assem.assembly(rg);
}
template<typename MAT, typename VECT>
void asm_Helmholtz_real(const MAT &M, const mesh_im &mim,
const mesh_fem &mf_u, const mesh_fem &mf_data,
const VECT &K_squared,
const mesh_region &rg=mesh_region::all_convexes()) {
generic_assembly assem("K=data$1(#2);"
"m = comp(Base(#1).Base(#1).Base(#2)); "
"M$1(#1,#1)+=sym(m(:,:,i).K(i) - "
"comp(Grad(#1).Grad(#1))(:,i,:,i));");
assem.push_mi(mim);
assem.push_mf(mf_u);
assem.push_mf(mf_data);
assem.push_data(K_squared);
assem.push_mat(const_cast<MAT&>(M));
assem.assembly(rg);
}
/**
assembly of the term @f$\int_\Omega Kuv - \nabla u.\nabla v@f$,
for the helmholtz equation (@f$\Delta u + k^2u = 0@f$, with @f$K=k^2@f$).
The argument K_squared may be a real or a complex-valued scalar.
@ingroup asm
*/
template<typename MAT, typename VECT>
void asm_homogeneous_Helmholtz
(MAT &M, const mesh_im &mim, const mesh_fem &mf_u, const VECT &K_squared,
const mesh_region &rg = mesh_region::all_convexes()) {
asm_homogeneous_Helmholtz(M, mim, mf_u, K_squared, rg,
typename gmm::linalg_traits<VECT>::value_type());
}
template<typename MAT, typename VECT, typename T>
void asm_homogeneous_Helmholtz(MAT &M, const mesh_im &mim,
const mesh_fem &mf_u,
const VECT &K_squared,
const mesh_region &rg, T) {
asm_homogeneous_Helmholtz_real(M, mim, mf_u, K_squared, rg);
}
template<typename MAT, typename VECT, typename T>
void asm_homogeneous_Helmholtz(MAT &M, const mesh_im &mim,
const mesh_fem &mf_u,
const VECT &K_squared,
const mesh_region &rg, std::complex<T>) {
asm_homogeneous_Helmholtz_cplx(gmm::real_part(M),
gmm::imag_part(M), mim, mf_u,
gmm::real_part(K_squared),
gmm::imag_part(K_squared), rg);
}
template<typename MATr, typename MATi, typename VECTr, typename VECTi>
void asm_homogeneous_Helmholtz_cplx(const MATr &Mr, const MATi &Mi,
const mesh_im &mim,
const mesh_fem &mf_u,
const VECTr &K_squaredr,
const VECTi &K_squaredi,
const mesh_region &rg) {
generic_assembly assem("Kr=data$1(1); Ki=data$2(1);"
"m = comp(Base(#1).Base(#1)); "
"M$1(#1,#1)+=sym(m(:,:).Kr(j) - "
"comp(Grad(#1).Grad(#1))(:,i,:,i));"
"M$2(#1,#1)+=sym(m(:,:).Ki(j));");
assem.push_mi(mim);
assem.push_mf(mf_u);
assem.push_data(K_squaredr);
assem.push_data(K_squaredi);
assem.push_mat(const_cast<MATr&>(Mr));
assem.push_mat(const_cast<MATi&>(Mi));
assem.assembly(rg);
}
template<typename MAT, typename VECT>
void asm_homogeneous_Helmholtz_real(const MAT &M, const mesh_im &mim,
const mesh_fem &mf_u,
const VECT &K_squared,
const mesh_region &rg) {
generic_assembly assem("K=data(1);"
"m = comp(Base(#1).Base(#1)); "
"M$1(#1,#1)+=sym(m(:,:).K(j) - "
"comp(Grad(#1).Grad(#1))(:,i,:,i));");
assem.push_mi(mim);
assem.push_mf(mf_u);
assem.push_data(K_squared);
assem.push_mat(const_cast<MAT&>(M));
assem.assembly(rg);
}
enum { ASMDIR_BUILDH = 1, ASMDIR_BUILDR = 2, ASMDIR_SIMPLIFY = 4,
ASMDIR_BUILDALL = 7 };
/**
Assembly of Dirichlet constraints @f$ u(x) = r(x) @f$ in a weak form
@f[ \int_{\Gamma} u(x)v(x) = \int_{\Gamma} r(x)v(x) \forall v@f],
where @f$ v @f$ is in
the space of multipliers corresponding to mf_mult.
size(r_data) = Q * nb_dof(mf_rh);
A simplification can be done when the fem for u and r are the same and
when the fem for the multipliers is of same dimension as the one for u.
version = |ASMDIR_BUILDH : build H
|ASMDIR_BUILDR : build R
|ASMDIR_SIMPLIFY : simplify
|ASMDIR_BUILDALL : do everything.
@ingroup asm
*/
template<typename MAT, typename VECT1, typename VECT2>
void asm_dirichlet_constraints
(MAT &H, VECT1 &R, const mesh_im &mim, const mesh_fem &mf_u,
const mesh_fem &mf_mult, const mesh_fem &mf_r,
const VECT2 &r_data, const mesh_region ®ion,
int version = ASMDIR_BUILDALL) {
typedef typename gmm::linalg_traits<VECT1>::value_type value_type;
// typedef typename gmm::number_traits<value_type>::magnitude_type magn_type;
if ((version & ASMDIR_SIMPLIFY) &&
(mf_u.is_reduced() || mf_mult.is_reduced() || mf_r.is_reduced())) {
GMM_WARNING1("Sorry, no simplification for reduced fems");
version = (version & (ASMDIR_BUILDR | ASMDIR_BUILDH));
}
region.from_mesh(mim.linked_mesh()).error_if_not_faces();
GMM_ASSERT1(mf_r.get_qdim() == 1,
"invalid data mesh fem (Qdim=1 required)");
if (version & ASMDIR_BUILDH) {
asm_mass_matrix(H, mim, mf_mult, mf_u, region);
// gmm::clean(H, gmm::default_tol(magn_type()) // à remettre !
// * gmm::mat_maxnorm(H) * magn_type(1000));
}
if (version & ASMDIR_BUILDR)
asm_source_term(R, mim, mf_mult, mf_r, r_data, region);
return; // à enlever !
// Verifications and simplifications
pfem pf_u, pf_r, pf_m;
bool warning_msg1 = false, warning_msg2 = false;
dal::bit_vector simplifiable_dofs, nonsimplifiable_dofs;
std::vector<size_type> simplifiable_indices(mf_mult.nb_basic_dof());
std::vector<value_type> simplifiable_values(mf_mult.nb_basic_dof());
std::vector<value_type> v1, v2, v3;
for (mr_visitor v(region); !v.finished(); v.next()) {
GMM_ASSERT1(v.is_face(), "attempt to impose a dirichlet "
"on the interior of the domain!");
size_type cv = v.cv(); short_type f = v.f();
GMM_ASSERT1(mf_u.convex_index().is_in(cv) &&
mf_r.convex_index().is_in(cv) &&
mf_mult.convex_index().is_in(cv),
"attempt to impose a dirichlet "
"condition on a convex with no FEM!");
pf_u = mf_u.fem_of_element(cv);
pf_r = mf_r.fem_of_element(cv);
pf_m = mf_mult.fem_of_element(cv);
if (!pf_m->is_lagrange() && !warning_msg1) {
GMM_WARNING3("Dirichlet condition with non-lagrange multiplier fem. "
"see the documentation about Dirichlet conditions.");
warning_msg1 = true;
}
if (!(version & ASMDIR_SIMPLIFY)) continue;
mesh_fem::ind_dof_face_ct pf_u_ct
= mf_u.ind_basic_dof_of_face_of_element(cv, f);
mesh_fem::ind_dof_face_ct pf_r_ct
= mf_r.ind_basic_dof_of_face_of_element(cv, f);
mesh_fem::ind_dof_face_ct pf_m_ct
= mf_mult.ind_basic_dof_of_face_of_element(cv, f);
size_type pf_u_nbdf = pf_u_ct.size();
size_type pf_m_nbdf = pf_m_ct.size();
size_type pf_u_nbdf_loc = pf_u->structure(cv)->nb_points_of_face(f);
size_type pf_m_nbdf_loc = pf_m->structure(cv)->nb_points_of_face(f);
// size_type pf_r_nbdf_loc = pf_r->structure(cv)->nb_points_of_face(f);
if (pf_u_nbdf < pf_m_nbdf && !warning_msg2) {
GMM_WARNING2("Dirichlet condition with a too rich multiplier fem. "
"see the documentation about Dirichlet conditions.");
warning_msg2 = true;
}
if (pf_u != pf_r || pf_u_nbdf != pf_m_nbdf ||
((pf_u != pf_r) && (pf_u_nbdf_loc != pf_m_nbdf_loc))) {
for (size_type i = 0; i < pf_m_nbdf; ++i)
nonsimplifiable_dofs.add(pf_m_ct[i]);
continue;
}
for (size_type i = 0; i < pf_m_nbdf; ++i) {
simplifiable_dofs.add(pf_m_ct[i]);
simplifiable_indices[pf_m_ct[i]] = pf_u_ct[i];
}
if (!(version & ASMDIR_BUILDR)) continue;
if (pf_u == pf_r) { // simplest simplification.
size_type Qratio = mf_u.get_qdim() / mf_r.get_qdim();
for (size_type i = 0; i < pf_m_nbdf; ++i) {
simplifiable_values[pf_m_ct[i]]
= r_data[pf_r_ct[i/Qratio]*Qratio+(i%Qratio)];
}
}
}
if (version & ASMDIR_SIMPLIFY) {
if (simplifiable_dofs.card() > 0)
{ GMM_TRACE3("Simplification of the Dirichlet condition"); }
else
GMM_TRACE3("Sorry, no simplification of the Dirichlet condition");
if (nonsimplifiable_dofs.card() > 0 && simplifiable_dofs.card() > 0)
GMM_WARNING3("Partial simplification of the Dirichlet condition");
for (dal::bv_visitor i(simplifiable_dofs); !i.finished(); ++i)
if (!(nonsimplifiable_dofs[i])) {
if (version & ASMDIR_BUILDH) { /* "erase" the row i */
const mesh::ind_cv_ct &cv_ct = mf_mult.convex_to_basic_dof(i);
for (size_type j = 0; j < cv_ct.size(); ++j) {
size_type cv = cv_ct[j];
for (size_type k=0; k < mf_u.nb_basic_dof_of_element(cv); ++k)
H(i, mf_u.ind_basic_dof_of_element(cv)[k]) = value_type(0);
}
H(i, simplifiable_indices[i]) = value_type(1);
}
if (version & ASMDIR_BUILDR) R[i] = simplifiable_values[i];
}
}
}
/**
Assembly of Dirichlet constraints on the normal component of a
vector field: u(x)n = r(x) (where n is the outward unit normal)
in a weak form
@f[ \int_{\Gamma} (u(x)n)v(x) = \int_{\Gamma} r(x)v(x) \forall v@f],
where @f$ v @f$ is in the space of multipliers corresponding to
mf_mult.
size(r_data) = Q * nb_dof(mf_rh) or Q * N * nb_dof(mf_rh);
In the case size(r_data) = Q * N * nb_dof(mf_rh), the right hand
side is @f[ \int_{\Gamma} (r(x).n(x))v(x) \forall v@f]
version = |ASMDIR_BUILDH : build H
|ASMDIR_BUILDR : build R
|ASMDIR_BUILDALL : do everything.
@ingroup asm
*/
template<typename MAT, typename VECT1, typename VECT2>
void asm_normal_component_dirichlet_constraints
(MAT &H, VECT1 &R, const mesh_im &mim, const mesh_fem &mf_u,
const mesh_fem &mf_mult, const mesh_fem &mf_r,
const VECT2 &r_data, const mesh_region ®ion,
int version = ASMDIR_BUILDALL) {
typedef typename gmm::linalg_traits<VECT1>::value_type value_type;
typedef typename gmm::number_traits<value_type>::magnitude_type magn_type;
size_type N = mf_u.linked_mesh().dim(), Q = mf_mult.get_qdim();
region.from_mesh(mim.linked_mesh()).error_if_not_faces();
GMM_ASSERT1(mf_mult.get_qdim() == mf_u.get_qdim() / N,
"invalid mesh fem for the normal component Dirichlet "
"constraint (Qdim=" << mf_u.get_qdim() / N << " required)");
if (version & ASMDIR_BUILDH) {
generic_assembly assem;
if (Q == 1)
assem.set("M(#2,#1)+=comp(Base(#2).vBase(#1).Normal())(:,:,i,i);");
else
assem.set("M(#2,#1)+=comp(vBase(#2).mBase(#1).Normal())(:,i,:,i,j,j);");
assem.push_mi(mim);
assem.push_mf(mf_u);
assem.push_mf(mf_mult);
assem.push_mat(H);
assem.assembly(region);
}
if (version & ASMDIR_BUILDR) {
if (gmm::vect_size(r_data) == mf_r.nb_dof() * Q)
asm_source_term(R, mim, mf_mult, mf_r, r_data, region);
else if (gmm::vect_size(r_data) == mf_r.nb_dof() * Q * N)
asm_normal_source_term(R, mim, mf_mult, mf_r, r_data, region);
else GMM_ASSERT1(false, "Wrong size of data vector");
}
gmm::clean(H, gmm::default_tol(magn_type())
* gmm::mat_maxnorm(H) * magn_type(100));
}
/**
Assembly of generalized Dirichlet constraints h(x)u(x) = r(x),
where h is a QxQ matrix field (Q == mf_u.get_qdim()), outputs a
(under-determined) linear system HU=R.
size(h_data) = Q^2 * nb_dof(mf_rh);
size(r_data) = Q * nb_dof(mf_rh);
This function tries hard to make H diagonal or mostly diagonal:
this function is able to "simplify" the dirichlet constraints (see below)
version = |ASMDIR_BUILDH : build H
|ASMDIR_BUILDR : build R
|ASMDIR_SIMPLIFY : simplify
|ASMDIR_BUILDALL : do everything.
@ingroup asm
*/
template<typename MAT, typename VECT1, typename VECT2, typename VECT3>
void asm_generalized_dirichlet_constraints
(MAT &H, VECT1 &R, const mesh_im &mim, const mesh_fem &mf_u,
const mesh_fem &mf_h, const mesh_fem &mf_r, const VECT2 &h_data,
const VECT3 &r_data, const mesh_region ®ion,
int version = ASMDIR_BUILDALL) {
pfem pf_u, pf_rh;
if ((version & ASMDIR_SIMPLIFY) &&
(mf_u.is_reduced() || mf_h.is_reduced() || mf_r.is_reduced())) {
GMM_WARNING1("Sorry, no simplification for reduced fems");
version = (version & ASMDIR_BUILDR);
}
region.from_mesh(mim.linked_mesh()).error_if_not_faces();
GMM_ASSERT1(mf_h.get_qdim() == 1 && mf_r.get_qdim() == 1,
"invalid data mesh fem (Qdim=1 required)");
if (version & ASMDIR_BUILDH) {
asm_qu_term(H, mim, mf_u, mf_h, h_data, region);
std::vector<size_type> ind(0);
dal::bit_vector bdof = mf_u.basic_dof_on_region(region);
// gmm::clean(H, 1E-15 * gmm::mat_maxnorm(H));
for (size_type i = 0; i < mf_u.nb_dof(); ++i)
if (!(bdof[i])) ind.push_back(i);
gmm::clear(gmm::sub_matrix(H, gmm::sub_index(ind)));
}
if (version & ASMDIR_BUILDR)
asm_source_term(R, mim, mf_u, mf_r, r_data, region);
if (!(version & ASMDIR_SIMPLIFY)) return;
/* step 2 : simplification of simple dirichlet conditions */
if (&mf_r == &mf_h) {
for (mr_visitor v(region); !v.finished(); v.next()) {
size_type cv = v.cv();
short_type f = v.f();
GMM_ASSERT1(mf_u.convex_index().is_in(cv) &&
mf_r.convex_index().is_in(cv),
"attempt to impose a dirichlet "
"condition on a convex with no FEM!");
if (f >= mf_u.linked_mesh().structure_of_convex(cv)->nb_faces())
continue;
pf_u = mf_u.fem_of_element(cv);
pf_rh = mf_r.fem_of_element(cv);
/* don't try anything with vector elements */
if (mf_u.fem_of_element(cv)->target_dim() != 1) continue;
bgeot::pconvex_structure cvs_u = pf_u->structure(cv);
bgeot::pconvex_structure cvs_rh = pf_rh->structure(cv);
for (size_type i = 0; i < cvs_u->nb_points_of_face(f); ++i) {
size_type Q = mf_u.get_qdim(); // pf_u->target_dim() (==1)
size_type ind_u = cvs_u->ind_points_of_face(f)[i];
pdof_description tdof_u = pf_u->dof_types()[ind_u];
for (size_type j = 0; j < cvs_rh->nb_points_of_face(f); ++j) {
size_type ind_rh = cvs_rh->ind_points_of_face(f)[j];
pdof_description tdof_rh = pf_rh->dof_types()[ind_rh];
/*
same kind of dof and same location of dof ?
=> then the previous was not useful for this dofs (introducing
a mass matrix which is not diagonal in the constraints matrix)
-> the constraint is simplified:
we replace \int{(H_j.psi_j)*phi_i}=\int{R_j.psi_j} (sum over j)
with H_j*phi_i = R_j
--> Le principe peut être faux : non identique à la projection
L^2 et peut entrer en conccurence avec les autres ddl -> a revoir
*/
if (tdof_u == tdof_rh &&
gmm::vect_dist2_sqr((*(pf_u->node_tab(cv)))[ind_u],
(*(pf_rh->node_tab(cv)))[ind_rh])
< 1.0E-14) {
/* the dof might be "duplicated" */
for (size_type q = 0; q < Q; ++q) {
size_type dof_u = mf_u.ind_basic_dof_of_element(cv)[ind_u*Q + q];
/* "erase" the row */
if (version & ASMDIR_BUILDH)
for (size_type k=0; k < mf_u.nb_basic_dof_of_element(cv); ++k)
H(dof_u, mf_u.ind_basic_dof_of_element(cv)[k]) = 0.0;
size_type dof_rh = mf_r.ind_basic_dof_of_element(cv)[ind_rh];
/* set the "simplified" row */
if (version & ASMDIR_BUILDH)
for (unsigned jj=0; jj < Q; jj++) {
size_type dof_u2
= mf_u.ind_basic_dof_of_element(cv)[ind_u*Q+jj];
H(dof_u, dof_u2) = h_data[(jj*Q+q) + Q*Q*(dof_rh)];
}
if (version & ASMDIR_BUILDR) R[dof_u] = r_data[dof_rh*Q+q];
}
}
}
}
}
}
}
/**
Faster (and simpler) assembly of simple Dirichlet conditions (
u(x) = F(x) on a boundary).
@param mf should be Lagrangian.
@param boundary the boundary number.
@param F the dirichlet condition value.
@param RM,B are modified to enforce the Dirichlet condition. The
symmetry properties of RM are kept.
@ingroup asm
*/
template<typename MATRM, typename VECT1, typename VECT2>
void assembling_Dirichlet_condition
(MATRM &RM, VECT1 &B, const mesh_fem &mf, size_type boundary,
const VECT2 &F) {
// Marche uniquement pour des ddl de lagrange.
size_type Q=mf.get_qdim();
GMM_ASSERT1(!(mf.is_reduced()), "This function is not adapted to "
"reduced finite element methods");
dal::bit_vector nndof = mf.basic_dof_on_region(boundary);
pfem pf1;
for (dal::bv_visitor cv(mf.convex_index()); !cv.finished(); ++cv) {
pf1 = mf.fem_of_element(cv);
pdof_description ldof = lagrange_dof(pf1->dim());
size_type nbd = pf1->nb_dof(cv);
for (size_type i = 0; i < nbd; i++) {
size_type dof1 = mf.ind_basic_dof_of_element(cv)[i*Q];
if (nndof.is_in(dof1) && pf1->dof_types()[i] == ldof) {
// cout << "dof : " << i << endl;
for (size_type j = 0; j < nbd; j++) {
size_type dof2 = mf.ind_basic_dof_of_element(cv)[j*Q];
for (size_type k = 0; k < Q; ++k)
for (size_type l = 0; l < Q; ++l) {
if (!(nndof.is_in(dof2)) &&
dof_compatibility(pf1->dof_types()[j],
lagrange_dof(pf1->dim())))
B[dof2+k] -= RM(dof2+k, dof1+l) * F[dof1+l];
RM(dof2+k, dof1+l) = RM(dof1+l, dof2+k) = 0;
}
}
for (size_type k = 0; k < Q; ++k)
{ RM(dof1+k, dof1+k) = 1; B[dof1+k] = F[dof1+k]; }
}
}
}
}
/* add a dirichlet condition on a single dof, modifiying the matrix
RM and the rhs B. (keeping the symmetry properties) */
template<typename MATRM, typename VECT1>
void add_Dirichlet_dof(MATRM &RM, VECT1 &B,
const mesh_fem &mf,
size_type dof,
typename gmm::linalg_traits<MATRM>::value_type
dof_val) {
size_type Q=mf.get_qdim();
const mesh::ind_cv_ct &dofcv = mf.convex_to_dof(dof);
pfem pf1;
for (mesh::ind_cv_ct::const_iterator it = dofcv.begin();
it != dofcv.end(); ++it) {
pf1 = mf.fem_of_element(*it);
GMM_ASSERT1(pf1->target_dim() == 1, "sorry, to be done ... ");
size_type nbd = pf1->nb_dof(*it);
for (size_type i = 0; i < nbd * Q; i++) {
size_type dof1 = mf.ind_dof_of_element(*it)[i];
if (dof == dof1) {
for (size_type j = 0; j < nbd * Q; j++) {
size_type dof2 = mf.ind_dof_of_element(*it)[j];
if (!(dof == dof2)) {
B[dof2] -= RM(dof2, dof1) * dof_val;
RM(dof2, dof1) = RM(dof1, dof2) = 0;
}
}
RM(dof1, dof1) = 1; B[dof1] = dof_val;
}
}
}
}
/**
Build an orthogonal basis of the kernel of H in NS, gives the
solution of minimal norm of H*U = R in U0 and return the
dimension of the kernel. The function is based on a
Gramm-Schmidt algorithm.
@ingroup asm
*/
template<typename MAT1, typename MAT2, typename VECT1, typename VECT2>
size_type Dirichlet_nullspace(const MAT1 &H, MAT2 &NS,
const VECT1 &R, VECT2 &U0) {
// To be finalized.
// . In order to be used with any sparse matrix type
// . transpose the result and give the effective dimension of the kernel
// . Compute the ctes / H.
// . Optimization (suppress temporary ...).
// . Verify sizes of data
typedef typename gmm::linalg_traits<MAT1>::value_type T;
typedef typename gmm::number_traits<T>::magnitude_type MAGT;
typedef typename gmm::temporary_vector<MAT1>::vector_type TEMP_VECT;
MAGT tol = gmm::default_tol(MAGT());
MAGT norminfH = gmm::mat_maxnorm(H);
size_type nbd = gmm::mat_ncols(H), nbase = 0, nbr = gmm::mat_nrows(H);
TEMP_VECT aux(nbr), e(nbd), f(nbd);
dal::dynamic_array<TEMP_VECT> base_img;
dal::dynamic_array<TEMP_VECT> base_img_inv;
size_type nb_bimg = 0;
gmm::clear(NS);
if (!(gmm::is_col_matrix(H)))
GMM_WARNING2("Dirichlet_nullspace inefficient for a row matrix H");
// First, detection of null columns of H, and already orthogonals
// vectors of the image of H.
dal::bit_vector nn;
for (size_type i = 0; i < nbd; ++i) {
gmm::clear(e); e[i] = T(1);
gmm::mult(H, e, aux);
MAGT n = gmm::vect_norm2(aux);
if (n < norminfH*tol*1000) {
NS(i, nbase++) = T(1); nn[i] = true;
}
else {
bool good = true;
for (size_type j = 0; j < nb_bimg; ++j)
if (gmm::abs(gmm::vect_sp(aux, base_img[j])) > MAGT(0))
{ good = false; break; }
if (good) {
gmm::copy(e, f);
gmm::scale(f, T(MAGT(1)/n)); gmm::scale(aux, T(MAGT(1)/n));
base_img_inv[nb_bimg] = TEMP_VECT(nbd);
gmm::copy(f, base_img_inv[nb_bimg]);
gmm::clean(aux, gmm::vect_norminf(aux)*tol);
base_img[nb_bimg] = TEMP_VECT(nbr);
gmm::copy(aux, base_img[nb_bimg++]);
nn[i] = true;
}
}
}
size_type nb_triv_base = nbase;
for (size_type i = 0; i < nbd; ++i) {
if (!(nn[i])) {
gmm::clear(e); e[i] = T(1); gmm::clear(f); f[i] = T(1);
gmm::mult(H, e, aux);
for (size_type j = 0; j < nb_bimg; ++j) {
T c = gmm::vect_sp(aux, base_img[j]);
// if (gmm::abs(c > 1.0E-6) { // à scaler sur l'ensemble de H ...
if (c != T(0)) {
gmm::add(gmm::scaled(base_img[j], -c), aux);
gmm::add(gmm::scaled(base_img_inv[j], -c), f);
}
}
if (gmm::vect_norm2(aux) < norminfH*tol*MAGT(10000)) {
gmm::copy(f, gmm::mat_col(NS, nbase++));
}
else {
MAGT n = gmm::vect_norm2(aux);
gmm::scale(f, T(MAGT(1)/n)); gmm::scale(aux, T(MAGT(1)/n));
gmm::clean(f, tol*gmm::vect_norminf(f));
gmm::clean(aux, tol*gmm::vect_norminf(aux));
base_img_inv[nb_bimg] = TEMP_VECT(nbd);
gmm::copy(f, base_img_inv[nb_bimg]);
base_img[nb_bimg] = TEMP_VECT(nbr);
gmm::copy(aux, base_img[nb_bimg++]);
}
}
}
// Compute a solution in U0
gmm::clear(U0);
for (size_type i = 0; i < nb_bimg; ++i) {
T c = gmm::vect_sp(base_img[i], R);
gmm::add(gmm::scaled(base_img_inv[i], c), U0);
}
// Orthogonalisation of the basis of the kernel of H.
for (size_type i = nb_triv_base; i < nbase; ++i) {
for (size_type j = nb_triv_base; j < i; ++j) {
T c = gmm::vect_sp(gmm::mat_col(NS,i), gmm::mat_col(NS,j));
if (c != T(0))
gmm::add(gmm::scaled(gmm::mat_col(NS,j), -c), gmm::mat_col(NS,i));
}
gmm::scale(gmm::mat_col(NS,i),
T(1) / gmm::vect_norm2(gmm::mat_col(NS,i)));
}
// projection of U0 on the orthogonal to the kernel.
for (size_type j = nb_triv_base; j < nbase; ++j) {
T c = gmm::vect_sp(gmm::mat_col(NS,j), U0);
if (c != T(0))
gmm::add(gmm::scaled(gmm::mat_col(NS,j), -c), U0);
}
// Test ...
gmm::mult(H, U0, gmm::scaled(R, T(-1)), aux);
if (gmm::vect_norm2(aux) > gmm::vect_norm2(U0)*tol*MAGT(10000))
GMM_WARNING2("Dirichlet condition not well inverted: residu="
<< gmm::vect_norm2(aux));
return nbase;
}
} /* end of namespace getfem. */
#endif /* GETFEM_ASSEMBLING_H__ */
|