Compare commits

...
Author SHA1 Message Date
Socratis Petrides 3876d111cf unit tests from complex dense matrix: Mult, MultAtB, Inverse, SystemMatrix 2022-02-23 18:17:38 -08:00
Socratis Petrides e3085a1182 adding ComplexDenseMatrix class 2022-02-23 18:16:44 -08:00
Will Pazner 722d8fa575 Merge pull request #2739 from mfem/shadow-fem-dev
Fixing shadow variables in fem classes [shadow-fem-dev]
2022-02-22 11:55:30 -08:00
Tzanio Kolev ec0dac2392 Merge pull request #2833 from mfem/release-pa-mem-dev
Optional copy_to_host for ReleasePADeviceMemory
2022-02-19 16:36:11 -08:00
Stowell, Mark L 4736553365 Fixing new shadowed variables in face restriction classes 2022-02-18 09:57:28 -08:00
Stowell, Mark L f07e137d89 Merge remote-tracking branch 'origin/master' into shadow-fem-dev
# Conflicts:
#	fem/prestriction.cpp
#	fem/restriction.cpp
2022-02-18 09:55:58 -08:00
Tzanio Kolev 56d092df0e Merge pull request #2822 from mfem/var-order-BuildConformingProlongation-fix
bug-fix in BuildConformingProlongation
2022-02-18 08:03:46 -08:00
Tzanio Kolev 9e442b4c22 Merge pull request #2826 from mfem/stefanozampini/ex2p-bddc
Stefanozampini/ex2p bddc
2022-02-18 08:02:24 -08:00
Tzanio 41b88b9db6 minor 2022-02-17 15:50:04 -08:00
Will Pazner 957a514da3 Merge pull request #2829 from mfem/variable-order-transfer-op
Refactor transfer operator unit tests
2022-02-16 14:39:22 -08:00
Veselin Dobrev 88cca21c90 Merge pull request #2195 from mfem/yohann/pa-dg-ncmesh
Add Discontinuous Galerkin Partial Assembly support for NCMesh.
2022-02-16 10:11:05 -08:00
Socratis Petrides 51cab29634 return null P/R in case of a DG space 2022-02-16 09:49:22 -08:00
Veselin Dobrev e08b2beb23 Merge branch 'master' into yohann/pa-dg-ncmesh
Resolved conflict:
   general/hash.hpp
2022-02-15 20:30:04 -08:00
Tzanio Kolev 5bf8d8a5d1 Merge pull request #2816 from mfem/device-memory-fixes
Fix device+debug runtime errors
2022-02-15 15:46:20 -08:00
Mark L. Stowell edabdac542 Merge pull request #2753 from mfem/lor-scale-integrated
Scale LOR integrated basis if using map type VALUE [lor-scale-integrated]
2022-02-15 13:57:48 -08:00
Mark L. Stowell 9bc340d88d Merge pull request #2752 from mfem/l2-mass-integral-map-type
Change PA mass kernels to work with map type INTEGRAL [l2-mass-integral-map-type]
2022-02-15 13:57:02 -08:00
Tom Stitt 88f185bdab add optional copy_to_host (true by default) option to ReleasePADeviceMemory 2022-02-15 13:47:44 -08:00
Yohann Dudouit 70fb6d1c66 Remove most Convection DG PA tests. 2022-02-15 13:26:04 -08:00
Veselin Dobrev 910fd79c19 Merge branch 'master' into device-memory-fixes
Resolved conflict:
   fem/transfer.cpp
2022-02-15 12:45:46 -08:00
Will Pazner 4ea60b1dec Use CAPTURE Catch2 macro instead of INFO 2022-02-15 09:32:47 -08:00
Tzanio Kolev c62be8d181 Merge pull request #2781 from mfem/hash-resize-fix
Fix hash table resize on NCMesh load [hash-resize-fix]
2022-02-15 09:06:20 -08:00
Will Pazner d7b8ed1a5b Fix end of non-void function error 2022-02-14 16:42:12 -08:00
Will Pazner fdac3fd03c Refactor transfer operator unit tests, reduce runtime 2022-02-14 16:30:51 -08:00
Will Pazner c6425db3da Merge pull request #2770 from mfem/variable-order-transfer-op
Variable order transfer operator
2022-02-14 14:22:14 -08:00
Stefano Zampini 4ae682b2d3 PETSc ex2p: add BDDC example 2022-02-14 13:14:24 +03:00
Stefano Zampini c31ded06c2 BDDC: attach RBMs to the global matrix 2022-02-14 12:46:02 +03:00
Tzanio Kolev 2f45c61c68 Merge pull request #2735 from mfem/paraview-point-cloud
Visualize QuadratureFunctions in ParaView (with DataCollection support) [paraview-point-cloud]
2022-02-13 17:04:13 -08:00
Tzanio Kolev 2419c94b37 Merge branch 'master' into paraview-point-cloud 2022-02-13 17:03:42 -08:00
Tzanio Kolev e145ad97c8 Merge pull request #2757 from mfem/extrapolate
Extrapolation miniapp
2022-02-13 17:03:14 -08:00
Tzanio Kolev 8b54fe906f Merge branch 'master' into extrapolate 2022-02-13 17:02:55 -08:00
Jakub Červený 17dcec0590 Corrected some of the new docs. 2022-02-13 13:45:48 +01:00
Yohann Dudouit a09afff6c5 Add documentation for Unlink. 2022-02-11 18:55:03 -08:00
Yohann Dudouit 5c200cb54a Some typos. 2022-02-11 18:30:34 -08:00
Yohann Dudouit e490a474c9 Add documentation to HashTable. 2022-02-11 18:19:16 -08:00
Yohann Dudouit e848c67ec5 Make some methods public to make nvcc happy. 2022-02-11 11:22:07 -08:00
Aaron Fisher f6ffbae4a1 Update hash.hpp 2022-02-11 11:05:59 -08:00
Socratis Petrides e65dc1ed36 bug-fix in BuildConformingProlongation 2022-02-10 17:28:25 -08:00
Veselin Dobrev e3585a53ae Fix a doxygen warning 2022-02-10 17:26:03 -08:00
Veselin Dobrev bb34d35459 Small updates in the doxygen documentation for SparseMatrix,
methods BuildTranspose() and EnsureMultTranspose().
2022-02-10 16:47:44 -08:00
Yohann Dudouit f4a2077c8b Same for ex9p. 2022-02-10 16:09:50 -08:00
Yohann Dudouit 20e40f5778 Replace device sample run with a better one. 2022-02-10 16:06:29 -08:00
Will Pazner 6990897b29 Replace occurrences of BuildTranspose with EnsureMultTranspose
Also slightly improve the Doxygen comments for those two functions.
2022-02-10 15:53:58 -08:00
Yohann Dudouit 63f9463d93 Update CHANGELOG. 2022-02-10 15:35:23 -08:00
Will Pazner b8a3e423fd Update condition in SparseMatrix::MultTranspose to match EnsureMultTranspose 2022-02-10 15:09:33 -08:00
Yohann Dudouit 7d84029fc8 Remove FaceInfoTag::Invalid. 2022-02-10 14:54:46 -08:00
Yohann Dudouit d6e160753f Slightly improve FaceInfoTag enum. 2022-02-10 14:53:49 -08:00
Veselin Dobrev 8328b3d220 Extend a little some of the doxygen comments related to the
struct Mesh::FaceInformation.
2022-02-10 14:28:03 -08:00
Will Pazner 5bd76ca866 Add SparseMatrix::EnsureMultTranspose 2022-02-10 11:19:32 -08:00
Jakub Červený cc024ce5c2 Fix bug in HashTable::BinSize. 2022-02-10 19:47:21 +01:00
Tom Stitt 7ecd331a0b Merge remote-tracking branch 'origin/master' into device-memory-fixes 2022-02-10 10:16:24 -08:00
Jakub Červený 8402306443 Document HashTable::BinSize() 2022-02-10 18:49:02 +01:00
Jakub Červený b942f9966f HashTable::PrintStats: improved docs 2022-02-10 11:20:05 +01:00
Yohann a461f7258e Merge pull request #2797 from mfem/yohann/face-interface2
Second proposal for a human readable face information
2022-02-09 17:48:03 -08:00
Tzanio Kolev 256bb5627f Merge pull request #2784 from mfem/hipsparse
Add hipSPARSE support
2022-02-09 17:10:55 -08:00
Veselin Dobrev 485ea34cac Update the Gitlab CI 'baseline' script to start 'runtest' using
the 'salloc' command instead of 'srun' -- the inner 'srun'
commands seem to get stuck if the outer command is 'srun'.

In the same script, update the Slurm queue used on Corona to
'pbatch' -- this script path is not used yet -- updating just
for consistency.
2022-02-09 12:00:19 -08:00
Veselin Dobrev 9f7ab4e642 Merge branch 'master' into hipsparse
Resolved conflicts:
   CHANGELOG
   CMakeLists.txt
   config/cmake/modules/MfemCmakeUtilities.cmake

Additional updated files:
   config/defaults.mk
2022-02-09 11:53:54 -08:00
Veselin Dobrev 4e6b6f7d47 Merge pull request #2750 from mfem/artv3/hypre-with-hip
Add support for Hypre with hip
2022-02-08 22:36:54 -08:00
Veselin Dobrev 309696aa72 Update the Gitlab CI 'build-and-test' jobs to use a new commit
from the mfem-uberenv repo that updates spack to v0.17.1 bringing
newer versions of some dependencies, e.g. hypre v2.23.0.
2022-02-08 21:31:57 -08:00
Yohann Dudouit 33a015aede non-conforming -> nonconforming. 2022-02-08 14:04:20 -08:00
Yohann Dudouit 6ed2314eec NonConforming -> Nonconforming. 2022-02-08 13:57:43 -08:00
Tom Stitt 0c4d7aa085 don't want to check trueness of a function pointer... 2022-02-08 13:20:05 -08:00
Will Pazner d0132c415a Merge remote-tracking branch 'origin/master' into paraview-point-cloud 2022-02-08 10:26:19 -08:00
Will Pazner a5f85a865b Use raw string literals for XML 2022-02-08 10:26:07 -08:00
Tzanio Kolev 47c054ce40 Merge pull request #2803 from mfem/yohann/fix-ea-zero-integs
Initialize element matrices to zero when no integrators.
2022-02-08 09:48:37 -08:00
Tzanio Kolev 39b521e647 Merge pull request #2782 from SCOREC/cws/pumi-gmsh-phys-ents
Parallel Unstructured Mesh Infrastructure (PUMI): Attaching Gmsh Physical Entity Tags [cws/pumi-gmsh-phys-ents]
2022-02-08 09:47:05 -08:00
Tzanio Kolev 384a8bb319 Merge pull request #2790 from mfem/rates-vis-title-fix
Fixing title in (p)rates.cpp
2022-02-08 09:46:31 -08:00
Tom Stitt 80a3df260c only BuildTranspose on device 2022-02-07 18:26:52 -08:00
Yohann Dudouit 915b044b14 Minor 2022-02-07 17:06:55 -08:00
Yohann Dudouit 01caa8dcb7 Remove unsused methods. 2022-02-07 16:50:43 -08:00
Veselin Dobrev f0b78ba810 In the CMake build system, add support in 'mfem_find_package'
for handling imported target dependencies that do not specify
the IMPORTED_CONFIGURATIONS property.

Add a comment in 'defaults.cmake' how to configure RAJA when
it is built with external CAMP dependency.
2022-02-07 14:55:15 -08:00
Veselin Dobrev d1ea0ecbab In the testing of the (p)lor_solvers miniapps, test H(curl)
problems instead of H1.

Co-authored-by: @pazner

In the block-solvers miniapp, fix typos and add a message that
the miniapp is not supported with the GPU builds on HYPRE.
2022-02-07 13:15:09 -08:00
Tom Stitt 07ab64b635 minor device memory fixes seen during debug run 2022-02-07 10:52:36 -08:00
Veselin Dobrev 367d0c4c32 In the navier_tgv test, increase a little the allowed tolerance
since it was causing failures due to round-off.

Co-authored by: @jandrej
2022-02-07 09:17:10 -08:00
Veselin Dobrev 2cd1d901a6 Fix some issues with the tests.
Sync some tests between GNU make and CMake.

Add tests for the (p)lor_solvers miniapp.
2022-02-06 15:04:17 -08:00
Veselin Dobrev 564d7aa1ca In sparsemat.cpp, add MFEM_ prefix to the CUDA-or-HIP macros. 2022-02-05 15:47:57 -08:00
Veselin Dobrev 6fccaa0ce8 In the Gitlab CI for Lassen, use static HYPRE + CUDA build
since the shared build fails.
2022-02-05 11:08:54 -08:00
Veselin Dobrev 77c1fe11f0 Mention HYPRE + HIP support in CHANGELOG; update INSTALL. 2022-02-04 16:52:37 -08:00
Veselin Dobrev fa80f24449 Merge branch 'master' into artv3/hypre-with-hip
Resolved conflict:
   miniapps/shifted/makefile
2022-02-04 16:08:42 -08:00
Veselin Dobrev 64b10ab759 Replaced the current HIP CMake support with one based on the CMake
support provided by the ROCm installation.

Added a number of smaller fixes and tweaks related to HYPRE + HIP
support and the CMake build system.

Added support out-of-source GNU make builds in miniapps/shifted.

In the Gitlab CI for Lassen, added a job that tests a build where
both MFEM and HYPRE are built with CUDA.
2022-02-04 15:37:28 -08:00
Cameron Smith 606ba7c190 cmake: require pumi 2.2.6 or newer 2022-02-04 16:41:44 -05:00
Cameron Smith fb41c298e3 increase the minimum pumi version to 2.2.6 2022-02-04 16:37:00 -05:00
Arturo Vargas 46df499e23 edit pass - PR comments 2022-02-03 11:48:58 -08:00
Yohann Dudouit a78d206931 NonConforming -> Nonconforming 2022-02-03 09:24:38 -08:00
Tom Stitt 20aadc8f95 restore deprecated functions correctly 2022-02-02 17:07:32 -08:00
Cameron Smith a88269f1f3 use auto for maInput
thanks to @v-dobrev
2022-02-02 14:34:23 -05:00
Yohann Dudouit d85396e2df Initialize element matrices to zero when no integrators. 2022-02-02 10:17:50 -08:00
Yohann Dudouit 0bc28bca46 Fix new struct. 2022-02-02 10:06:44 -08:00
Yohann Dudouit 265b6a59c1 Use struct for each element on a face. 2022-02-02 09:56:53 -08:00
Yohann Dudouit 5e5a2c66a4 Remove tautological documentation. 2022-02-01 14:47:51 -08:00
Yohann Dudouit b67d03f0ad NonConforming -> Nonconforming 2022-02-01 13:03:45 -08:00
Yohann Dudouit df528c10f1 Apply Will's suggestions:
- Conforming -> Coincident
- Coarse -> Superset
- Fine -> Subset
- Shared -> FaceNbr
2022-02-01 12:57:04 -08:00
Will Pazner cff66a06eb Merge remote-tracking branch 'origin/master' into paraview-point-cloud 2022-02-01 11:55:42 -08:00
Will Pazner 2ec73641dc Update CHANGELOG, fix typo 2022-02-01 11:55:29 -08:00
Yohann Dudouit 81386ed445 More of the same. 2022-02-01 10:20:24 -08:00
Yohann Dudouit 4404a4dbca Replace coarse-fine and fine-coarse with coarse and fine. 2022-02-01 10:19:03 -08:00
Yohann Dudouit cf4acf95a6 Fix semantic of GhostSlave faces. 2022-02-01 10:14:38 -08:00
Cameron Smith 69c916076f pumi: fix style 2022-02-01 11:54:15 -05:00
Yohann Dudouit b7d7338dca Draft for second proposal for FaceInformation 2022-01-31 16:24:54 -08:00
Socratis Petrides 003a055712 adding strict conformity unit test (now that R_hp is fixed) 2022-01-30 18:26:00 -08:00
Socratis Petrides 2e12de2cae Merge branch 'variable-order-transfer-op' of https://github.com/mfem/mfem into variable-order-transfer-op 2022-01-30 18:18:05 -08:00
Socratis Petrides 6489b32bcb Merge branch 'master' into variable-order-transfer-op 2022-01-30 18:12:03 -08:00
Tzanio Kolev a96065ed18 Merge pull request #2766 from mfem/gslib-variable-order-fix
Adding checks to avoid using FindPointsGSLIB for variable order space
2022-01-30 17:18:48 -08:00
Tzanio Kolev 5a66397861 Merge pull request #2780 from mfem/hip-d2d-async
Async memcpy for DtoD
2022-01-30 17:18:04 -08:00
Tzanio Kolev 2d89962838 Merge pull request #2787 from mfem/hpR-bugfix
Bug fix for hp restriction matrix
2022-01-30 17:17:19 -08:00
Tom Stitt e33c78fda1 fix potentially missed cusparse/hipsparse cleanup - thanks Veselin 2022-01-27 16:41:36 -08:00
Tom Stitt 3b10d36ee9 libhipsparse needs an -L flag, add support for finding it from make and cmake 2022-01-27 16:25:26 -08:00
Ketan Mittal 90431de2a8 reviewer comment 2022-01-27 14:27:25 -08:00
Veselin Dobrev 6cabf89962 Small doxygen improvements 2022-01-27 12:51:29 -08:00
Arturo Vargas 33ca7a4265 Merge branch 'artv3/hypre-with-hip' of https://github.com/mfem/mfem into artv3/hypre-with-hip 2022-01-27 11:53:47 -08:00
Arturo Vargas 4a6a421ea9 macro styling changes 2022-01-27 11:46:27 -08:00
Tom Stitt cbfb0a7ed2 use memcpyasync for d2d in the regular hipdevicememoryspace
add notes about reasons
2022-01-27 10:47:17 -08:00
Tom Stitt ee35e2aef2 remove override usage, seems like it's all or nothing? 2022-01-27 09:46:54 -08:00
Tom Stitt baffb28a4b move substitution macros to sparsemat.cpp
define MFEM_USE_CUDA_OR_HIP in cuda.hpp and hip.hpp

readd and deprecate CleanCUSparse and UseCUSparse
2022-01-27 09:40:47 -08:00
Vladimir Z Tomov c0091548e6 Merge branch 'master' into extrapolate 2022-01-26 16:18:10 -08:00
Vladimir Z Tomov 7dcf76eabc Reviewer comments. 2022-01-26 16:16:17 -08:00
Ketan Mittal 9c2a368c3f Merge branch 'master' of https://github.com/mfem/mfem into gslib-variable-order-fix 2022-01-26 12:29:08 -08:00
Ketan Mittal 2007823084 reviewer comments 2022-01-26 12:29:01 -08:00
Socratis Petrides 50cae500a8 fixing title in (p)rates.cpp 2022-01-26 11:26:06 -08:00
Dylan Copeland 86cbbe9d92 minor 2022-01-26 10:53:47 -08:00
Socratis Petrides 187d444429 correcting the R/Rhp choice in TrueTransfer -> fixing the failed unit tests 2022-01-26 10:53:33 -08:00
Dylan Copeland 8a5b431132 Adding unit test. 2022-01-26 10:15:16 -08:00
Socratis Petrides 1d5ef9dc83 Merge branch 'master' into variable-order-transfer-op 2022-01-26 10:07:37 -08:00
Socratis Petrides a7462fa72d switch to Rhp in the TrueTransferOperator 2022-01-26 10:07:19 -08:00
Dylan Copeland 42646153b8 Fixing the 3D case. 2022-01-25 15:06:01 -08:00
Ketan Mittal 719ef61a5a update prolongtomaxorder to ensure the right FECollection is used 2022-01-25 12:26:53 -08:00
Dylan Copeland 50452026cf Bug fix. 2022-01-25 12:15:36 -08:00
Ketan Mittal b86e0302a6 add options to randomly h-refine the mesh or p-refine the solution for findpts and pfindpts miniapp 2022-01-25 12:00:32 -08:00
Tom Stitt aa5b1101b4 doxygen ignore macro-assisted typename 2022-01-25 09:20:20 -08:00
Yohann Dudouit 0eb0d82bda Remove Elem1 from function names in favor of CoarseFine and FineCoarse. 2022-01-24 17:39:19 -08:00
Yohann Dudouit 88ffc396c3 Remove inaccurate documentation. 2022-01-24 17:22:56 -08:00
Tom Stitt 773320ab88 add cmake support 2022-01-24 12:59:40 -08:00
Tom Stitt 3b9000c617 add hipsparse support 2022-01-24 09:54:52 -08:00
Jakub Červený 5da4d3afc7 Add HashTable::PrintStats to dump hash table statistics. 2022-01-23 11:53:04 +01:00
Jakub Červený 40fb41470b Fix missing hash table resize in HashTable::Alloc() (used in NCMesh load). 2022-01-23 11:51:21 +01:00
Socratis Petrides 5b9b21748b addressing reviewer comments 2022-01-21 14:48:27 -08:00
Tom Stitt cf3173ab92 for the Umpire device space use HipMemcpyDtoDAsync instead of (sync) version to avoid unnecessary host blocking 2022-01-21 14:02:39 -08:00
Arturo Vargas 73916e5140 bugfix for sparse mult transpose 2022-01-20 15:31:45 -08:00
Cameron Smith 6a9c53e8dd remove debug print 2022-01-20 13:18:35 -05:00
Cameron Smith bf3b040c9d attempt to set parmesh attr 2022-01-20 12:42:19 -05:00
Tzanio Kolev bba2c08025 Merge pull request #2740 from mfem/vsx
vsx128 GNU fix [vsx]
2022-01-20 08:08:21 -08:00
Yohann Dudouit 5e03149861 Make function names more explicit. 2022-01-19 20:59:13 -08:00
Veselin Dobrev 581c46d394 Resolve bad automatic merge 2022-01-19 15:44:16 -08:00
Veselin Dobrev f640103e26 Merge branch 'yohann/pa-dg-ncmesh' into yohann/shared-master-slave 2022-01-19 15:37:15 -08:00
Yohann Dudouit 88695cefff Refactor FaceInformation to associate location and conformity to both elem1 and elem2. 2022-01-19 11:13:41 -08:00
Tzanio Kolev b23a3921bf Merge pull request #2743 from mfem/shadow-examples-dev
Fixing shadow variables in examples [shadow-examples-dev]
2022-01-19 09:56:40 -08:00
Veselin Dobrev 27c4f22338 Small tweaks in the code and the documentation. 2022-01-18 19:48:38 -08:00
Will Pazner e4bcd7c58c Merge pull request #2746 from mfem/shadow-tests-dev
Fixing shadow variables in unit tests [shadow-tests-dev]
2022-01-18 15:08:30 -08:00
Veselin Dobrev 30a3c76325 Merge pull request #2771 from mfem/stopwatch-fix-comment
Fix erroneous comment in StopWatch
2022-01-18 12:12:35 -08:00
Stowell, Mark L 99e1a076ba Switching to ostream named os 2022-01-18 11:15:11 -08:00
Will Pazner 1ae61b0ada Merge remote-tracking branch 'origin/master' into shadow-tests-dev 2022-01-18 10:29:05 -08:00
Tzanio Kolev f0398ff391 Merge pull request #2732 from mfem/shadow-tmop-dev
Fixing shadowed variables in tmop files [shadow-tmop-dev]
2022-01-18 10:26:08 -08:00
Tzanio Kolev df1deca20e Merge pull request #2736 from mfem/shadow-gen-dev
Fixing shadow variables in general classes [shadow-gen-dev]
2022-01-17 17:53:37 -08:00
Tzanio Kolev d1b79a7fc3 Merge pull request #2744 from mfem/shadow-miniapps-dev
Fixing shadow variables in miniapps [shadow-miniapps-dev]
2022-01-17 17:53:00 -08:00
Tzanio Kolev 426a77be6c Merge pull request #2754 from mfem/shifted-bug-fix
Shifted bug fix
2022-01-17 17:52:17 -08:00
Socratis Petrides 9b67afef13 adding TrueTransferOperator unit test for HpRelaxedConformity 2022-01-16 19:42:22 -08:00
Socratis Petrides 308e7f9509 adding variable order case to the TrueTransferOperator 2022-01-16 19:41:37 -08:00
Socratis Petrides 3252583bcb style 2022-01-16 16:06:41 -08:00
Socratis Petrides 29dda8468f minor changes in unit tests 2022-01-16 16:06:14 -08:00
Socratis Petrides e08cb481e4 reverting changed to TrueTransferOperator 2022-01-16 16:05:47 -08:00
Socratis Petrides d06a8110b8 minor fix in test_transfer 2022-01-16 11:28:32 -08:00
Veselin Dobrev 3da0d9fc2f Merge branch 'master' into yohann/pa-dg-ncmesh (#2195) 2022-01-14 19:45:55 -08:00
Will Pazner 20dced51fd Fix erroneous comment in StopWatch 2022-01-14 17:59:13 -08:00
Socratis Petrides b904336a5e make style 2022-01-14 16:25:17 -08:00
Socratis Petrides 8107e14ccd Adding tests for PRrefinementTransfer for variable order 2022-01-14 16:18:58 -08:00
Socratis Petrides a04b471a33 PRtrasferOperator for variable order fespace 2022-01-14 16:18:15 -08:00
Vladimir Z Tomov 4c53371c2a Added description, references, changelog entry. 2022-01-14 13:20:10 -08:00
Yohann Dudouit 70fba19635 Invert shared non-conforming slave and master. 2022-01-14 12:13:34 -08:00
Ketan Mittal df6526ef5d adding checks for input based on variable order space 2022-01-14 10:26:13 -08:00
Vladimir Z Tomov 00c4f59c76 Minor. 2022-01-13 18:47:38 -08:00
Stowell, Mark L 453d51d358 Incorporating changes suggested by @pazner 2022-01-12 10:29:43 -08:00
Arturo Vargas dc1b6cf38a add cmake support 2022-01-11 17:43:25 -08:00
Ketan Mittal 5a6e0dad2e minor 2022-01-11 15:56:56 -08:00
Ketan Mittal 774794595b move temp_elvect->elvect outside the loop 2022-01-11 13:56:42 -08:00
camierjs cfa82dccc0 In device.?pp, use device_id for shadowed variable and switch out to os 2022-01-11 11:09:12 -08:00
camierjs 30803b8f00 Rename Memory<T>::New input arguments 2022-01-11 11:05:13 -08:00
Will Pazner 113423b423 Typos 2022-01-11 10:19:23 -08:00
Will Pazner 11ed189dec Add some Doxygen documentation for Poly_1D 2022-01-11 09:21:50 -08:00
Vladimir Z Tomov 0301d39b94 Unused variable, renamed others. 2022-01-07 14:19:48 -08:00
Vladimir Z Tomov b796e1ab50 Decided to drop the FCT option. 2022-01-07 13:27:57 -08:00
Vladimir Z Tomov c9a3df3e61 minor 2022-01-07 13:17:11 -08:00
Vladimir Z Tomov d2f040c9bb gitignore 2022-01-07 12:46:33 -08:00
Vladimir Z Tomov ac4bc120ec cmake 2022-01-06 18:32:46 -08:00
Vladimir Z Tomov 0b21e3d42f Minor. 2022-01-06 17:58:39 -08:00
Vladimir Z Tomov d0e444cae0 style 2022-01-06 17:49:59 -08:00
Vladimir Z Tomov 0168811bb0 Improved the output. 2022-01-06 17:44:17 -08:00
Vladimir Z Tomov 5607e7f863 Constant extrapolation step is always LO. 2022-01-06 17:32:49 -08:00
Vladimir Z Tomov 76fcc0374e Minor. 2022-01-06 16:30:31 -08:00
Vladimir Z Tomov f3d656a9b8 Distance (or final time) parameter. 2022-01-06 10:09:26 -08:00
Nabil Atallah 92112fccaa changed '=' sign to '+=' in line 644 otherwise at every integration point the values get overwritten 2022-01-05 16:24:51 -08:00
Nabil Atallah 70bd112ea4 added the sbm_aux.hpp file to the CMakeLists.txt and also added it to line 56 since the object files depend on it 2022-01-05 13:59:31 -08:00
Nabil Atallah 6ba7e82f91 Merge branch 'master' of https://github.com/mfem/mfem
Fixed a bug in the sbm_solver.cpp file of the shifted miniapp.
2022-01-05 13:38:44 -08:00
Vladimir Z Tomov 1411616361 some optimizations 2022-01-05 13:19:08 -08:00
Will Pazner 1cc284cd42 Add unit test for PA mass with INTEGRAL map type 2022-01-05 12:04:23 -08:00
Vladimir Z Tomov f5da256306 Command line option for the advection mode. 2022-01-05 11:35:58 -08:00
Nabil Atallah ba83609892 reset the temp_elvect vector to zero at the beginning of the loop over each integration point in sbm_solver.cpp belonging to the shifted miniapp, also fixed a typo in the comments related to the sign of the SBM penalty term 2022-01-05 11:28:49 -08:00
Will Pazner c771e61f08 Scale LOR integrated basis if using map type VALUE 2022-01-05 09:41:39 -08:00
Will Pazner c7781e1dc7 Change PA mass kernels to work with map type INTEGRAL 2022-01-05 09:04:48 -08:00
Stowell, Mark L 74fc2de695 Adjusting names in function declarations 2022-01-04 17:34:47 -08:00
Arturo Vargas 3dbaa74933 additional fixes for examples/mini-apps 2022-01-04 13:54:33 -08:00
Arturo Vargas 105d1e767b add support for hypre with hip 2022-01-04 12:41:38 -08:00
Vladimir Z Tomov 408bba19ca Paraview output of the level set. 2022-01-03 12:27:24 -08:00
Vladimir Z Tomov f7ee013d35 Removed extra assembly. 2022-01-03 12:16:13 -08:00
Vladimir Z Tomov d5a5daf20b Code reorg. 2022-01-03 12:11:05 -08:00
Vladimir Z Tomov dfeb8a63d0 1D and 3D sample runs. 2022-01-03 11:11:17 -08:00
Vladimir Z Tomov 9c8cf76c6e Error computation only near the interface. 2021-12-30 16:37:23 -08:00
Stowell, Mark L df6e73654a Fixing shadow variables in autodiff miniapps 2021-12-30 11:33:21 -08:00
Stowell, Mark L a07fc07206 Changes suggested by @camierjs 2021-12-30 11:04:44 -08:00
Stowell, Mark L bc76377bda Changes based on feedback from @vladotomov 2021-12-30 10:57:05 -08:00
Stowell, Mark L 5e672f26bc Removing unneeded function after consulting @camierjs 2021-12-29 10:24:18 -08:00
Vladimir Z Tomov f3f37e8e5a Minor. 2021-12-28 15:19:24 -08:00
Stowell, Mark L 475d3d8102 Fixing shadow variables in unit tests 2021-12-28 11:42:51 -08:00
Veselin Dobrev 0f239c22e0 Merge pull request #2730 from mfem/ScaledOperatorFix
Fix size of ScaledOperator and add MultTranspose
2021-12-28 10:28:17 -08:00
Tzanio Kolev 783f0e0304 Merge pull request #2709 from mfem/new-compilers-warnings-fix
Fix some compiler warnings from new clang and gcc versions
2021-12-28 09:58:40 -08:00
Vladimir Z Tomov cee93c0b36 Option to do FCT, fiexd the RHS. 2021-12-28 00:37:26 -08:00
Stowell, Mark L fa713ff7ea Fixing shadow variables in templates 2021-12-27 14:39:18 -08:00
Stowell, Mark L dd03eb6d79 Adding missing shadow vdofs 2021-12-27 14:38:20 -08:00
Vladimir Z Tomov 8f43daf84f Option to do upwind diffusion in the transport steps. 2021-12-27 14:05:56 -08:00
Stowell, Mark L 0f4bd5925a Fixing shadow variables in miniapps 2021-12-27 12:46:22 -08:00
Stowell, Mark L ca3e2b3098 make style 2021-12-27 10:42:01 -08:00
Stowell, Mark L b14bd1f237 Fixing shadow variables in examples 2021-12-27 10:41:09 -08:00
Vladimir Z Tomov 224eef2034 Bochkov-type extrapolation.
Option to switch between type and order.
2021-12-27 00:14:59 -08:00
Will Pazner 0249c8460c Doxygen comments for VTK and binary IO 2021-12-25 08:42:44 -08:00
Will Pazner a393064c00 Use VTK WriteBinaryOrASCII in ParaViewDataCollection
Reduce code duplication since the same logic is used in Mesh
2021-12-24 11:16:30 -08:00
Will Pazner 9b6a80c193 VTU output of multi-component QuadratureFunctions 2021-12-24 11:15:27 -08:00
Vladimir Z Tomov 536f3c24da Quadratic extrapolation. 2021-12-24 00:15:25 -08:00
Vladimir Z Tomov bcc7b129b9 Some code reorg. 2021-12-23 23:51:06 -08:00
Stowell, Mark L 00622b78fc Fixing shadow variables in fem classes 2021-12-23 16:32:09 -08:00
Stowell, Mark L fa25a70da6 Fixing shadow variables in general classes 2021-12-23 16:21:31 -08:00
camierjs e9b9152f59 vsx128 fix 2021-12-23 16:20:05 -08:00
Will Pazner fc172e9303 Save quadrature fields in ParaViewDataCollection 2021-12-23 14:49:30 -08:00
Will Pazner 703706762b Save QuadratureFunctions in VTU format 2021-12-23 14:46:26 -08:00
Will Pazner 1bf24380f2 Move some VTK-specific output functions to vtk.cpp 2021-12-23 13:32:39 -08:00
Stowell, Mark L bd7527e922 Swapping leading underscores for trailing 2021-12-23 09:49:01 -08:00
Cameron Smith 96d66067a3 set attr from gmsh physical entity tag 2021-12-23 11:45:23 -05:00
Stowell, Mark L 60a1d3d1d4 Fixing shadowed variables in tmop files 2021-12-22 15:46:33 -08:00
Vladimir Z Tomov 2026c6944a minor 2021-12-22 14:01:30 -08:00
Cameron Smith 82a52d42d8 Merge remote-tracking branch 'scorec/cws/pumiMaInput' into cws/pumi-gmsh-phys-ents 2021-12-22 12:51:22 -05:00
Vladimir Z Tomov 74d1cc13a9 Automatic dt calculation. 2021-12-22 00:05:07 -08:00
Vladimir Z Tomov d6ced2de1a Level set with kinks. 2021-12-21 19:09:40 -08:00
Syun'ichi Shiraiwa 07ba5bd336 make style 2021-12-21 21:55:09 -05:00
Syun'ichi Shiraiwa 4027c86797 fix size of ScaledOperator and add MultTranspose 2021-12-21 21:52:54 -05:00
Vladimir Z Tomov 2a128ae159 Linear extrapolation. 2021-12-21 17:57:30 -08:00
Vladimir Z Tomov 1566657332 Constant extrapolation. 2021-12-21 12:43:09 -08:00
Tzanio Kolev 8300a563ae Merge pull request #2722 from mfem/pncmesh-getessvdof-fix
Fix `ParFiniteElementSpace::GetEssentialVDofs()` for non-conforming meshes
2021-12-21 08:36:14 -08:00
Tzanio Kolev 753f351934 Merge pull request #2519 from mfem/bicgstab-print-lvl-fix
Modernize print level semantics
2021-12-21 07:47:49 -08:00
Vladimir Z Tomov f53f3f84db Merge branch 'master' into extrapolate 2021-12-20 16:58:14 -08:00
Vladimir Z Tomov 71c73a973b Visualized the marking. 2021-12-20 16:31:42 -08:00
Veselin Dobrev 9310e05a15 Override appropriately the SetPrintLevel methods in class KINSolver 2021-12-20 16:20:27 -08:00
termi-official 985fff881c Treat 'no convergence' as a warning. 2021-12-20 21:33:54 +01:00
termi-official 5b841fb239 Remove deprecation attribute from IterativeSolver::print_level together with all of its support code. 2021-12-20 20:53:59 +01:00
Tzanio Kolev 6f7b29ac14 Merge branch 'master' into bicgstab-print-lvl-fix 2021-12-19 17:58:19 -08:00
Tzanio Kolev 589d2775cb Merge pull request #2629 from mfem/simd-unary-plus
Add unary + to AutoSIMD
2021-12-19 12:14:36 -08:00
Tzanio Kolev 8a565cad67 Merge pull request #2677 from mfem/jacobi-abs-diag
Positive diagonal in Jacobi smoothers
2021-12-16 17:58:31 -08:00
Tzanio Kolev 5f9ee51d40 Merge pull request #2684 from mfem/tmop-renameandrefactor
TMOP clean up
2021-12-16 17:57:45 -08:00
Tzanio Kolev acb85daaff Merge pull request #2656 from mfem/lor-gridfunction-coeff
GridFunction coefficients that work with LOR preconditioning
2021-12-16 17:57:04 -08:00
Tzanio Kolev 36ec075849 Merge pull request #2702 from mfem/add-code-of-conduct
MFEM Code of Conduct
2021-12-16 14:12:31 -08:00
Veselin Dobrev 8b0262bd29 Fix an issue where some boundary dofs are not properly marked
as essential in ParFiniteElementSpace::GetEssentialVDofs() when
using a parallel non-conforming mesh.

This should address GitHub issue #2559.
2021-12-16 02:53:09 -08:00
Tzanio d9a18088a2 Updated to Contributor Covenant Code 2.1 2021-12-15 08:02:04 -08:00
Tzanio KolevandVeselin Dobrev 830ea90cf8 Update CODE_OF_CONDUCT.md
Co-authored-by: Veselin Dobrev <v-dobrev@users.noreply.github.com>
2021-12-15 07:28:56 -08:00
Tzanio KolevandVeselin Dobrev 9377a43d28 Update CODE_OF_CONDUCT.md
Co-authored-by: Veselin Dobrev <v-dobrev@users.noreply.github.com>
2021-12-15 07:28:51 -08:00
Tzanio KolevandVeselin Dobrev 87cd94a1fe Update CODE_OF_CONDUCT.md
Co-authored-by: Veselin Dobrev <v-dobrev@users.noreply.github.com>
2021-12-15 07:28:44 -08:00
Tzanio KolevandVeselin Dobrev 1aa1e0633b Update CODE_OF_CONDUCT.md
Co-authored-by: Veselin Dobrev <v-dobrev@users.noreply.github.com>
2021-12-15 07:28:36 -08:00
Tzanio KolevandVeselin Dobrev 57f3462a00 Update CODE_OF_CONDUCT.md
Co-authored-by: Veselin Dobrev <v-dobrev@users.noreply.github.com>
2021-12-15 07:28:31 -08:00
Tzanio KolevandVeselin Dobrev 186f65ccc1 Update CODE_OF_CONDUCT.md
Co-authored-by: Veselin Dobrev <v-dobrev@users.noreply.github.com>
2021-12-15 07:28:23 -08:00
Tzanio KolevandVeselin Dobrev 8e11743052 Update CODE_OF_CONDUCT.md
Co-authored-by: Veselin Dobrev <v-dobrev@users.noreply.github.com>
2021-12-15 07:28:16 -08:00
Tzanio KolevandVeselin Dobrev 649163a36f Update CODE_OF_CONDUCT.md
Co-authored-by: Veselin Dobrev <v-dobrev@users.noreply.github.com>
2021-12-15 07:28:09 -08:00
Veselin Dobrev a58567695e Fix an error when building with HIP which may also be causing
problems with CUDA.

In OperatorJacobiSmoother, use absolute value of diagonal, if
requested, during setup instead of during action.

A few tweaks in SparseMatrix::Jacobi and SparseMatrix::DiagScale.

For the GitLab CI on Lassen, disable ATS.
2021-12-14 22:37:53 -08:00
Tzanio Kolev 53c04ef171 Update CONTRIBUTING.md 2021-12-14 21:52:00 -08:00
Veselin Dobrev 2c09747196 Fix some compiler warnings from new clang and gcc versions 2021-12-14 21:49:31 -08:00
Yohann Dudouit f54842b6a7 Use int variables to avoid comparison between signed and unsigned integers. 2021-12-14 12:13:43 -08:00
Yohann Dudouit 2214f65e20 Simplify InterpConfig based on @samuelpmishLLNL feedback. 2021-12-14 11:59:39 -08:00
Yohann Dudouit 094f032de5 Remove Mesh::GetNCFacesPtMat. 2021-12-14 10:37:57 -08:00
Tzanio e9feadbbfc Small updates 2021-12-14 08:27:27 -08:00
Yohann a00c3fe39b Merge pull request #2704 from mfem/yohann/pa-dg-ncmhes-deduplicate
Remove duplicated code.
2021-12-13 17:22:24 -08:00
Yohann Dudouit 588e211f5a Improve variable names. 2021-12-13 16:15:41 -08:00
Yohann Dudouit 2659ee5f3f Make dgtrace more self-documented. 2021-12-13 16:06:01 -08:00
Yohann Dudouit ec176a6bf8 Fix: move height and width initialization outside MFEM_DEBUG. 2021-12-13 15:50:54 -08:00
Tzanio 81dceb94b6 Adressing comments 2021-12-13 13:21:20 -08:00
Tzanio Kolev 39022bce0f Merge pull request #2698 from mfem/nvwarnings
Remove nvcc warnings about partially overridden virtual functions [nvwarnings]
2021-12-13 13:13:38 -08:00
Tzanio 15242ffcf6 Editorial adjustments in CHANGELOG. 2021-12-13 13:08:53 -08:00
Vladimir Z Tomov 0db5a18c0c Wip on extrapolation miniapp. 2021-12-13 11:45:05 -08:00
Will Pazner 9a5cafafc6 Merge remote-tracking branch 'origin/master' into simd-unary-plus 2021-12-13 11:37:29 -08:00
Will Pazner 11275857a3 Update CHANGELOG 2021-12-13 11:37:18 -08:00
Will Pazner d06a528958 Merge remote-tracking branch 'origin/master' into lor-gridfunction-coeff 2021-12-13 10:49:50 -08:00
Will Pazner f54b8bd6d8 Update CHANGELOG to mention LOR GridFunction coefficient support 2021-12-13 10:49:39 -08:00
Will Pazner 239c672988 Merge pull request #2655 from mfem/pmesh-mem-leak-fix
Fix Memory leaks in PMesh
2021-12-13 10:40:51 -08:00
Vladimir Z Tomov aabf4ce84d Fixed a wrong coefficient in the adaptive limiting. 2021-12-12 16:27:40 -08:00
Yohann Dudouit 84a1f1e343 Fix documentation. 2021-12-10 17:56:50 -08:00
Yohann Dudouit f64c3175c6 Have ParNCL2FaceRestriction inherit from both NCL2FaceRestriction and ParL2FaceRestriction. 2021-12-10 17:40:00 -08:00
Yohann Dudouit 63d2303a48 Add documentation. 2021-12-10 16:51:01 -08:00
Yohann Dudouit 01322ef72f Fix ParNCL2FaceRestriction::AddMultTranspose 2021-12-10 14:14:05 -08:00
Yohann Dudouit f086ff03f4 Fix typo. 2021-12-10 14:07:58 -08:00
Yohann Dudouit f811da79e4 Move verifications in CheckFESpace methods. 2021-12-10 14:05:30 -08:00
Tzanio Kolev f95c2e156b Create CODE_OF_CONDUCT.md 2021-12-10 12:11:10 -08:00
Yohann Dudouit 2bd1148127 Fix mfem_data_dir path. 2021-12-10 11:36:56 -08:00
Yohann Dudouit c37a187f9d Redesign protected constructor. 2021-12-10 10:53:02 -08:00
Yohann Dudouit d02545cc3e Initial refactor removing duplicated code in Mult and AddMultTranspose. 2021-12-09 15:56:08 -08:00
camierjs 80fa63cb64 Remove nvcc warnings about partially overridden virtual functions 2021-12-08 10:46:29 -08:00
Veselin Dobrev 97796f0beb Merge branch 'master' into bicgstab-print-lvl-fix
Resolved conflict:
   CHANGELOG
2021-12-07 12:44:31 -08:00
Will Pazner c1562552f1 Make performance ex1 and ex1p templated on dimension 2021-12-02 10:17:06 -08:00
termi-official a44a8640d1 Change output behavior of warnings to mfem::out for consistency and update PrintLevel docs with the associated stream. 2021-12-01 17:24:26 +01:00
Ketan Mittal 001f1a8b79 add missing PC 3D metrics 2021-11-30 13:59:26 -08:00
Ketan Mittal 92e42d4332 fix spacing etc 2021-11-30 12:45:19 -08:00
Ketan Mittal 9c7150c93e Merge branch 'master' of https://github.com/mfem/mfem into tmop-renameandrefactor 2021-11-30 10:24:14 -08:00
Ketan Mittal 19a2ad26e1 minor 2021-11-30 10:24:12 -08:00
Veselin Dobrev 568562a7d5 Restore a comment that was deleted unintentionallly. 2021-11-26 22:14:42 -08:00
Veselin Dobrev aa8be1b59c In class IterativeSolver, silence the depracation warnings for
`print_level` in a way that works for both Clang and GCC.
2021-11-26 21:34:33 -08:00
Veselin Dobrev 85a79cbea5 Try to suppress deprecation warning with GCC from the
`IterativeSolver` constructors.
2021-11-26 20:17:19 -08:00
Veselin Dobrev 3bf7e07457 Tweak the Doxygen documentation for class IterativeSolver.
Suppress deprecation warnings only when modifying the `print_level`
data member of class `IterativeSolver`.
2021-11-26 20:05:44 -08:00
Vladimir Z Tomov c94cd73dd1 empty line. 2021-11-26 16:02:27 -08:00
Vladimir Z Tomov ff427a04a6 Minor. 2021-11-26 16:01:41 -08:00
Vladimir Z Tomov 2d10dd0abe Options to use abs values of the diagonal in OperatorJacobi, DSmoother. 2021-11-26 15:49:40 -08:00
termi-official a53353776d Update convergence criterion docs. 2021-11-26 17:08:39 +01:00
termi-official 2f1c03796a Adapt tmop print policy. 2021-11-26 16:39:06 +01:00
termi-official 199d19c195 Add documentation about warning suppression in solver. 2021-11-26 16:28:32 +01:00
Will Pazner eb6ef4a537 Minor 2021-11-24 17:47:27 -08:00
Will Pazner af7c58aa0e Minor solver output consistency fixes 2021-11-24 17:20:31 -08:00
Will Pazner d4f404cf74 Don't repeat last iteration in GMRES output 2021-11-24 10:53:53 -08:00
Will Pazner 2080fde2a1 Small changes to reduce diffs with old solver output 2021-11-24 10:44:38 -08:00
Will Pazner 7ff5874904 Typo 2021-11-21 13:30:50 -08:00
Will Pazner 757ee1a24a Merge remote-tracking branch 'origin/master' into lor-gridfunction-coeff 2021-11-20 13:13:17 -08:00
Will Pazner 861c7c4a04 Add unit tests for GridFunction coefficients on refined meshes 2021-11-20 13:13:16 -08:00
Yohann 301d0c3b39 Merge branch 'master' into yohann/pa-dg-ncmesh 2021-11-11 19:12:32 -08:00
Yohann Dudouit f30ab6b09b Fix GetFaceInformation. Thanks @camierjs 2021-11-11 18:57:45 -08:00
Yohann Dudouit 8bee3a173d Fix AddMultTranspose 2021-11-11 10:51:38 -08:00
Yohann Dudouit 797194af84 Avoid overflow with hash functions. 2021-11-11 10:50:45 -08:00
Yohann Dudouit 8afc72f6dc Removing dead code 2021-11-10 13:39:59 -08:00
Will Pazner 60b5110031 Allow the same GridFunctionCoefficient (and related classes) to work on both coarse and refined meshes
Useful for LOR preconditioning with GridFunction coefficients. The same
Coefficient can be used on both the coarse and refined mesh.
2021-11-09 16:53:31 -08:00
Will Pazner fe08c6bd36 Add mesh data member to ElementTransformation 2021-11-09 15:55:36 -08:00
Tom Stitt 977e978ad7 fix one more leak 2021-11-09 15:50:22 -08:00
Tom Stitt db43873b7d delete face_nbr_el_to_face in ParMesh::Destroy 2021-11-09 13:43:48 -08:00
Will Pazner 40f672c230 Add unary + SIMD specializations 2021-11-02 13:33:38 -07:00
termi-official e49a744288 Apply style... 2021-11-02 18:50:49 +01:00
termi-official 388350029b Propagate first_and_last option into nonlinear iterative solvers. 2021-11-02 18:48:43 +01:00
termi-official 3c3d220460 Last MINRES iteration was sometimes missing. 2021-11-02 18:37:22 +01:00
termi-official 0279dd9787 Fix FGMRES one-by-off. 2021-11-02 18:34:29 +01:00
termi-official 46d800d05e Report correct norm in BiCGStab. 2021-11-02 18:29:20 +01:00
termi-official 4e1420f1e2 Fix GMRES final iteration report. 2021-11-02 18:29:02 +01:00
termi-official a9e93adb3f Deduplicate MINRES output. 2021-11-02 17:48:18 +01:00
termi-official 3bd47c26fd Make FGMRES output more consistent. 2021-11-02 17:21:01 +01:00
termi-official 3348ba2dbd Make BiCGStab output more consistent. 2021-11-02 17:07:46 +01:00
Ketan Mittal d8df06ab70 minor - put back accidentally removed lines 2021-11-01 10:33:07 -07:00
Ketan Mittal 5dcd85c7c7 make style 2021-11-01 09:18:20 -07:00
Ketan Mittal 047ca50acb Merge branch 'master' of https://github.com/mfem/mfem into tmop-renameandrefactor 2021-11-01 09:17:34 -07:00
Tzanio Kolev 4d1a0ac51d Update CHANGELOG 2021-10-31 14:59:55 -07:00
Tzanio c887336fa4 Updated CHANGELOG 2021-10-31 14:59:06 -07:00
Tzanio Kolev cde981b141 Merge branch 'master' into bicgstab-print-lvl-fix 2021-10-31 14:50:34 -07:00
Will Pazner 8d1780147d Add 2D compile-time option to performance/ex1[p]
Adds sample runs testing the 2D templated code to avoid regressions
2021-10-29 17:40:27 -07:00
Will Pazner f452882d29 Add unary + operator to AutoSIMD 2021-10-29 16:22:13 -07:00
Yohann Dudouit 9f554c8b42 Add tests on Bernstein basis for PA DG AMR. 2021-10-29 11:38:18 -07:00
Yohann Dudouit 84f6acaeac Flip point matrix in 2D. 2021-10-29 10:41:01 -07:00
Yohann Dudouit 5113b1a8ed Use GetLocalInterpolation in GetCoarseToFineInterpolation. 2021-10-28 18:01:24 -07:00
Ketan Mittal 0d45eab46d initial commit with some refactoring and renaming 2021-10-20 10:38:36 -07:00
Yohann Dudouit 6fe9c25cf3 Add comment for magic number. 2021-10-18 14:03:44 -07:00
Will Pazner 15fbf80e57 Remove unneeded comment 2021-10-12 21:27:21 -07:00
Will Pazner e3450da53e Minor changes to MINRESSolver print level 2021-10-12 20:49:35 -07:00
Will Pazner 1c4b657f63 Minor changes to SLISolver printing 2021-10-12 20:37:12 -07:00
Yohann Dudouit 3c0b64a2d6 Check that ExchangeFaceNbrData has been called before GetNFbyType in parallel. 2021-10-12 18:47:43 -07:00
Will Pazner a19e625fc9 Delete empty comments 2021-10-12 18:10:40 -07:00
Will Pazner 37bd0ec75d Edits to IterativeSolver Doxygen comments 2021-10-12 18:03:59 -07:00
Yohann Dudouit b1cfab5f5f Merge branch 'master' into yohann/pa-dg-ncmesh 2021-10-12 17:12:03 -07:00
Yohann Dudouit d9ba858f6f Merge branch 'yohann/pa-dg-ncmesh' of github.com:mfem/mfem into yohann/pa-dg-ncmesh 2021-10-12 17:11:33 -07:00
Will Pazner 020d2173c3 Minor changes to "FirstAndLast" print options 2021-10-12 11:39:54 -07:00
Yohann Dudouit f8c5f3e925 Use mesh from mfem/data. 2021-10-11 14:25:09 -07:00
Yohann Dudouit b9e3b3c20a Change camel case to snake case for more variables. 2021-10-07 17:30:53 -07:00
Yohann Dudouit cae40473f7 Add documentation to GetSharedFaceTransformations. 2021-10-07 15:44:06 -07:00
Yohann Dudouit e0e91ce0ee Copy the doc for GetFaceElementTransformations from mesh to pmesh. 2021-10-07 15:40:20 -07:00
Yohann Dudouit f4ca1e3e60 Fix unwanted rename. 2021-10-07 15:22:15 -07:00
Yohann Dudouit dd77aa8eb7 More dofs->dof_values. 2021-10-07 15:14:57 -07:00
Yohann Dudouit e0cac54513 Rename dofValue->dof_value, nextOffset->next_offset, dofIn->dof_in, dofOut->dof_out. 2021-10-07 15:10:26 -07:00
Yohann Dudouit 0ce2bc6275 Rename nd to nface_dofs. 2021-10-07 14:56:54 -07:00
Yohann Dudouit 3e66449ad2 make style in test_pa_kernels.cpp 2021-10-07 14:34:04 -07:00
Yohann Dudouit 24a162f0ef Refactor test_pa_convection to run on NCMesh. 2021-10-07 14:28:24 -07:00
Yohann Dudouit ce38dbbca6 Fix name typo. 2021-10-07 14:03:05 -07:00
Yohann Dudouit 7f6cc5580d Add unstructured-quad-square.msh and unstructured-hex-cube.msh. 2021-10-07 14:01:41 -07:00
Yohann Dudouit 4f74e10f30 Improve interpolators map key. 2021-10-07 13:56:03 -07:00
Yohann Dudouit 170f9a5ff5 Add return false to silence warnings. 2021-10-07 11:50:26 -07:00
Yohann Dudouit 0467b670b7 Use more self-documented variable names. 2021-10-06 17:05:33 -07:00
Yohann Dudouit e3788a948f Reorganize class attributes. 2021-10-06 16:34:56 -07:00
Yohann Dudouit b15998374d Rename offsets -> gather_offsets. 2021-10-06 16:27:52 -07:00
Yohann Dudouit 0bcbc0235a Rename dof to face_dofs. 2021-10-06 16:18:44 -07:00
Yohann Dudouit 46e21def4e Merge branch 'master' into yohann/pa-dg-ncmesh 2021-10-06 15:29:42 -07:00
Yohann Dudouit 9b5f87398c Remove unused protected methods and simplify code. 2021-10-06 14:35:47 -07:00
Yohann Dudouit 05ed290c34 Take into account the native ordering of H1 for the interpolator.
Always use PermuteAndSet for Elem2.
2021-10-06 14:18:48 -07:00
Yohann Dudouit 80a59acf5f Fix a bug in InterpConfig. 2021-10-05 20:00:51 -07:00
Yohann Dudouit a41c0d4a0c Remove nc_faces_orientation. 2021-10-05 12:36:33 -07:00
Yohann Dudouit 45c7ce02f8 Fix ParNCL2FaceRestriction. 2021-10-05 12:20:36 -07:00
Yohann Dudouit ede2efd9c3 Improve documentation. 2021-10-01 16:07:08 -07:00
termi-official b889952837 Fix new macros in MSVC. 2021-09-29 16:54:26 +02:00
termi-official 8d96e40489 Make style... 2021-09-29 01:40:03 +02:00
termi-official d493efa295 Tweak docs. 2021-09-29 01:32:34 +02:00
termi-official a43de945bd Forgot a file. 2021-09-29 01:16:36 +02:00
termi-official 32a7939e4e Incorporate Will's changes. 2021-09-29 01:15:02 +02:00
termi-official 1f17768e33 Print warnings to mfem::err 2021-09-29 00:44:45 +02:00
termi-official 91f59a269c Revamp 'first and last' print option from legacy print level 3. 2021-09-29 00:41:59 +02:00
termi-official f8d501562f Exchange PrintLevel enum with struct+builder pattern. 2021-09-29 00:16:25 +02:00
termi-official b6530be3f9 Make style... 2021-09-28 21:45:51 +02:00
termi-official 3cbfee625a Add portable way to skip warnings generated by internal usage of deprecated variables. 2021-09-28 21:42:18 +02:00
Dennis Ogiermann 0ec9789849 Merge pull request #2572 from mfem/deprecate-print-level
Fix deprecation warnings for IterativeSolver::print_level
2021-09-28 18:25:50 +02:00
Will Pazner 7a20d17f90 Add pragma to ignore deprecated warnings in IterativeSolver::IterativeSolver 2021-09-27 15:47:04 -07:00
Will Pazner 317032fdbd Add bitwise or overload for PrintLevel 2021-09-27 15:34:20 -07:00
Will Pazner d6a0a5a13d Fix deprecation warnings for IterativeSolver::print_level 2021-09-27 15:21:07 -07:00
termi-official c1c39a51b5 Make style... 2021-09-27 23:40:41 +02:00
termi-official c5a7b179d8 Refactor setter/getter logic for print levels. 2021-09-27 23:36:47 +02:00
termi-official e88b99c2e2 Incorporate Will's suggestion: struct PrintOptions -> enum PrintLevel + deprecate old mechanism 2021-09-27 23:24:39 +02:00
Tzanio 793222a7e1 Merge branch 'master' into bicgstab-print-lvl-fix
Conflicts:
	CHANGELOG
2021-09-27 09:13:41 -07:00
termi-official 05bf01378c Add to changelog. 2021-09-27 18:11:53 +02:00
termi-official 71b7497037 Fix math string. 2021-09-27 17:30:49 +02:00
termi-official 5279744c6e Fix out of sync with upstream. 2021-09-27 17:04:05 +02:00
termi-official 19fae213a5 Fix some doxygen issues where no doc has been generated. 2021-09-27 16:53:42 +02:00
termi-official 0768f1940f Specify convergence docs. 2021-09-25 19:32:29 +02:00
termi-official 0c9296ab4b Propagate print_options through all solvers and unify output. 2021-09-25 19:13:40 +02:00
termi-official 7632309ed6 Fix hidden assumption taken when testing (all ranks print out if MPI is not properly initialized). 2021-09-25 17:27:54 +02:00
termi-official 439a3d773c Give recommendation and reasoning for new printing behavior. 2021-09-25 14:38:00 +02:00
termi-official ec2e958e04 Introduce PrintOptions as a new mechanism to set the reporting policy of iterative solvers + some Docs. 2021-09-25 14:28:25 +02:00
Yohann Dudouit ba27c951d1 Use temporary vector to interpolate. 2021-09-20 11:08:33 -07:00
Cameron Smith b1b6ccc9f4 pumi/ex1: another const 2021-09-15 14:45:54 -04:00
Cameron Smith c35156168c pumi/ex6p: const adapt input instances 2021-09-15 11:49:16 -04:00
Yohann Dudouit 4b213c4a30 Use default constructor for compatibility with Array. 2021-09-14 17:18:36 -07:00
Yohann Dudouit 04062029de Documentation. 2021-09-14 16:29:55 -07:00
Yohann Dudouit 889d0355bc make style. 2021-09-14 15:35:01 -07:00
Yohann Dudouit f153972fc1 Skip local non-conforming master in H1FaceRestriction. 2021-09-14 15:30:44 -07:00
Yohann Dudouit 223387e0fb Skip local non-conforming master faces in NCL2FaceRestriction. 2021-09-14 15:24:44 -07:00
Yohann Dudouit a7f6abd48c Minor. 2021-09-14 14:34:38 -07:00
Yohann Dudouit f148cdf20c Remove Ghost concept from FaceInformation. 2021-09-14 12:31:14 -07:00
Yohann Dudouit 8b5eee5a7a Remove notes on ghost faces. 2021-09-14 12:16:55 -07:00
Yohann Dudouit 41f63281bc Change orientation in ghost faces. 2021-09-14 12:00:38 -07:00
Yohann Dudouit c7f6a45001 Improve GetFaceInformation. 2021-09-14 11:56:04 -07:00
Yohann Dudouit 2edc9c3d20 Add some doc to Mesh::FaceInfo. 2021-09-14 11:54:50 -07:00
Yohann Dudouit 1e16d9a4fd Skip local non-conforming master faces in DGTrace. 2021-09-08 17:04:18 -07:00
Yohann Dudouit 7a274ad4fc Refine logic to treat ghost non-conforming master faces. 2021-09-08 17:02:47 -07:00
Yohann Dudouit ea1280f8ef Skip local non-conforming master faces in GetSigns. 2021-09-08 17:00:18 -07:00
Yohann Dudouit d54ab59b1d Take into account master side in GetCoarseToFineInterpolation. 2021-09-08 16:59:25 -07:00
Yohann Dudouit 910c309181 Improve restrictions debugging assertions. 2021-09-08 16:58:22 -07:00
Yohann Dudouit 06ed4029d5 Tag most ghost non-conforming master faces as trash. 2021-09-08 16:53:02 -07:00
Yohann Dudouit b8f4c85fca Skip local non-conforming master faces in face count. 2021-09-08 16:51:43 -07:00
Yohann Dudouit c651b027a2 Improve FaceInformation to tag trash faces. 2021-09-08 16:50:55 -07:00
Yohann Dudouit 3e716fb5ac Improve FaceInfo documentation. 2021-09-08 16:49:52 -07:00
termi-official 53eb418526 Merge branch 'master' into bicgstab-print-lvl-fix 2021-09-08 15:10:26 +02:00
termi-official eea189ba98 Change BICGStabSolver print level semantics. 2021-09-08 14:55:03 +02:00
Yohann Dudouit 19f8f85021 Add ParNCL2FaceRestriction::AddMultTranspose. 2021-09-07 16:49:34 -07:00
Yohann Dudouit 50d83bd8b6 Fix omitted DoubleValued filter for boundaries. 2021-09-07 15:23:55 -07:00
Yohann Dudouit 2699ceb23d Fix typo in ParNCL2FaceRestriction::Mult. 2021-09-07 15:23:02 -07:00
Yohann Dudouit 7a4a46c93f Remove is_trivial check until solution. 2021-09-02 19:29:51 -07:00
Yohann Dudouit cb003387b2 Little bit more style. 2021-09-02 19:26:48 -07:00
Yohann Dudouit 7f169fd7df make style. 2021-09-02 19:25:29 -07:00
Yohann Dudouit f524854baf Rename faceMap into face_map. 2021-09-02 19:11:27 -07:00
Yohann Dudouit 98efd8b6cb Doc imprv. 2021-09-02 19:11:00 -07:00
Yohann Dudouit c5b0129377 Replace static constexpr int with enum. 2021-09-02 19:04:47 -07:00
Yohann Dudouit 2dffe400aa Change InterpConfig default constructor. 2021-09-02 19:01:38 -07:00
Yohann Dudouit 46cf70049b some style in restriction.cpp. 2021-09-02 18:58:49 -07:00
Yohann Dudouit c07f50c71a Remove InterpolationManager::GetKey. 2021-09-02 18:40:36 -07:00
Yohann Dudouit 5fb5a9ee5b Rename info into face in mesh.cpp. 2021-09-02 18:22:04 -07:00
Yohann Dudouit dc3f16701f Remove dead code in mesh.cpp. 2021-09-02 18:18:14 -07:00
Yohann Dudouit c7ce2bb3d6 Don't invert signs yet. 2021-09-02 18:10:52 -07:00
Yohann Dudouit 24dde29cb0 Invert normal sign on ghost faces. 2021-09-02 18:09:06 -07:00
Yohann Dudouit e30eaaf4bf Doc imprv. 2021-09-02 18:07:20 -07:00
Yohann Dudouit 47aa908825 Refactor DGTrace. 2021-09-02 17:59:11 -07:00
Yohann Dudouit 64e95743a9 Minor fix. 2021-09-02 17:47:23 -07:00
Yohann Dudouit 4c3757dc44 Rewrite ParNCL2FaceRestriction::ComputeGatherIndices. 2021-09-02 17:44:01 -07:00
Yohann Dudouit 1e22977079 Rewrite ParNCL2FaceRestriction::ComputeScatterIndicesAndOffsets. 2021-09-02 17:42:29 -07:00
Yohann Dudouit f4a83b021c Rewrite ParNCL2FaceRestriction::Mult. 2021-09-02 17:40:50 -07:00
Yohann Dudouit 6eeabb3f6d Rename nc_side to master_side. 2021-09-02 17:18:44 -07:00
Yohann Dudouit 18df4d9a31 Add class ParNCH1FaceRestriction. 2021-09-02 16:56:58 -07:00
Yohann Dudouit d636a287e6 Add documentation to FaceInformation. 2021-09-02 15:39:56 -07:00
Yohann Dudouit 9c6c6d972a Rename FaceLocation::Interior into Local. 2021-09-02 15:02:47 -07:00
Yohann Dudouit 645c288fc3 Refactor ParNCL2FaceRestriction to use an InterpolationManager. 2021-09-02 14:14:20 -07:00
Yohann Dudouit 1b272bcfce Introduce InterpolationManager class. 2021-09-02 14:09:28 -07:00
Yohann Dudouit 4698aa2aad Rename info iinto face. 2021-09-02 11:27:49 -07:00
Yohann Dudouit a34fcc4beb Merge branch 'master' into yohann/pa-dg-ncmesh 2021-08-30 13:12:11 -07:00
Yohann Dudouit 51ab9a5201 Partial refactor of ParNCL2FaceRestriction. 2021-08-30 12:19:51 -07:00
Yohann Dudouit 57f6fa5e31 Add FaceInformation::IsShared. 2021-08-30 11:52:29 -07:00
Yohann Dudouit 10f94bd3d8 Minor refactoring. 2021-08-26 18:45:11 -07:00
Yohann Dudouit a0ff5b224e Refactor ParL2FaceRestriction. 2021-08-26 17:46:39 -07:00
Yohann Dudouit 6d0ec00469 Rename info into face. 2021-08-26 16:53:19 -07:00
Yohann Dudouit d687efa75e Refactor NCL2FaceRestriction. 2021-08-26 16:27:10 -07:00
Yohann Dudouit 19c00aa755 Refactor L2FaceRestriction. 2021-08-26 12:46:49 -07:00
Yohann Dudouit 0e5b2fae45 Improve code readability in NCMesh. 2021-08-26 10:03:17 -07:00
Yohann Dudouit 2573feaa77 Improve documentation of NCMesh. 2021-08-25 15:48:52 -07:00
Yohann Dudouit 51afd9c351 Fix a bug in NCMesh. 2021-08-25 15:46:01 -07:00
Yohann Dudouit 00fe120a12 Use enum type instead of magic numbers for refinements. 2021-08-25 15:45:38 -07:00
Yohann Dudouit c9fa398939 Take into account Ghost faces in FaceInformation. 2021-08-25 15:42:08 -07:00
Yohann Dudouit ceee771885 Add IsConforming in FaceInformation. 2021-08-25 15:41:21 -07:00
Yohann Dudouit 385e97341e Refactor NCL2FaceRestriction. 2021-08-25 15:40:02 -07:00
Yohann Dudouit 7125a6b086 Refactor of H1FaceRestriction. 2021-08-25 15:32:45 -07:00
Yohann Dudouit 4a75d3d064 Make GetFaceElementTransformations virtual.
- Make GetFaceElementTransformations virtual
- Add pmesh::GetFaceElementTransformations
- Add GetSharedFaceTransformationsByLocalIndex
2021-06-23 16:18:05 -07:00
Yohann Dudouit bca3c7d6c0 Add GetNumFacesWithGhost and IsOfFaceType. 2021-06-23 16:15:35 -07:00
Yohann Dudouit 893dab63a7 Improve ghost faces documentation. 2021-06-23 15:40:55 -07:00
Yohann Dudouit aebec64808 Change virtual for override in pmesh. 2021-06-23 15:40:36 -07:00
Yohann Dudouit 199cc085cf Make FaceInformation printable. 2021-06-03 15:19:29 -07:00
Yohann Dudouit c233928f99 Add more documentation for the face information. 2021-06-03 15:19:03 -07:00
Yohann Dudouit c567c02cee make style 2021-06-01 14:53:10 -07:00
Yohann Dudouit 826f962006 Add coumentation and asserts. 2021-06-01 14:40:30 -07:00
Yohann Dudouit 1b1a805d70 Refactor face retrictions. 2021-06-01 14:02:40 -07:00
Yohann Dudouit eb845c118c Add IsInterior and IsBoundary in FaceInformation 2021-06-01 13:51:47 -07:00
Yohann Dudouit 2ba909fa53 Better documentation for PointMatrix 2021-05-28 17:48:50 -07:00
Yohann Dudouit 64dd08320a Fix parenthesis issue. 2021-05-28 15:24:11 -07:00
Yohann Dudouit f87ce9723b Skip NonConformingMaster. 2021-05-28 15:17:51 -07:00
Yohann Dudouit 7d3e7db6b2 Don't count NonConformingMaster... 2021-05-28 14:18:17 -07:00
Yohann Dudouit 2a1805c8cd Fix silly copy/paste. 2021-05-28 13:41:29 -07:00
Yohann Dudouit 328fef8289 Update GetNFByType with GetFaceInformation. 2021-05-28 13:33:00 -07:00
Yohann Dudouit 13d280478b Update GetSigns with GetFaceInformation. 2021-05-28 13:29:28 -07:00
Yohann Dudouit 0cf01aa0c5 Update DGTrace with new GetFaceInformation. 2021-05-28 13:26:08 -07:00
Yohann Dudouit a2ab9fef67 Move GetNCFacesPtMat in public. 2021-05-28 13:17:30 -07:00
Yohann Dudouit 826a4406ed Minor edit to mesh. 2021-05-28 13:12:40 -07:00
Yohann Dudouit df3e3989c2 Update interface. 2021-05-28 12:57:48 -07:00
Yohann Dudouit a4ea8a28e1 Remove white spaces. 2021-05-28 12:52:06 -07:00
Yohann Dudouit 0db14e6db7 Fix some typos. 2021-05-28 12:49:53 -07:00
Yohann Dudouit 2117ec17c7 Add more documentation. 2021-05-28 12:34:17 -07:00
Yohann Dudouit ff0bce510d make style 2021-05-27 18:11:14 -07:00
Yohann Dudouit 03cbfdf2aa Remove test examples. 2021-05-27 18:05:08 -07:00
Yohann Dudouit 3cc0016704 Add ComputeCoarseToFineInterpolation to avoid some code duplication. 2021-05-27 16:19:31 -07:00
Yohann Dudouit 92ea168f68 Add coumentation. 2021-05-27 14:22:03 -07:00
Yohann Dudouit 4e6e99764d Add some documentation to PointMatrix. 2021-05-27 11:03:10 -07:00
Yohann Dudouit 8b57087e5c Propagate bugfix to ParNCL2FaceRestriction. 2021-05-26 17:31:50 -07:00
Yohann Dudouit 952dd5a3ed Fix another bug in the gather indices. 2021-05-24 16:30:52 -07:00
Yohann Dudouit 1be9a05195 make style. 2021-05-24 15:31:29 -07:00
Yohann Dudouit b00b5a8e63 Change GetFaceInformation's interface. 2021-05-24 15:15:50 -07:00
Yohann Dudouit 62fc2a997d Add ex9pa and ex9rotated to test pa dg on NCMesh. 2021-05-24 14:37:36 -07:00
Yohann Dudouit bebdb155fa Reorganize code 2021-05-24 14:36:50 -07:00
Yohann Dudouit 67888de8a3 Fix 2D and 3D orientation bugs. 2021-05-24 12:36:09 -07:00
Yohann Dudouit 6a8a33467f More tweaks on sample runs. 2021-05-05 12:34:18 -07:00
Yohann Dudouit a4d9f61114 Tweak sample runs 2021-05-05 12:32:52 -07:00
Yohann Dudouit d1486d8026 Add device sample runs on NCMesh. 2021-05-05 12:16:42 -07:00
Yohann Dudouit d97ce04481 Remove outdated comment. 2021-05-05 12:11:59 -07:00
Yohann Dudouit 917f9e0620 Fix a bug in coefficient evaluation. 2021-05-05 12:01:22 -07:00
Yohann Dudouit ab60ce3e2d Activate DG tests for NCMesh. 2021-05-05 12:01:03 -07:00
Yohann Dudouit 49a1cc415e Merge branch 'master' into yohann/pa-dg-ncmesh 2021-05-05 11:32:45 -07:00
Yohann Dudouit 14725937f9 More of the same. 2021-04-28 11:44:56 -07:00
Yohann Dudouit 42bb97c1a4 Fix a bug with MFEM_SYNC_THREAD. 2021-04-28 11:38:57 -07:00
Yohann Dudouit 82bc1e8bfc Remove unused methods. 2021-04-28 11:38:35 -07:00
Yohann Dudouit 69de37ddb6 make style 2021-04-27 18:43:07 -07:00
Yohann Dudouit baa3ca223d Fix a bug introduced with the new FaceInformation
- Forgot to skip non-conforming master faces.
2021-04-27 18:40:01 -07:00
Yohann Dudouit 1c34e76c1f Fix ommited if conditions... 2021-04-27 17:55:22 -07:00
Yohann Dudouit 39cd66e5e8 Optimize Mult and MultTranspose for GPUs. 2021-04-27 17:25:34 -07:00
Yohann Dudouit 2d4316a42c More small fixes 2021-04-27 16:25:39 -07:00
Yohann Dudouit e799a999fe Small fix. 2021-04-27 16:21:09 -07:00
Yohann Dudouit af0dbf487d more style 2021-04-27 16:12:25 -07:00
Yohann Dudouit e1d453899f make style 2021-04-27 16:09:22 -07:00
Yohann b265d83286 Merge branch 'master' into yohann/pa-dg-ncmesh 2021-04-27 15:56:16 -07:00
Yohann Dudouit 4768b45dee Use GetFaceInformation in prestriction.cpp 2021-04-27 15:53:45 -07:00
Yohann Dudouit bcd2dc2e39 Use GetFaceInformation in restriction.cpp 2021-04-27 15:53:22 -07:00
Yohann Dudouit 8b8925b134 Add improve interface for face information.
- Add FaceLocation enum class
- Add FaceConformity enum class
- Add FaceInformation struct
- Add GetFaceInformation method
2021-04-27 15:52:55 -07:00
Yohann Dudouit 864521344e Add documentation to FaceInfo. 2021-04-27 15:50:13 -07:00
Yohann Dudouit 4fe70877cd Add some doc for nc_faces_orientation. 2021-04-26 14:21:38 -07:00
Yohann Dudouit 3fd61eecd4 Fix a bug in ParNCL2FaceRestriction. 2021-04-12 16:10:17 -07:00
Yohann Dudouit 2078e7fce3 Activate ParNCL2FaceRestriction. 2021-04-12 16:09:53 -07:00
Yohann Dudouit 91d5c78813 Add parallel support for NCMesh. 2021-04-08 18:26:14 -07:00
Yohann Dudouit 4a1f4d4223 Some doc. 2021-04-07 12:29:00 -07:00
Yohann Dudouit 7284dc3824 Some cleaning 2021-04-07 12:16:46 -07:00
Yohann Dudouit 7f6d23730e Add a hack in mesh and ncmesh to store the nc face orientation. 2021-04-07 11:44:49 -07:00
Yohann Dudouit 495bc95d50 Minor 2021-04-02 15:06:33 -07:00
Yohann Dudouit 0cca55a3b4 Update interface. 2021-04-02 13:55:14 -07:00
Yohann Dudouit 213a3a793a Merge branch 'master' into yohann/pa-dg-ncmesh 2021-04-02 13:29:57 -07:00
Yohann Dudouit f182378fbb Merge branch 'master' into yohann/pa-dg-ncmesh 2021-04-02 13:29:00 -07:00
Yohann Dudouit 583bc2ad32 Minor 2021-04-02 13:27:11 -07:00
Yohann Dudouit f385f975fa Add orientation in NCMesh. 2021-04-01 11:09:31 -07:00
Yohann Dudouit d2364caddd Prepare code for 3D... 2021-03-29 12:53:17 -07:00
Yohann Dudouit 0d384b6248 2D seems to be finally working! 2021-03-11 15:17:38 -08:00
Yohann Dudouit 2869972f15 Minor 2021-03-08 11:11:25 -08:00
Yohann Dudouit 277112253c Fix indices in interpolators. 2021-02-17 16:38:56 -08:00
Yohann Dudouit b24ac45dc3 Handle non-conforming faces in H1FaceRestriction. 2021-02-17 16:20:23 -08:00
Yohann Dudouit e9cff9edad Add NCL2FaceRestriction. 2021-02-17 16:19:43 -08:00
Yohann Dudouit 365070ad88 Handle non-conforming faces for DGTrace Coefficient. 2021-02-17 16:17:44 -08:00
Yohann Dudouit 9cd7b94c2f Make GetSign handle non-conforming meshes. 2021-02-17 16:16:53 -08:00
Yohann Dudouit ad8c7967d3 Add documentation to L2FaceRestriction. 2021-02-09 15:33:04 -08:00
Yohann Dudouit 77b16c1101 Compute gather indices/ 2021-02-09 11:23:56 -08:00
Yohann Dudouit 03ab1e50f6 Introduce NCL2FaceRestriction class. 2021-02-05 11:14:07 -08:00
Yohann Dudouit a0a0a8132a Support NCMesh for GetNFByType 2021-02-05 11:13:35 -08:00
Yohann Dudouit 5253b7c9ab Add NCMesh data accessor. 2021-02-05 11:13:08 -08:00
219 changed files with 10575 additions and 4459 deletions
+2
View File
@@ -259,6 +259,8 @@ miniapps/performance/sol.*
miniapps/shifted/distance
miniapps/shifted/ParaViewDistance
miniapps/shifted/extrapolate
miniapps/shifted/ParaViewExtrapolate
miniapps/shifted/diffusion
miniapps/shifted/diffusion.mesh
miniapps/shifted/diffusion.gf
+1 -1
View File
@@ -45,5 +45,5 @@ variables:
- echo ${MFEM_DATA_DIR}
- echo ${SPEC}
# Next script uses 'THREADS': leaving it empty --> it uses 'make all -j'
- lalloc 1 -W 30 -q pdebug tests/gitlab/build_and_test --spec "${SPEC}" --data-dir "${MFEM_DATA_DIR}" --data
- lalloc 1 -W 30 -q pdebug --atsdisable tests/gitlab/build_and_test --spec "${SPEC}" --data-dir "${MFEM_DATA_DIR}" --data
needs: [setup]
+5
View File
@@ -19,6 +19,11 @@ opt_mpi_cuda_xl_16_1_1_8:
SPEC: "%xl@16.1.1.8 +mpi +cuda cuda_arch=70"
extends: .build_and_test_on_lassen
opt_mpi_cuda_hypre_cuda_xl:
variables:
SPEC: "%xl@16.1.1.8 +mpi +cuda cuda_arch=70 ^hypre+cuda~shared cuda_arch=70"
extends: .build_and_test_on_lassen
# Jobs report
report_job_success:
stage: report
+1 -1
View File
@@ -59,7 +59,7 @@ opt_par_gcc_6_1_0_sundials:
opt_par_gcc_6_1_0_petsc:
variables:
SPEC: "%gcc@6.1.0 +petsc ^petsc+mumps"
SPEC: "%gcc@6.1.0 +petsc ^petsc+mumps~superlu-dist"
extends: .build_and_test_on_quartz
opt_par_gcc_6_1_0_pumi:
+2 -2
View File
@@ -29,9 +29,9 @@ mkdir _${BASELINE_TEST} && cd _${BASELINE_TEST}
# run
if [[ "${MACHINE_NAME}" == "quartz" || "${MACHINE_NAME}" == "ruby" ]]; then
srun --nodes=1 -p pdebug ../runtest ../../mfem "${BASELINE_TEST} ${TPLS_DIR}"
salloc --nodes=1 -p pdebug ../runtest ../../mfem "${BASELINE_TEST} ${TPLS_DIR}"
elif [[ ${MACHINE_NAME} == "corona" ]]; then
srun --nodes=1 -t 60 -p mi60 ../runtest ../../mfem "${BASELINE_TEST} ${TPLS_DIR}"
salloc --nodes=1 -t 60 -p pbatch ../runtest ../../mfem "${BASELINE_TEST} ${TPLS_DIR}"
elif [[ ${MACHINE_NAME} == "lassen" ]]; then
lalloc 1 -q pdebug ../runtest ../../mfem "${BASELINE_TEST} ${TPLS_DIR}"
else
+34 -5
View File
@@ -10,10 +10,27 @@
Version 4.3.1 (development)
===========================
- Added support for automatic differentiation. Users can select between
native implementation and external library implementation at the
configuration phase. A parallel and two serial examples are implemented
in the autodiff miniapp directory.
- Add hipSPARSE support for sparse mat-vec multiplications.
- Added support for using the HYPRE library built with HIP support. Similar to
the HYPRE + CUDA support added earlier, most of the MFEM examples and miniapps
work transparently with HYPRE + HIP builds. This includes the BoomerAMG, AMS,
and ADS solvers.
- More explicit and consistent formating of the output of iterative solvers
with the new IterativeSolver::PrintLevel options. See linalg/solvers.hpp.
- Added a miniapp for PDE-based extrapolation of finite element functions. See
miniapps/shifted/extrapolate.cpp.
- Added support for automatic differentiation. Users can select between native
implementation and external library implementation during configuration. One
parallel and two serial examples are implemented in the miniapps/autodiff/
directory.
- GridFunctionCoefficient (and the related vector, gradient, divergence, and
curl classes) now work properly with LORDiscretization and LORSolver.
- Added support for mesh preprocessing to resolve fine scale problem data
before simulation. This feature uses adaptive mesh refinement to control the
@@ -71,13 +88,19 @@ Version 4.3.1 (development)
- Added initial TMOP-based capabilities for surface fitting and tangential
relaxation in the mesh-optimizer and pmesh-optimizer miniapps.
- Added ParMesh Adjaceny Set (adjset) creation support to the Conduit Mesh
Blueprint MFEM wrapper functions in ConduitDataCollection.
- `HypreParVector` and `Vector` now support move semantics, and the copy
constructor for `HypreParVector` now copies the local vector data.
- The HPC versions of ex1 and ex1p (in miniapps/performance) now support
runtime selection of either 2D or 3D meshes.
- Added ParaView visualization of `QuadratureFunction` fields, through both
`QuadratureFunction::SaveVTU` and `ParaViewDataCollection::RegisterQField`.
Version 4.3, released on July 29, 2021
======================================
@@ -118,6 +141,12 @@ Discretization improvements
- Added support for nonscalar coefficient with VectorDiffusionIntegrator.
- Added support for Partial Assembly with Discontinuous Galerkin methods on
nonconforming meshes.
- Added a simpler interface to request face information: see
`Mesh::FaceInformation` and `Mesh::GetFaceInformation`.
Linear and nonlinear solvers
----------------------------
- Added support for AMG preconditioners on GPUs based on the hypre library
+22 -22
View File
@@ -16,9 +16,6 @@ set(USER_CONFIG "${CMAKE_CURRENT_SOURCE_DIR}/config/user.cmake" CACHE PATH
# Require C++11 and disable compiler-specific extensions
set(CMAKE_CXX_STANDARD 11)
if (MFEM_USE_GINKGO)
set(CMAKE_CXX_STANDARD 14)
endif()
set(CMAKE_CXX_STANDARD_REQUIRED ON)
set(CMAKE_CXX_EXTENSIONS OFF)
@@ -84,6 +81,9 @@ if (MFEM_USE_STRUMPACK)
# Just needed to find the MPI_Fortran libraries to link with
set(XSDK_ENABLE_Fortran ON)
endif()
if (MFEM_USE_GINKGO AND ("${CMAKE_CXX_STANDARD}" LESS "14"))
set(CMAKE_CXX_STANDARD 14)
endif()
# Include xSDK default CMake file.
include("${CMAKE_CURRENT_SOURCE_DIR}/config/XSDKDefaults.cmake")
@@ -180,6 +180,19 @@ else()
set(MFEM_DEBUG OFF)
endif()
# AMD HIP
if (MFEM_USE_HIP)
if (HIP_ARCH)
message(STATUS "Using HIP architecture: ${HIP_ARCH}")
set(GPU_TARGETS "${HIP_ARCH}" CACHE STRING "HIP targets to compile for")
endif()
if (ROCM_PATH)
list(INSERT CMAKE_PREFIX_PATH 0 ${ROCM_PATH})
endif()
find_package(HIP REQUIRED)
find_package(HIPSPARSE REQUIRED)
endif()
# MPI -> hypre; PETSc (optional)
if (MFEM_USE_MPI)
find_package(MPI REQUIRED)
@@ -354,7 +367,7 @@ endif()
if (MFEM_USE_PUMI)
# If PUMI_DIR was specified, only link to that directory,
# i.e. don't link to another installation in /usr/lib by mistake
find_package(SCOREC 2.1.0 REQUIRED OPTIONAL_COMPONENTS gmi_sim
find_package(SCOREC 2.2.6 REQUIRED OPTIONAL_COMPONENTS gmi_sim
CONFIG PATHS ${PUMI_DIR} NO_DEFAULT_PATH)
if (SCOREC_FOUND)
# Define a header file with the MFEM_USE_SIMMETRIX preprocessor variable
@@ -403,18 +416,6 @@ if (MFEM_USE_CALIPER)
find_package(Caliper REQUIRED)
endif()
# AMD HIP
if (MFEM_USE_HIP)
find_package(HIP REQUIRED)
if (HIP_ARCH)
message(STATUS "Using HIP architecture: ${HIP_ARCH}")
list(APPEND HIP_HIPCC_FLAGS "--amdgpu-target=${HIP_ARCH}")
if (MFEM_USE_GINKGO)
list(APPEND HIP_HIPCC_FLAGS "-std=c++14")
endif()
endif()
endif()
# ADIOS2 for parallel I/O
if (MFEM_USE_ADIOS2)
find_package(ADIOS2 REQUIRED)
@@ -454,10 +455,11 @@ endif()
# With newer versions of SuiteSparse which include METIS header using 64-bit
# integers, the METIS header (with 32-bit indices, as used by mfem) needs to
# be before SuiteSparse.
set(MFEM_TPLS OPENMP HYPRE BLAS LAPACK SuperLUDist METIS SuiteSparse SUNDIALS PETSC
SLEPC MESQUITE MUMPS STRUMPACK AXOM FMS CONDUIT Ginkgo GNUTLS GSLIB NETCDF
MPFR PUMI HIOP POSIXCLOCKS MFEMBacktrace ZLIB OCCA CEED RAJA UMPIRE ADIOS2
CUSPARSE MKL_CPARDISO AMGX CALIPER CODIPACK BENCHMARK PARELAG MPI_CXX)
set(MFEM_TPLS OPENMP HYPRE BLAS LAPACK SuperLUDist METIS SuiteSparse SUNDIALS
PETSC SLEPC MESQUITE MUMPS STRUMPACK AXOM FMS CONDUIT Ginkgo GNUTLS GSLIB
NETCDF MPFR PUMI HIOP POSIXCLOCKS MFEMBacktrace ZLIB OCCA CEED RAJA UMPIRE
ADIOS2 CUSPARSE MKL_CPARDISO AMGX CALIPER CODIPACK BENCHMARK PARELAG
MPI_CXX HIP HIPSPARSE)
# Add all *_FOUND libraries in the variable TPL_LIBRARIES.
set(TPL_LIBRARIES "")
@@ -500,8 +502,6 @@ endforeach()
if (MFEM_USE_CUDA)
set_source_files_properties(${SOURCES} PROPERTIES LANGUAGE CUDA)
elseif(MFEM_USE_HIP)
set_source_files_properties(${SOURCES} PROPERTIES HIP_SOURCE_PROPERTY_FORMAT TRUE)
endif()
add_subdirectory(config)
+133
View File
@@ -0,0 +1,133 @@
# MFEM Code of Conduct
## Our Pledge
We as members, contributors, and leaders pledge to make participation in our
community a harassment-free experience for everyone, regardless of age, body
size, visible or invisible disability, ethnicity, sex characteristics, gender
identity and expression, level of experience, education, socio-economic status,
nationality, personal appearance, race, caste, color, religion, or sexual
identity and orientation.
We pledge to act and interact in ways that contribute to an open, welcoming,
diverse, inclusive, and healthy community.
## Our Standards
Examples of behavior that contributes to a positive environment for our
community include:
* Demonstrating empathy and kindness toward other people
* Being respectful of differing opinions, viewpoints, and experiences
* Giving and gracefully accepting constructive feedback
* Accepting responsibility and apologizing to those affected by our mistakes,
and learning from the experience
* Focusing on what is best not just for us as individuals, but for the overall
community
Examples of unacceptable behavior include:
* The use of sexualized language or imagery, and sexual attention or advances of
any kind
* Trolling, insulting or derogatory comments, and personal or political attacks
* Public or private harassment
* Publishing others' private information, such as a physical or email address,
without their explicit permission
* Other conduct which could reasonably be considered inappropriate in a
professional setting
## Enforcement Responsibilities
Community leaders are responsible for clarifying and enforcing our standards of
acceptable behavior and will take appropriate and fair corrective action in
response to any behavior that they deem inappropriate, threatening, offensive,
or harmful.
Community leaders have the right and responsibility to remove, edit, or reject
comments, commits, code, wiki edits, issues, and other contributions that are
not aligned to this Code of Conduct, and will communicate reasons for moderation
decisions when appropriate.
## Scope
This Code of Conduct applies within all community spaces, and also applies when
an individual is officially representing the community in public spaces.
Examples of representing our community include using an official e-mail address,
posting via an official social media account, or acting as an appointed
representative at an online or offline event.
## Enforcement
Instances of abusive, harassing, or otherwise unacceptable behavior may be
reported to the community leaders responsible for enforcement at mfem@llnl.gov.
All complaints will be reviewed and investigated promptly and fairly.
All community leaders are obligated to respect the privacy and security of the
reporter of any incident. Anyone involved in the reported behavior will recuse
themselves from the investigation and decision making about the resolution of
the complaint.
## Enforcement Guidelines
Community leaders will follow these Community Impact Guidelines in determining
the consequences for any action they deem in violation of this Code of Conduct:
### 1. Correction
**Community Impact**: Use of inappropriate language or other behavior deemed
unprofessional or unwelcome in the community.
**Consequence**: A private, written warning from community leaders, providing
clarity around the nature of the violation and an explanation of why the
behavior was inappropriate. A public apology may be requested.
### 2. Warning
**Community Impact**: A violation through a single incident or series of
actions.
**Consequence**: A warning with consequences for continued behavior. No
interaction with the people involved, including unsolicited interaction with
those enforcing the Code of Conduct, for a specified period of time. This
includes avoiding interactions in community spaces as well as external channels
like social media. Violating these terms may lead to a temporary or permanent
ban.
### 3. Temporary Ban
**Community Impact**: A serious violation of community standards, including
sustained inappropriate behavior.
**Consequence**: A temporary ban from any sort of interaction or public
communication with the community for a specified period of time. No public or
private interaction with the people involved, including unsolicited interaction
with those enforcing the Code of Conduct, is allowed during this period.
Violating these terms may lead to a permanent ban.
### 4. Permanent Ban
**Community Impact**: Demonstrating a pattern of violation of community
standards, including sustained inappropriate behavior, harassment of an
individual, or aggression toward or disparagement of classes of individuals.
**Consequence**: A permanent ban from any sort of public interaction within the
community.
## Attribution
This Code of Conduct is adapted from the [Contributor Covenant][homepage],
version 2.1, available at
[https://www.contributor-covenant.org/version/2/1/code_of_conduct.html][v2.1].
Community Impact Guidelines were inspired by
[Mozilla's code of conduct enforcement ladder][Mozilla CoC].
For answers to common questions about this code of conduct, see the FAQ at
[https://www.contributor-covenant.org/faq][FAQ]. Translations are available at
[https://www.contributor-covenant.org/translations][translations].
[homepage]: https://www.contributor-covenant.org
[v2.1]: https://www.contributor-covenant.org/version/2/1/code_of_conduct.html
[Mozilla CoC]: https://github.com/mozilla/diversity
[FAQ]: https://www.contributor-covenant.org/faq
[translations]: https://www.contributor-covenant.org/translations
+3
View File
@@ -21,6 +21,9 @@ documentation; new examples and miniapps; HPC performance improvements; etc.
MFEM is distributed under the terms of the BSD-3 license. All new contributions
must be made under this license.
Note also that MFEM has a [Code of Conduct](CODE_OF_CONDUCT.md). By participating
in the MFEM community, you agree to abide by its rules.
If you plan on contributing to MFEM, consider reviewing the
[issue tracker](https://github.com/mfem/mfem/issues) first to check if a thread
already exists for your desired feature or the bug you ran into. Use a pull
+10 -7
View File
@@ -37,7 +37,7 @@ as CUDA, HIP, OCCA, OpenMP and RAJA.
https://developer.nvidia.com/cuda-toolkit
- HIP support requires an AMD GPU and an installation of the ROCm software stack
https://rocm.github.io/ROCmInstall.html#installing-from-amd-rocm-repositories
https://rocmdocs.amd.com
- OCCA support requires the OCCA library
https://libocca.org
@@ -58,7 +58,8 @@ following package managers:
- Spack, https://github.com/spack/spack
- OpenHPC, http://openhpc.community
- Conda-forge, https://conda-forge.org (pre-built binaries linked with OpenMPI/MPICH, hypre, and METIS)
- Conda-forge, https://conda-forge.org (pre-built binaries linked with
OpenMPI/MPICH, hypre, and METIS)
- Homebrew/Science, https://github.com/Homebrew/homebrew-science (deprecated)
We also recommend downloading and building the MFEM-based GLVis visualization
@@ -78,7 +79,7 @@ Parallel build:
CUDA build:
make cuda -j 4
(build for a specific compute capability: 'make cuda -j 4 CUDA_ARCH=sm_30')
(build for a specific compute capability: 'make cuda -j 4 CUDA_ARCH=sm_70')
HIP build:
make hip -j 4
@@ -566,7 +567,7 @@ The specific libraries and their options are:
Options: HYPRE_OPT, HYPRE_LIB.
Versions: HYPRE >= 2.10.0b (HYPRE built without CUDA)
HYPRE >= 2.20.0 (HYPRE built with '--enable-mixedint')
HYPRE >= 2.22.1 (HYPRE built with CUDA)
HYPRE >= 2.22.1 (HYPRE built with CUDA or HIP)
- METIS, used when MFEM_USE_METIS = YES. If using METIS 5, set
MFEM_USE_METIS_5 = YES (default is to use METIS 4).
@@ -639,7 +640,8 @@ The specific libraries and their options are:
C++ compiler that supports the C++-14 standard. For additional requirements
and dependencies of specific modules, see the Ginkgo webpage below.
URL: https://ginkgo-project.github.io
Options: GINKGO_OPT, GINKGO_LIB, GINKGO_DIR, GINKGO_BUILD_TYPE (Release or Debug).
Options: GINKGO_OPT, GINKGO_LIB, GINKGO_DIR, GINKGO_BUILD_TYPE (Release or
Debug).
Versions: Ginkgo >= 1.4.0.
- AmgX (optional), used when MFEM_USE_AMGX = YES.
@@ -704,7 +706,7 @@ The specific libraries and their options are:
URL: https://scorec.rpi.edu/pumi
https://github.com/SCOREC/core
Options: PUMI_OPT, PUMI_LIB.
Versions: PUMI == 2.2.3.
Versions: PUMI >= 2.2.6.
- HiOp (optional), used when MFEM_USE_HIOP = YES.
URL: https://github.com/LLNL/hiop
@@ -737,7 +739,7 @@ The specific libraries and their options are:
Versions: CUDA >= 10.1.168.
- HIP (optional), used when MFEM_USE_HIP = YES.
URL: https://rocm.github.io/ROCmInstall.html
URL: https://rocmdocs.amd.com
Options: HIP_CXX, HIP_ARCH, HIP_OPT, HIP_LIB.
- OCCA (optional), used when MFEM_USE_OCCA = YES.
@@ -924,6 +926,7 @@ MFEM_USE_HIOP
MFEM_USE_CODIPACK
MFEM_USE_ADFORWARD
MFEM_USE_CUDA
MFEM_USE_HIP
MFEM_USE_OCCA
MFEM_USE_CEED
MFEM_USE_RAJA
+3 -3
View File
@@ -12,6 +12,9 @@ to enable high-performance scalable finite element discretization research and
application development on a wide variety of platforms, ranging from laptops to
supercomputers.
We welcome contributions and feedback from the community. Please see the file
CONTRIBUTING.md for additional details about our development process.
* For building instructions, see the file INSTALL, or type "make help".
* Copyright and licensing information can be found in files LICENSE and NOTICE.
@@ -19,9 +22,6 @@ supercomputers.
* The best starting point for new users interested in MFEM's features is to
review the examples and miniapps at https://mfem.org/examples.
* Developers interested in contributing to the library, should read the
instructions and documentation in the CONTRIBUTING.md file.
Conceptually, MFEM can be viewed as a finite element toolbox that provides the
building blocks for developing finite element algorithms in a manner similar to
that of MATLAB for linear algebra methods. In particular, MFEM provides support
-692
View File
@@ -1,692 +0,0 @@
###############################################################################
# FindHIP.cmake
###############################################################################
include(CheckCXXCompilerFlag)
###############################################################################
# SET: Variable defaults
###############################################################################
# User defined flags
set(HIP_HIPCC_FLAGS "" CACHE STRING "Semicolon delimited flags for HIPCC")
set(HIP_HCC_FLAGS "" CACHE STRING "Semicolon delimited flags for HCC")
set(HIP_CLANG_FLAGS "" CACHE STRING "Semicolon delimited flags for CLANG")
set(HIP_NVCC_FLAGS "" CACHE STRING "Semicolon delimted flags for NVCC")
mark_as_advanced(HIP_HIPCC_FLAGS HIP_HCC_FLAGS HIP_CLANG_FLAGS HIP_NVCC_FLAGS)
set(_hip_configuration_types ${CMAKE_CONFIGURATION_TYPES} ${CMAKE_BUILD_TYPE} Debug MinSizeRel Release RelWithDebInfo)
list(REMOVE_DUPLICATES _hip_configuration_types)
foreach(config ${_hip_configuration_types})
string(TOUPPER ${config} config_upper)
set(HIP_HIPCC_FLAGS_${config_upper} "" CACHE STRING "Semicolon delimited flags for HIPCC")
set(HIP_HCC_FLAGS_${config_upper} "" CACHE STRING "Semicolon delimited flags for HCC")
set(HIP_CLANG_FLAGS_${config_upper} "" CACHE STRING "Semicolon delimited flags for CLANG")
set(HIP_NVCC_FLAGS_${config_upper} "" CACHE STRING "Semicolon delimited flags for NVCC")
mark_as_advanced(HIP_HIPCC_FLAGS_${config_upper} HIP_HCC_FLAGS_${config_upper} HIP_CLANG_FLAGS_${config_upper} HIP_NVCC_FLAGS_${config_upper})
endforeach()
option(HIP_HOST_COMPILATION_CPP "Host code compilation mode" ON)
option(HIP_VERBOSE_BUILD "Print out the commands run while compiling the HIP source file. With the Makefile generator this defaults to VERBOSE variable specified on the command line, but can be forced on with this option." OFF)
mark_as_advanced(HIP_HOST_COMPILATION_CPP)
###############################################################################
# FIND: HIP and associated helper binaries
###############################################################################
get_filename_component(_IMPORT_PREFIX "${CMAKE_CURRENT_LIST_DIR}/../" REALPATH)
# HIP is supported on Linux only
if(UNIX AND NOT APPLE AND NOT CYGWIN)
# Search for HIP installation
if(NOT HIP_ROOT_DIR)
# Search in user specified path first
find_path(
HIP_ROOT_DIR
NAMES bin/hipconfig
PATHS
"$ENV{ROCM_PATH}/hip"
ENV HIP_PATH
${_IMPORT_PREFIX}
/opt/rocm/hip
DOC "HIP installed location"
NO_DEFAULT_PATH
)
if(NOT EXISTS ${HIP_ROOT_DIR})
if(HIP_FIND_REQUIRED)
message(FATAL_ERROR "Specify HIP_ROOT_DIR")
elseif(NOT HIP_FIND_QUIETLY)
message("HIP_ROOT_DIR not found or specified")
endif()
endif()
# And push it back to the cache
set(HIP_ROOT_DIR ${HIP_ROOT_DIR} CACHE PATH "HIP installed location" FORCE)
endif()
# Find HIPCC executable
find_program(
HIP_HIPCC_EXECUTABLE
NAMES hipcc
PATHS
"${HIP_ROOT_DIR}"
ENV ROCM_PATH
ENV HIP_PATH
/opt/rocm
/opt/rocm/hip
PATH_SUFFIXES bin
NO_DEFAULT_PATH
)
if(NOT HIP_HIPCC_EXECUTABLE)
# Now search in default paths
find_program(HIP_HIPCC_EXECUTABLE hipcc)
endif()
mark_as_advanced(HIP_HIPCC_EXECUTABLE)
# Find HIPCONFIG executable
find_program(
HIP_HIPCONFIG_EXECUTABLE
NAMES hipconfig
PATHS
"${HIP_ROOT_DIR}"
ENV ROCM_PATH
ENV HIP_PATH
/opt/rocm
/opt/rocm/hip
PATH_SUFFIXES bin
NO_DEFAULT_PATH
)
if(NOT HIP_HIPCONFIG_EXECUTABLE)
# Now search in default paths
find_program(HIP_HIPCONFIG_EXECUTABLE hipconfig)
endif()
mark_as_advanced(HIP_HIPCONFIG_EXECUTABLE)
# Find HIPCC_CMAKE_LINKER_HELPER executable
find_program(
HIP_HIPCC_CMAKE_LINKER_HELPER
NAMES hipcc_cmake_linker_helper
PATHS
"${HIP_ROOT_DIR}"
ENV ROCM_PATH
ENV HIP_PATH
/opt/rocm
/opt/rocm/hip
PATH_SUFFIXES bin
NO_DEFAULT_PATH
)
if(NOT HIP_HIPCC_CMAKE_LINKER_HELPER)
# Now search in default paths
find_program(HIP_HIPCC_CMAKE_LINKER_HELPER hipcc_cmake_linker_helper)
endif()
mark_as_advanced(HIP_HIPCC_CMAKE_LINKER_HELPER)
if(HIP_HIPCONFIG_EXECUTABLE AND NOT HIP_VERSION)
# Compute the version
execute_process(
COMMAND ${HIP_HIPCONFIG_EXECUTABLE} --version
OUTPUT_VARIABLE _hip_version
ERROR_VARIABLE _hip_error
OUTPUT_STRIP_TRAILING_WHITESPACE
ERROR_STRIP_TRAILING_WHITESPACE
)
if(NOT _hip_error)
set(HIP_VERSION ${_hip_version} CACHE STRING "Version of HIP as computed from hipcc")
else()
set(HIP_VERSION "0.0.0" CACHE STRING "Version of HIP as computed by FindHIP()")
endif()
mark_as_advanced(HIP_VERSION)
endif()
if(HIP_VERSION)
string(REPLACE "." ";" _hip_version_list "${HIP_VERSION}")
list(GET _hip_version_list 0 HIP_VERSION_MAJOR)
list(GET _hip_version_list 1 HIP_VERSION_MINOR)
list(GET _hip_version_list 2 HIP_VERSION_PATCH)
set(HIP_VERSION_STRING "${HIP_VERSION}")
endif()
if(HIP_HIPCONFIG_EXECUTABLE AND NOT HIP_PLATFORM)
# Compute the platform
execute_process(
COMMAND ${HIP_HIPCONFIG_EXECUTABLE} --platform
OUTPUT_VARIABLE _hip_platform
OUTPUT_STRIP_TRAILING_WHITESPACE
)
set(HIP_PLATFORM ${_hip_platform} CACHE STRING "HIP platform as computed by hipconfig")
mark_as_advanced(HIP_PLATFORM)
endif()
if(HIP_HIPCONFIG_EXECUTABLE AND NOT HIP_COMPILER)
# Compute the compiler
execute_process(
COMMAND ${HIP_HIPCONFIG_EXECUTABLE} --compiler
OUTPUT_VARIABLE _hip_compiler
OUTPUT_STRIP_TRAILING_WHITESPACE
)
set(HIP_COMPILER ${_hip_compiler} CACHE STRING "HIP compiler as computed by hipconfig")
mark_as_advanced(HIP_COMPILER)
endif()
if(HIP_HIPCONFIG_EXECUTABLE AND NOT HIP_RUNTIME)
# Compute the runtime
execute_process(
COMMAND ${HIP_HIPCONFIG_EXECUTABLE} --runtime
OUTPUT_VARIABLE _hip_runtime
OUTPUT_STRIP_TRAILING_WHITESPACE
)
set(HIP_RUNTIME ${_hip_runtime} CACHE STRING "HIP runtime as computed by hipconfig")
mark_as_advanced(HIP_RUNTIME)
endif()
endif()
include(FindPackageHandleStandardArgs)
find_package_handle_standard_args(
HIP
REQUIRED_VARS
HIP_ROOT_DIR
HIP_HIPCC_EXECUTABLE
HIP_HIPCONFIG_EXECUTABLE
HIP_PLATFORM
HIP_COMPILER
HIP_RUNTIME
VERSION_VAR HIP_VERSION
)
###############################################################################
# Set HIP CMAKE Flags
###############################################################################
# Copy the invocation styles from CXX to HIP
set(CMAKE_HIP_ARCHIVE_CREATE ${CMAKE_CXX_ARCHIVE_CREATE})
set(CMAKE_HIP_ARCHIVE_APPEND ${CMAKE_CXX_ARCHIVE_APPEND})
set(CMAKE_HIP_ARCHIVE_FINISH ${CMAKE_CXX_ARCHIVE_FINISH})
set(CMAKE_SHARED_LIBRARY_SONAME_HIP_FLAG ${CMAKE_SHARED_LIBRARY_SONAME_CXX_FLAG})
set(CMAKE_SHARED_LIBRARY_CREATE_HIP_FLAGS ${CMAKE_SHARED_LIBRARY_CREATE_CXX_FLAGS})
set(CMAKE_SHARED_LIBRARY_HIP_FLAGS ${CMAKE_SHARED_LIBRARY_CXX_FLAGS})
#set(CMAKE_SHARED_LIBRARY_LINK_HIP_FLAGS ${CMAKE_SHARED_LIBRARY_LINK_CXX_FLAGS})
set(CMAKE_SHARED_LIBRARY_RUNTIME_HIP_FLAG ${CMAKE_SHARED_LIBRARY_RUNTIME_CXX_FLAG})
set(CMAKE_SHARED_LIBRARY_RUNTIME_HIP_FLAG_SEP ${CMAKE_SHARED_LIBRARY_RUNTIME_CXX_FLAG_SEP})
set(CMAKE_SHARED_LIBRARY_LINK_STATIC_HIP_FLAGS ${CMAKE_SHARED_LIBRARY_LINK_STATIC_CXX_FLAGS})
set(CMAKE_SHARED_LIBRARY_LINK_DYNAMIC_HIP_FLAGS ${CMAKE_SHARED_LIBRARY_LINK_DYNAMIC_CXX_FLAGS})
set(HIP_CLANG_PARALLEL_BUILD_COMPILE_OPTIONS "")
set(HIP_CLANG_PARALLEL_BUILD_LINK_OPTIONS "")
if("${HIP_COMPILER}" STREQUAL "nvcc")
# Set the CMake Flags to use the nvcc Compiler.
set(CMAKE_HIP_CREATE_SHARED_LIBRARY "${HIP_HIPCC_CMAKE_LINKER_HELPER} <CMAKE_SHARED_LIBRARY_CXX_FLAGS> <LANGUAGE_COMPILE_FLAGS> <LINK_FLAGS> <CMAKE_SHARED_LIBRARY_CREATE_CXX_FLAGS> <SONAME_FLAG><TARGET_SONAME> -o <TARGET> <OBJECTS> <LINK_LIBRARIES>")
set(CMAKE_HIP_CREATE_SHARED_MODULE "${HIP_HIPCC_CMAKE_LINKER_HELPER} <CMAKE_CXX_LINK_FLAGS> <LINK_FLAGS> <OBJECTS> <SONAME_FLAG><TARGET_SONAME> -o <TARGET> <LINK_LIBRARIES> -shared" )
set(CMAKE_HIP_LINK_EXECUTABLE "${HIP_HIPCC_CMAKE_LINKER_HELPER} <FLAGS> <CMAKE_CXX_LINK_FLAGS> <LINK_FLAGS> <OBJECTS> -o <TARGET> <LINK_LIBRARIES>")
elseif("${HIP_COMPILER}" STREQUAL "hcc")
# Set the CMake Flags to use the hcc Compiler.
set(CMAKE_HIP_CREATE_SHARED_LIBRARY "${HIP_HIPCC_CMAKE_LINKER_HELPER} ${HCC_HOME} <CMAKE_SHARED_LIBRARY_CXX_FLAGS> <LANGUAGE_COMPILE_FLAGS> <LINK_FLAGS> <CMAKE_SHARED_LIBRARY_CREATE_CXX_FLAGS> <SONAME_FLAG><TARGET_SONAME> -o <TARGET> <OBJECTS> <LINK_LIBRARIES>")
set(CMAKE_HIP_CREATE_SHARED_MODULE "${HIP_HIPCC_CMAKE_LINKER_HELPER} ${HCC_HOME} <CMAKE_CXX_LINK_FLAGS> <LINK_FLAGS> <OBJECTS> <SONAME_FLAG><TARGET_SONAME> -o <TARGET> <LINK_LIBRARIES> -shared" )
set(CMAKE_HIP_LINK_EXECUTABLE "${HIP_HIPCC_CMAKE_LINKER_HELPER} ${HCC_HOME} <FLAGS> <CMAKE_CXX_LINK_FLAGS> <LINK_FLAGS> <OBJECTS> -o <TARGET> <LINK_LIBRARIES>")
elseif("${HIP_COMPILER}" STREQUAL "clang")
#Number of parallel jobs by default is 1
if(NOT DEFINED HIP_CLANG_NUM_PARALLEL_JOBS)
set(HIP_CLANG_NUM_PARALLEL_JOBS 1)
endif()
#Add support for parallel build and link
if(${CMAKE_CXX_COMPILER_ID} STREQUAL "Clang")
check_cxx_compiler_flag("-parallel-jobs=1" HIP_CLANG_SUPPORTS_PARALLEL_JOBS)
endif()
if(HIP_CLANG_NUM_PARALLEL_JOBS GREATER 1)
if(${HIP_CLANG_SUPPORTS_PARALLEL_JOBS})
set(HIP_CLANG_PARALLEL_BUILD_COMPILE_OPTIONS "-Wno-format-nonliteral -parallel-jobs=${HIP_CLANG_NUM_PARALLEL_JOBS}")
set(HIP_CLANG_PARALLEL_BUILD_LINK_OPTIONS "-parallel-jobs=${HIP_CLANG_NUM_PARALLEL_JOBS}")
else()
message("clang compiler doesn't support parallel jobs")
endif()
endif()
# Set the CMake Flags to use the HIP-Clang Compiler.
set(CMAKE_HIP_CREATE_SHARED_LIBRARY "${HIP_HIPCC_CMAKE_LINKER_HELPER} ${HIP_CLANG_PATH} ${HIP_CLANG_PARALLEL_BUILD_LINK_OPTIONS} <CMAKE_SHARED_LIBRARY_CXX_FLAGS> <LANGUAGE_COMPILE_FLAGS> <LINK_FLAGS> <CMAKE_SHARED_LIBRARY_CREATE_CXX_FLAGS> <SONAME_FLAG><TARGET_SONAME> -o <TARGET> <OBJECTS> <LINK_LIBRARIES>")
set(CMAKE_HIP_CREATE_SHARED_MODULE "${HIP_HIPCC_CMAKE_LINKER_HELPER} ${HIP_CLANG_PATH} ${HIP_CLANG_PARALLEL_BUILD_LINK_OPTIONS} <CMAKE_CXX_LINK_FLAGS> <LINK_FLAGS> <OBJECTS> <SONAME_FLAG><TARGET_SONAME> -o <TARGET> <LINK_LIBRARIES> -shared" )
set(CMAKE_HIP_LINK_EXECUTABLE "${HIP_HIPCC_CMAKE_LINKER_HELPER} ${HIP_CLANG_PATH} ${HIP_CLANG_PARALLEL_BUILD_LINK_OPTIONS} <FLAGS> <CMAKE_CXX_LINK_FLAGS> <LINK_FLAGS> <OBJECTS> -o <TARGET> <LINK_LIBRARIES>")
if("${HIP_RUNTIME}" STREQUAL "rocclr")
if(TARGET host)
message(STATUS "host interface - found")
set(HIP_HOST_INTERFACE host)
endif()
endif()
endif()
###############################################################################
# MACRO: Locate helper files
###############################################################################
macro(HIP_FIND_HELPER_FILE _name _extension)
set(_hip_full_name "${_name}.${_extension}")
get_filename_component(CMAKE_CURRENT_LIST_DIR "${CMAKE_CURRENT_LIST_FILE}" PATH)
set(HIP_${_name} "${CMAKE_CURRENT_LIST_DIR}/FindHIP/${_hip_full_name}")
if(NOT EXISTS "${HIP_${_name}}")
set(error_message "${_hip_full_name} not found in ${CMAKE_CURRENT_LIST_DIR}/FindHIP")
if(HIP_FIND_REQUIRED)
message(FATAL_ERROR "${error_message}")
else()
if(NOT HIP_FIND_QUIETLY)
message(STATUS "${error_message}")
endif()
endif()
endif()
# Set this variable as internal, so the user isn't bugged with it.
set(HIP_${_name} ${HIP_${_name}} CACHE INTERNAL "Location of ${_full_name}" FORCE)
endmacro()
###############################################################################
hip_find_helper_file(run_make2cmake cmake)
hip_find_helper_file(run_hipcc cmake)
###############################################################################
###############################################################################
# MACRO: Reset compiler flags
###############################################################################
macro(HIP_RESET_FLAGS)
unset(HIP_HIPCC_FLAGS)
unset(HIP_HCC_FLAGS)
unset(HIP_CLANG_FLAGS)
unset(HIP_NVCC_FLAGS)
foreach(config ${_hip_configuration_types})
string(TOUPPER ${config} config_upper)
unset(HIP_HIPCC_FLAGS_${config_upper})
unset(HIP_HCC_FLAGS_${config_upper})
unset(HIP_CLANG_FLAGS_${config_upper})
unset(HIP_NVCC_FLAGS_${config_upper})
endforeach()
endmacro()
###############################################################################
# MACRO: Separate the options from the sources
###############################################################################
macro(HIP_GET_SOURCES_AND_OPTIONS _sources _cmake_options _hipcc_options _hcc_options _clang_options _nvcc_options)
set(${_sources})
set(${_cmake_options})
set(${_hipcc_options})
set(${_hcc_options})
set(${_clang_options})
set(${_nvcc_options})
set(_hipcc_found_options FALSE)
set(_hcc_found_options FALSE)
set(_clang_found_options FALSE)
set(_nvcc_found_options FALSE)
foreach(arg ${ARGN})
if("x${arg}" STREQUAL "xHIPCC_OPTIONS")
set(_hipcc_found_options TRUE)
set(_hcc_found_options FALSE)
set(_clang_found_options FALSE)
set(_nvcc_found_options FALSE)
elseif("x${arg}" STREQUAL "xHCC_OPTIONS")
set(_hipcc_found_options FALSE)
set(_hcc_found_options TRUE)
set(_clang_found_options FALSE)
set(_nvcc_found_options FALSE)
elseif("x${arg}" STREQUAL "xCLANG_OPTIONS")
set(_hipcc_found_options FALSE)
set(_hcc_found_options FALSE)
set(_clang_found_options TRUE)
set(_nvcc_found_options FALSE)
elseif("x${arg}" STREQUAL "xNVCC_OPTIONS")
set(_hipcc_found_options FALSE)
set(_hcc_found_options FALSE)
set(_clang_found_options FALSE)
set(_nvcc_found_options TRUE)
elseif(
"x${arg}" STREQUAL "xEXCLUDE_FROM_ALL" OR
"x${arg}" STREQUAL "xSTATIC" OR
"x${arg}" STREQUAL "xSHARED" OR
"x${arg}" STREQUAL "xMODULE"
)
list(APPEND ${_cmake_options} ${arg})
else()
if(_hipcc_found_options)
list(APPEND ${_hipcc_options} ${arg})
elseif(_hcc_found_options)
list(APPEND ${_hcc_options} ${arg})
elseif(_clang_found_options)
list(APPEND ${_clang_options} ${arg})
elseif(_nvcc_found_options)
list(APPEND ${_nvcc_options} ${arg})
else()
# Assume this is a file
list(APPEND ${_sources} ${arg})
endif()
endif()
endforeach()
endmacro()
###############################################################################
# MACRO: Add include directories to pass to the hipcc command
###############################################################################
set(HIP_HIPCC_INCLUDE_ARGS_USER "")
macro(HIP_INCLUDE_DIRECTORIES)
foreach(dir ${ARGN})
list(APPEND HIP_HIPCC_INCLUDE_ARGS_USER $<$<BOOL:${dir}>:-I${dir}>)
endforeach()
endmacro()
###############################################################################
# FUNCTION: Helper to avoid clashes of files with the same basename but different paths
###############################################################################
function(HIP_COMPUTE_BUILD_PATH path build_path)
# Convert to cmake style paths
file(TO_CMAKE_PATH "${path}" bpath)
if(IS_ABSOLUTE "${bpath}")
string(FIND "${bpath}" "${CMAKE_CURRENT_BINARY_DIR}" _binary_dir_pos)
if(_binary_dir_pos EQUAL 0)
file(RELATIVE_PATH bpath "${CMAKE_CURRENT_BINARY_DIR}" "${bpath}")
else()
file(RELATIVE_PATH bpath "${CMAKE_CURRENT_SOURCE_DIR}" "${bpath}")
endif()
endif()
# Remove leading /
string(REGEX REPLACE "^[/]+" "" bpath "${bpath}")
# Avoid absolute paths by removing ':'
string(REPLACE ":" "_" bpath "${bpath}")
# Avoid relative paths that go up the tree
string(REPLACE "../" "__/" bpath "${bpath}")
# Avoid spaces
string(REPLACE " " "_" bpath "${bpath}")
# Strip off the filename
get_filename_component(bpath "${bpath}" PATH)
set(${build_path} "${bpath}" PARENT_SCOPE)
endfunction()
###############################################################################
# MACRO: Parse OPTIONS from ARGN & set variables prefixed by _option_prefix
###############################################################################
macro(HIP_PARSE_HIPCC_OPTIONS _option_prefix)
set(_hip_found_config)
foreach(arg ${ARGN})
# Determine if we are dealing with a per-configuration flag
foreach(config ${_hip_configuration_types})
string(TOUPPER ${config} config_upper)
if(arg STREQUAL "${config_upper}")
set(_hip_found_config _${arg})
# Clear arg to prevent it from being processed anymore
set(arg)
endif()
endforeach()
if(arg)
list(APPEND ${_option_prefix}${_hip_found_config} "${arg}")
endif()
endforeach()
endmacro()
###############################################################################
# MACRO: Try and include dependency file if it exists
###############################################################################
macro(HIP_INCLUDE_HIPCC_DEPENDENCIES dependency_file)
set(HIP_HIPCC_DEPEND)
set(HIP_HIPCC_DEPEND_REGENERATE FALSE)
# Create the dependency file if it doesn't exist
if(NOT EXISTS ${dependency_file})
file(WRITE ${dependency_file} "# Generated by: FindHIP.cmake. Do not edit.\n")
endif()
# Include the dependency file
include(${dependency_file})
# Verify the existence of all the included files
if(HIP_HIPCC_DEPEND)
foreach(f ${HIP_HIPCC_DEPEND})
if(NOT EXISTS ${f})
# If they aren't there, regenerate the file again
set(HIP_HIPCC_DEPEND_REGENERATE TRUE)
endif()
endforeach()
else()
# No dependencies, so regenerate the file
set(HIP_HIPCC_DEPEND_REGENERATE TRUE)
endif()
# Regenerate the dependency file if needed
if(HIP_HIPCC_DEPEND_REGENERATE)
set(HIP_HIPCC_DEPEND ${dependency_file})
file(WRITE ${dependency_file} "# Generated by: FindHIP.cmake. Do not edit.\n")
endif()
endmacro()
###############################################################################
# MACRO: Prepare cmake commands for the target
###############################################################################
macro(HIP_PREPARE_TARGET_COMMANDS _target _format _generated_files _source_files)
set(_hip_flags "")
string(TOUPPER "${CMAKE_BUILD_TYPE}" _hip_build_configuration)
if(HIP_HOST_COMPILATION_CPP)
set(HIP_C_OR_CXX CXX)
else()
set(HIP_C_OR_CXX C)
endif()
set(generated_extension ${CMAKE_${HIP_C_OR_CXX}_OUTPUT_EXTENSION})
# Initialize list of includes with those specified by the user. Append with
# ones specified to cmake directly.
set(HIP_HIPCC_INCLUDE_ARGS ${HIP_HIPCC_INCLUDE_ARGS_USER})
# Add the include directories
set(include_directories_generator "$<TARGET_PROPERTY:${_target},INCLUDE_DIRECTORIES>")
list(APPEND HIP_HIPCC_INCLUDE_ARGS "$<$<BOOL:${include_directories_generator}>:-I$<JOIN:${include_directories_generator}, -I>>")
get_directory_property(_hip_include_directories INCLUDE_DIRECTORIES)
list(REMOVE_DUPLICATES _hip_include_directories)
if(_hip_include_directories)
foreach(dir ${_hip_include_directories})
list(APPEND HIP_HIPCC_INCLUDE_ARGS $<$<BOOL:${dir}>:-I${dir}>)
endforeach()
endif()
HIP_GET_SOURCES_AND_OPTIONS(_hip_sources _hip_cmake_options _hipcc_options _hcc_options _clang_options _nvcc_options ${ARGN})
HIP_PARSE_HIPCC_OPTIONS(HIP_HIPCC_FLAGS ${_hipcc_options})
HIP_PARSE_HIPCC_OPTIONS(HIP_HCC_FLAGS ${_hcc_options})
HIP_PARSE_HIPCC_OPTIONS(HIP_CLANG_FLAGS ${_clang_options})
HIP_PARSE_HIPCC_OPTIONS(HIP_NVCC_FLAGS ${_nvcc_options})
# Add the compile definitions
set(compile_definition_generator "$<TARGET_PROPERTY:${_target},COMPILE_DEFINITIONS>")
list(APPEND HIP_HIPCC_FLAGS "$<$<BOOL:${compile_definition_generator}>:-D$<JOIN:${compile_definition_generator}, -D>>")
# Check if we are building shared library.
set(_hip_build_shared_libs FALSE)
list(FIND _hip_cmake_options SHARED _hip_found_SHARED)
list(FIND _hip_cmake_options MODULE _hip_found_MODULE)
if(_hip_found_SHARED GREATER -1 OR _hip_found_MODULE GREATER -1)
set(_hip_build_shared_libs TRUE)
endif()
list(FIND _hip_cmake_options STATIC _hip_found_STATIC)
if(_hip_found_STATIC GREATER -1)
set(_hip_build_shared_libs FALSE)
endif()
# If we are building a shared library, add extra flags to HIP_HIPCC_FLAGS
if(_hip_build_shared_libs)
list(APPEND HIP_HCC_FLAGS "-fPIC")
list(APPEND HIP_CLANG_FLAGS "-fPIC")
list(APPEND HIP_NVCC_FLAGS "--shared -Xcompiler '-fPIC'")
endif()
# Set host compiler
set(HIP_HOST_COMPILER "${CMAKE_${HIP_C_OR_CXX}_COMPILER}")
# Set compiler flags
set(_HIP_HOST_FLAGS "set(CMAKE_HOST_FLAGS ${CMAKE_${HIP_C_OR_CXX}_FLAGS})")
set(_HIP_HIPCC_FLAGS "set(HIP_HIPCC_FLAGS ${HIP_HIPCC_FLAGS})")
set(_HIP_HCC_FLAGS "set(HIP_HCC_FLAGS ${HIP_HCC_FLAGS})")
set(_HIP_CLANG_FLAGS "set(HIP_CLANG_FLAGS ${HIP_CLANG_FLAGS})")
set(_HIP_NVCC_FLAGS "set(HIP_NVCC_FLAGS ${HIP_NVCC_FLAGS})")
foreach(config ${_hip_configuration_types})
string(TOUPPER ${config} config_upper)
set(_HIP_HOST_FLAGS "${_HIP_HOST_FLAGS}\nset(CMAKE_HOST_FLAGS_${config_upper} ${CMAKE_${HIP_C_OR_CXX}_FLAGS_${config_upper}})")
set(_HIP_HIPCC_FLAGS "${_HIP_HIPCC_FLAGS}\nset(HIP_HIPCC_FLAGS_${config_upper} ${HIP_HIPCC_FLAGS_${config_upper}})")
set(_HIP_HCC_FLAGS "${_HIP_HCC_FLAGS}\nset(HIP_HCC_FLAGS_${config_upper} ${HIP_HCC_FLAGS_${config_upper}})")
set(_HIP_CLANG_FLAGS "${_HIP_CLANG_FLAGS}\nset(HIP_CLANG_FLAGS_${config_upper} ${HIP_CLANG_FLAGS_${config_upper}})")
set(_HIP_NVCC_FLAGS "${_HIP_NVCC_FLAGS}\nset(HIP_NVCC_FLAGS_${config_upper} ${HIP_NVCC_FLAGS_${config_upper}})")
endforeach()
# Reset the output variable
set(_hip_generated_files "")
set(_hip_source_files "")
# Iterate over all arguments and create custom commands for all source files
foreach(file ${ARGN})
# Ignore any file marked as a HEADER_FILE_ONLY
get_source_file_property(_is_header ${file} HEADER_FILE_ONLY)
# Allow per source file overrides of the format. Also allows compiling non .cu files.
get_source_file_property(_hip_source_format ${file} HIP_SOURCE_PROPERTY_FORMAT)
if((${file} MATCHES "\\.cu$" OR _hip_source_format) AND NOT _is_header)
set(host_flag FALSE)
else()
set(host_flag TRUE)
endif()
if(NOT host_flag)
# Determine output directory
HIP_COMPUTE_BUILD_PATH("${file}" hip_build_path)
set(hip_compile_output_dir "${CMAKE_CURRENT_BINARY_DIR}/CMakeFiles/${_target}.dir/${hip_build_path}")
get_filename_component(basename ${file} NAME)
set(generated_file_path "${hip_compile_output_dir}/${CMAKE_CFG_INTDIR}")
set(generated_file_basename "${_target}_generated_${basename}${generated_extension}")
# Set file names
set(generated_file "${generated_file_path}/${generated_file_basename}")
set(cmake_dependency_file "${hip_compile_output_dir}/${generated_file_basename}.depend")
set(custom_target_script_pregen "${hip_compile_output_dir}/${generated_file_basename}.cmake.pre-gen")
set(custom_target_script "${hip_compile_output_dir}/${generated_file_basename}.cmake")
# Set properties for object files
set_source_files_properties("${generated_file}"
PROPERTIES
EXTERNAL_OBJECT true # This is an object file not to be compiled, but only be linked
)
# Don't add CMAKE_CURRENT_SOURCE_DIR if the path is already an absolute path
get_filename_component(file_path "${file}" PATH)
if(IS_ABSOLUTE "${file_path}")
set(source_file "${file}")
else()
set(source_file "${CMAKE_CURRENT_SOURCE_DIR}/${file}")
endif()
# Bring in the dependencies
HIP_INCLUDE_HIPCC_DEPENDENCIES(${cmake_dependency_file})
# Configure the build script
configure_file("${HIP_run_hipcc}" "${custom_target_script_pregen}" @ONLY)
file(GENERATE
OUTPUT "${custom_target_script}"
INPUT "${custom_target_script_pregen}"
)
set(main_dep DEPENDS ${source_file})
if(CMAKE_GENERATOR MATCHES "Makefiles")
set(verbose_output "$(VERBOSE)")
elseif(HIP_VERBOSE_BUILD)
set(verbose_output ON)
else()
set(verbose_output OFF)
endif()
# Create up the comment string
file(RELATIVE_PATH generated_file_relative_path "${CMAKE_BINARY_DIR}" "${generated_file}")
set(hip_build_comment_string "Building HIPCC object ${generated_file_relative_path}")
# Build the generated file and dependency file
add_custom_command(
OUTPUT ${generated_file}
# These output files depend on the source_file and the contents of cmake_dependency_file
${main_dep}
DEPENDS ${HIP_HIPCC_DEPEND}
DEPENDS ${custom_target_script}
# Make sure the output directory exists before trying to write to it.
COMMAND ${CMAKE_COMMAND} -E make_directory "${generated_file_path}"
COMMAND ${CMAKE_COMMAND} ARGS
-D verbose:BOOL=${verbose_output}
-D build_configuration:STRING=${_hip_build_configuration}
-D "generated_file:STRING=${generated_file}"
-P "${custom_target_script}"
WORKING_DIRECTORY "${hip_compile_output_dir}"
COMMENT "${hip_build_comment_string}"
)
# Make sure the build system knows the file is generated
set_source_files_properties(${generated_file} PROPERTIES GENERATED TRUE)
list(APPEND _hip_generated_files ${generated_file})
list(APPEND _hip_source_files ${file})
endif()
endforeach()
# Set the return parameter
set(${_generated_files} ${_hip_generated_files})
set(${_source_files} ${_hip_source_files})
endmacro()
###############################################################################
# HIP_ADD_EXECUTABLE
###############################################################################
macro(HIP_ADD_EXECUTABLE hip_target)
# Separate the sources from the options
HIP_GET_SOURCES_AND_OPTIONS(_sources _cmake_options _hipcc_options _hcc_options _clang_options _nvcc_options ${ARGN})
HIP_PREPARE_TARGET_COMMANDS(${hip_target} OBJ _generated_files _source_files ${_sources} HIPCC_OPTIONS ${_hipcc_options} HCC_OPTIONS ${_hcc_options} CLANG_OPTIONS ${_clang_options} NVCC_OPTIONS ${_nvcc_options})
if(_source_files)
list(REMOVE_ITEM _sources ${_source_files})
endif()
if("${HIP_COMPILER}" STREQUAL "hcc")
if("x${HCC_HOME}" STREQUAL "x")
if (DEFINED ENV{ROCM_PATH})
set(HCC_HOME "$ENV{ROCM_PATH}/hcc")
elseif(DEFINED ENV{HIP_PATH})
set(HCC_HOME "$ENV{HIP_PATH}/../hcc")
else()
set(HCC_HOME "/opt/rocm/hcc")
endif()
endif()
set(CMAKE_HIP_LINK_EXECUTABLE "${HIP_HIPCC_CMAKE_LINKER_HELPER} ${HCC_HOME} <FLAGS> <CMAKE_CXX_LINK_FLAGS> <LINK_FLAGS> <OBJECTS> -o <TARGET> <LINK_LIBRARIES>")
elseif("${HIP_COMPILER}" STREQUAL "clang")
if("x${HIP_CLANG_PATH}" STREQUAL "x")
if(DEFINED ENV{HIP_CLANG_PATH})
set(HIP_CLANG_PATH $ENV{HIP_CLANG_PATH})
elseif(DEFINED ENV{ROCM_PATH})
set(HIP_CLANG_PATH "$ENV{ROCM_PATH}/llvm/bin")
elseif(DEFINED ENV{HIP_PATH})
set(HIP_CLANG_PATH "$ENV{HIP_PATH}/../llvm/bin")
else()
set(HIP_CLANG_PATH "/opt/rocm/llvm/bin")
endif()
endif()
set(CMAKE_HIP_LINK_EXECUTABLE "${HIP_HIPCC_CMAKE_LINKER_HELPER} ${HIP_CLANG_PATH} ${HIP_CLANG_PARALLEL_BUILD_LINK_OPTIONS} <FLAGS> <CMAKE_CXX_LINK_FLAGS> <LINK_FLAGS> <OBJECTS> -o <TARGET> <LINK_LIBRARIES>")
else()
set(CMAKE_HIP_LINK_EXECUTABLE "${HIP_HIPCC_CMAKE_LINKER_HELPER} <FLAGS> <CMAKE_CXX_LINK_FLAGS> <LINK_FLAGS> <OBJECTS> -o <TARGET> <LINK_LIBRARIES>")
endif()
if ("${_sources}" STREQUAL "")
add_executable(${hip_target} ${_cmake_options} ${_generated_files} "")
else()
add_executable(${hip_target} ${_cmake_options} ${_generated_files} ${_sources})
endif()
set_target_properties(${hip_target} PROPERTIES LINKER_LANGUAGE HIP)
# Link with host
if (HIP_HOST_INTERFACE)
# hip rt should be rocclr, compiler should be clang
target_link_libraries(${hip_target} ${HIP_HOST_INTERFACE})
endif()
endmacro()
###############################################################################
# HIP_ADD_LIBRARY
###############################################################################
macro(HIP_ADD_LIBRARY hip_target)
# Separate the sources from the options
HIP_GET_SOURCES_AND_OPTIONS(_sources _cmake_options _hipcc_options _hcc_options _clang_options _nvcc_options ${ARGN})
HIP_PREPARE_TARGET_COMMANDS(${hip_target} OBJ _generated_files _source_files ${_sources} ${_cmake_options} HIPCC_OPTIONS ${_hipcc_options} HCC_OPTIONS ${_hcc_options} CLANG_OPTIONS ${_clang_options} NVCC_OPTIONS ${_nvcc_options})
if(_source_files)
list(REMOVE_ITEM _sources ${_source_files})
endif()
if ("${_sources}" STREQUAL "")
add_library(${hip_target} ${_cmake_options} ${_generated_files} "")
else()
add_library(${hip_target} ${_cmake_options} ${_generated_files} ${_sources})
endif()
set_target_properties(${hip_target} PROPERTIES LINKER_LANGUAGE ${HIP_C_OR_CXX})
# Link with host
if (HIP_HOST_INTERFACE)
# hip rt should be rocclr, compiler should be clang
target_link_libraries(${hip_target} ${HIP_HOST_INTERFACE})
endif()
endmacro()
# vim: ts=4:sw=4:expandtab:smartindent
@@ -1,182 +0,0 @@
###############################################################################
# Runs commands using HIPCC
###############################################################################
###############################################################################
# This file runs the hipcc commands to produce the desired output file
# along with the dependency file needed by CMake to compute dependencies.
#
# Input variables:
#
# verbose:BOOL=<> OFF: Be as quiet as possible (default)
# ON : Describe each step
# build_configuration:STRING=<> Build configuration. Defaults to Debug.
# generated_file:STRING=<> File to generate. Mandatory argument.
if(NOT build_configuration)
set(build_configuration Debug)
endif()
if(NOT generated_file)
message(FATAL_ERROR "You must specify generated_file on the command line")
endif()
# Set these up as variables to make reading the generated file easier
set(HIP_HIPCC_EXECUTABLE "@HIP_HIPCC_EXECUTABLE@") # path
set(HIP_HIPCONFIG_EXECUTABLE "@HIP_HIPCONFIG_EXECUTABLE@") #path
set(HIP_HOST_COMPILER "@HIP_HOST_COMPILER@") # path
set(CMAKE_COMMAND "@CMAKE_COMMAND@") # path
set(HIP_run_make2cmake "@HIP_run_make2cmake@") # path
set(HCC_HOME "@HCC_HOME@") #path
set(HIP_CLANG_PATH "@HIP_CLANG_PATH@") #path
set(HIP_CLANG_PARALLEL_BUILD_COMPILE_OPTIONS "@HIP_CLANG_PARALLEL_BUILD_COMPILE_OPTIONS@")
@HIP_HOST_FLAGS@
@_HIP_HIPCC_FLAGS@
@_HIP_HCC_FLAGS@
@_HIP_CLANG_FLAGS@
@_HIP_NVCC_FLAGS@
#Needed to bring the HIP_HIPCC_INCLUDE_ARGS variable in scope
set(HIP_HIPCC_INCLUDE_ARGS @HIP_HIPCC_INCLUDE_ARGS@) # list
set(cmake_dependency_file "@cmake_dependency_file@") # path
set(source_file "@source_file@") # path
set(host_flag "@host_flag@") # bool
# Determine compiler and compiler flags
execute_process(COMMAND ${HIP_HIPCONFIG_EXECUTABLE} --platform OUTPUT_VARIABLE HIP_PLATFORM OUTPUT_STRIP_TRAILING_WHITESPACE)
execute_process(COMMAND ${HIP_HIPCONFIG_EXECUTABLE} --compiler OUTPUT_VARIABLE HIP_COMPILER OUTPUT_STRIP_TRAILING_WHITESPACE)
execute_process(COMMAND ${HIP_HIPCONFIG_EXECUTABLE} --runtime OUTPUT_VARIABLE HIP_RUNTIME OUTPUT_STRIP_TRAILING_WHITESPACE)
if(NOT host_flag)
set(__CC ${HIP_HIPCC_EXECUTABLE})
if("${HIP_PLATFORM}" STREQUAL "amd")
if("${HIP_COMPILER}" STREQUAL "hcc")
if(NOT "x${HCC_HOME}" STREQUAL "x")
set(ENV{HCC_HOME} ${HCC_HOME})
endif()
set(__CC_FLAGS ${HIP_HIPCC_FLAGS} ${HIP_HCC_FLAGS} ${HIP_HIPCC_FLAGS_${build_configuration}} ${HIP_HCC_FLAGS_${build_configuration}})
elseif("${HIP_COMPILER}" STREQUAL "clang")
if(NOT "x${HIP_CLANG_PATH}" STREQUAL "x")
set(ENV{HIP_CLANG_PATH} ${HIP_CLANG_PATH})
endif()
# Temporarily include HIP_HCC_FLAGS for HIP-Clang for PyTorch builds
set(__CC_FLAGS ${HIP_CLANG_PARALLEL_BUILD_COMPILE_OPTIONS} ${HIP_HIPCC_FLAGS} ${HIP_HCC_FLAGS} ${HIP_CLANG_FLAGS} ${HIP_HIPCC_FLAGS_${build_configuration}} ${HIP_HCC_FLAGS_${build_configuration}} ${HIP_CLANG_FLAGS_${build_configuration}})
endif()
else()
set(__CC_FLAGS ${HIP_HIPCC_FLAGS} ${HIP_NVCC_FLAGS} ${HIP_HIPCC_FLAGS_${build_configuration}} ${HIP_NVCC_FLAGS_${build_configuration}})
endif()
else()
set(__CC ${HIP_HOST_COMPILER})
set(__CC_FLAGS ${CMAKE_HOST_FLAGS} ${CMAKE_HOST_FLAGS_${build_configuration}})
endif()
set(__CC_INCLUDES ${HIP_HIPCC_INCLUDE_ARGS})
# hip_execute_process - Executes a command with optional command echo and status message.
# status - Status message to print if verbose is true
# command - COMMAND argument from the usual execute_process argument structure
# ARGN - Remaining arguments are the command with arguments
# HIP_result - Return value from running the command
macro(hip_execute_process status command)
set(_command ${command})
if(NOT "x${_command}" STREQUAL "xCOMMAND")
message(FATAL_ERROR "Malformed call to hip_execute_process. Missing COMMAND as second argument. (command = ${command})")
endif()
if(verbose)
execute_process(COMMAND "${CMAKE_COMMAND}" -E echo -- ${status})
# Build command string to print
set(hip_execute_process_string)
foreach(arg ${ARGN})
# Escape quotes if any
string(REPLACE "\"" "\\\"" arg ${arg})
# Surround args with spaces with quotes
if(arg MATCHES " ")
list(APPEND hip_execute_process_string "\"${arg}\"")
else()
list(APPEND hip_execute_process_string ${arg})
endif()
endforeach()
# Echo the command
execute_process(COMMAND ${CMAKE_COMMAND} -E echo ${hip_execute_process_string})
endif()
# Run the command
execute_process(COMMAND ${ARGN} RESULT_VARIABLE HIP_result)
endmacro()
# Delete the target file
hip_execute_process(
"Removing ${generated_file}"
COMMAND "${CMAKE_COMMAND}" -E remove "${generated_file}"
)
# Generate the dependency file
hip_execute_process(
"Generating dependency file: ${cmake_dependency_file}.pre"
COMMAND "${__CC}"
-M
"${source_file}"
-o "${cmake_dependency_file}.pre"
${__CC_FLAGS}
${__CC_INCLUDES}
)
if(HIP_result)
message(FATAL_ERROR "Error generating ${generated_file}")
endif()
# Generate the cmake readable dependency file to a temp file
hip_execute_process(
"Generating temporary cmake readable file: ${cmake_dependency_file}.tmp"
COMMAND "${CMAKE_COMMAND}"
-D "input_file:FILEPATH=${cmake_dependency_file}.pre"
-D "output_file:FILEPATH=${cmake_dependency_file}.tmp"
-D "verbose=${verbose}"
-P "${HIP_run_make2cmake}"
)
if(HIP_result)
message(FATAL_ERROR "Error generating ${generated_file}")
endif()
# Copy the file if it is different
hip_execute_process(
"Copy if different ${cmake_dependency_file}.tmp to ${cmake_dependency_file}"
COMMAND "${CMAKE_COMMAND}" -E copy_if_different "${cmake_dependency_file}.tmp" "${cmake_dependency_file}"
)
if(HIP_result)
message(FATAL_ERROR "Error generating ${generated_file}")
endif()
# Delete the temporary file
hip_execute_process(
"Removing ${cmake_dependency_file}.tmp and ${cmake_dependency_file}.pre"
COMMAND "${CMAKE_COMMAND}" -E remove "${cmake_dependency_file}.tmp" "${cmake_dependency_file}.pre"
)
if(HIP_result)
message(FATAL_ERROR "Error generating ${generated_file}")
endif()
# Generate the output file
hip_execute_process(
"Generating ${generated_file}"
COMMAND "${__CC}"
-c
"${source_file}"
-o "${generated_file}"
${__CC_FLAGS}
${__CC_INCLUDES}
)
if(HIP_result)
# Make sure that we delete the output file
hip_execute_process(
"Removing ${generated_file}"
COMMAND "${CMAKE_COMMAND}" -E remove "${generated_file}"
)
message(FATAL_ERROR "Error generating file ${generated_file}")
else()
if(verbose)
message("Generated ${generated_file} successfully.")
endif()
endif()
# vim: ts=4:sw=4:expandtab:smartindent
@@ -1,50 +0,0 @@
###############################################################################
# Computes dependencies using HIPCC
###############################################################################
###############################################################################
# This file converts dependency files generated using hipcc to a format that
# cmake can understand.
# Input variables:
#
# input_file:STRING=<> Dependency file to parse. Required argument
# output_file:STRING=<> Output file to generate. Required argument
if(NOT input_file OR NOT output_file)
message(FATAL_ERROR "You must specify input_file and output_file on the command line")
endif()
file(READ ${input_file} depend_text)
if (NOT "${depend_text}" STREQUAL "")
string(REPLACE " /" "\n/" depend_text ${depend_text})
string(REGEX REPLACE "^.*:" "" depend_text ${depend_text})
string(REGEX REPLACE "[ \\\\]*\n" ";" depend_text ${depend_text})
set(dependency_list "")
foreach(file ${depend_text})
string(REGEX REPLACE "^ +" "" file ${file})
if(NOT EXISTS "${file}")
message(WARNING " Removing non-existent dependency file: ${file}")
set(file "")
endif()
if(NOT IS_DIRECTORY "${file}")
get_filename_component(file_absolute "${file}" ABSOLUTE)
list(APPEND dependency_list "${file_absolute}")
endif()
endforeach()
endif()
# Remove the duplicate entries and sort them.
list(REMOVE_DUPLICATES dependency_list)
list(SORT dependency_list)
foreach(file ${dependency_list})
set(hip_hipcc_depend "${hip_hipcc_depend} \"${file}\"\n")
endforeach()
file(WRITE ${output_file} "# Generated by: FindHIP.cmake. Do not edit.\nSET(HIP_HIPCC_DEPEND\n ${hip_hipcc_depend})\n\n")
# vim: ts=4:sw=4:expandtab:smartindent
+33 -1
View File
@@ -14,10 +14,33 @@
# - HYPRE_LIBRARIES
# - HYPRE_INCLUDE_DIRS
# - HYPRE_VERSION
# - HYPRE_USING_HIP (internal)
if (HYPRE_FOUND)
if (HYPRE_USING_HIP)
find_package(rocsparse REQUIRED)
find_package(rocrand REQUIRED)
endif()
return()
endif()
include(MfemCmakeUtilities)
mfem_find_package(HYPRE HYPRE HYPRE_DIR "include" "HYPRE.h" "lib" "HYPRE"
"Paths to headers required by HYPRE." "Libraries required by HYPRE.")
"Paths to headers required by HYPRE." "Libraries required by HYPRE."
CHECK_BUILD HYPRE_USING_HIP FALSE
"
#undef HYPRE_USING_HIP
#include <HYPRE_config.h>
#ifndef HYPRE_USING_HIP
#error HYPRE is built without HIP.
#endif
int main()
{
return 0;
}
")
if (HYPRE_FOUND AND (NOT HYPRE_VERSION))
try_run(HYPRE_VERSION_RUN_RESULT HYPRE_VERSION_COMPILE_RESULT
@@ -33,3 +56,12 @@ if (HYPRE_FOUND AND (NOT HYPRE_VERSION))
message(FATAL_ERROR "Unable to determine HYPRE version.")
endif()
endif()
if (HYPRE_FOUND AND HYPRE_USING_HIP)
find_package(rocsparse REQUIRED)
find_package(rocrand REQUIRED)
list(APPEND HYPRE_LIBRARIES ${rocsparse_LIBRARIES} ${rocrand_LIBRARIES})
set(HYPRE_LIBRARIES ${HYPRE_LIBRARIES} CACHE STRING
"HYPRE libraries + dependencies." FORCE)
message(STATUS "Updated HYPRE_LIBRARIES: ${HYPRE_LIBRARIES}")
endif()
+159 -22
View File
@@ -46,8 +46,7 @@ endfunction()
# Wrapper for add_executable that calls the HIP wrapper if applicable
macro(mfem_add_executable NAME)
if (MFEM_USE_HIP)
hip_add_executable(${NAME} ${ARGN})
set_target_properties(${NAME} PROPERTIES LINKER_LANGUAGE CXX)
add_executable(${NAME} ${ARGN})
else()
add_executable(${NAME} ${ARGN})
endif()
@@ -56,7 +55,7 @@ endmacro()
# Wrapper for add_library that calls the HIP wrapper if applicable
macro(mfem_add_library NAME)
if (MFEM_USE_HIP)
hip_add_library(${NAME} ${ARGN})
add_library(${NAME} ${ARGN})
else()
add_library(${NAME} ${ARGN})
endif()
@@ -92,8 +91,6 @@ macro(add_mfem_examples EXE_SRCS)
# If CUDA is enabled, tag source files to be compiled with nvcc.
if (MFEM_USE_CUDA)
set_source_files_properties(${SRC_FILE} PROPERTIES LANGUAGE CUDA)
elseif(MFEM_USE_HIP)
set_source_files_properties(${SRC_FILE} PROPERTIES HIP_SOURCE_PROPERTY_FORMAT TRUE)
endif()
get_filename_component(SRC_FILENAME ${SRC_FILE} NAME)
@@ -159,8 +156,6 @@ macro(add_mfem_miniapp MFEM_EXE_NAME)
endforeach()
set(EXTRA_OPTIONS_LIST ${LIST_})
endif()
elseif(MFEM_USE_HIP)
set_source_files_properties(${MAIN_LIST} ${EXTRA_SOURCES_LIST} PROPERTIES HIP_SOURCE_PROPERTY_FORMAT TRUE)
endif()
# Actually add the executable
@@ -534,12 +529,15 @@ function(mfem_find_package Name Prefix DirVar IncSuffixes Header LibSuffixes
if (NOT ImportConfig)
set(ImportConfig RELEASE)
endif()
set(ImportConfigSuffix "_${ImportConfig}")
get_target_property(ImpConfigs ${TargetName} IMPORTED_CONFIGURATIONS)
list(FIND ImpConfigs ${ImportConfig} _Index)
if (_Index EQUAL -1)
message(FATAL_ERROR " *** ${ReqPack}: configuration "
"${ImportConfig} not found. Set ${ReqPack}_IMPORT_CONFIG "
"from the list: ${ImpConfigs}.")
if ((_Index EQUAL -1) OR ("${ImportConfig}" STREQUAL "NO_CONFIG"))
set(ImportConfig "NO_CONFIG")
set(ImportConfigSuffix "")
# message(FATAL_ERROR " *** ${ReqPack}: configuration "
# "${ImportConfig} not found. Set ${ReqPack}_IMPORT_CONFIG "
# "from the list: ${ImpConfigs}.")
endif()
endif()
# Set _Pack_LIBS
@@ -551,8 +549,8 @@ function(mfem_find_package Name Prefix DirVar IncSuffixes Header LibSuffixes
endif()
else()
# Set _Pack_LIBS from the target properties for ImportConfig
foreach (_prop IMPORTED_LOCATION_${ImportConfig}
IMPORTED_LINK_INTERFACE_LIBRARIES_${ImportConfig})
foreach (_prop IMPORTED_LOCATION${ImportConfigSuffix}
IMPORTED_LINK_INTERFACE_LIBRARIES${ImportConfigSuffix})
get_target_property(_value ${TargetName} ${_prop})
if (_value)
list(APPEND _Pack_LIBS ${_value})
@@ -564,7 +562,7 @@ function(mfem_find_package Name Prefix DirVar IncSuffixes Header LibSuffixes
endif()
endif()
# Set _Pack_INCS
foreach (_prop INCLUDE_DIRECTORIES)
foreach (_prop INCLUDE_DIRECTORIES INTERFACE_INCLUDE_DIRECTORIES)
get_target_property(_value ${TargetName} ${_prop})
if (_value)
list(APPEND _Pack_INCS ${_value})
@@ -742,6 +740,133 @@ function(mfem_find_library Name Prefix Lib LibDoc CheckVar CheckSrc)
endfunction(mfem_find_library)
#
# Extract compile and link options needed by the given target.
#
function(mfem_get_target_options Target CompileOptsVar LinkOptsVar)
if (NOT TARGET ${Target})
return()
endif()
# CMAKE_SHARED_LIBRARY_RUNTIME_C_FLAG -> '-Wl,-rpath,'
set(shared_link_flag ${CMAKE_SHARED_LIBRARY_RUNTIME_C_FLAG})
if (NOT shared_link_flag)
set(shared_link_flag "-Wl,-rpath,")
endif()
set(tgt "${Target}")
unset(CompileOpts)
unset(LinkOpts)
get_target_property(IsImported ${tgt} IMPORTED)
# message(STATUS "${tgt}[IMPORTED]: ${IsImported}")
# Generally, the possible target types are: STATIC_LIBRARY, MODULE_LIBRARY,
# SHARED_LIBRARY, INTERFACE_LIBRARY, EXECUTABLE.
get_target_property(type ${tgt} TYPE)
# message(STATUS "${tgt}[TYPE]: ${type}")
unset(ImportConfig)
get_target_property(ImportConfigs ${tgt} IMPORTED_CONFIGURATIONS)
if (ImportConfigs)
list(GET ImportConfigs 0 ImportConfig)
endif()
if (NOT ImportConfig)
set(ImportConfig RELEASE)
endif()
# message(STATUS "${tgt}[ImportConfig]: ${ImportConfig}")
# List all properties with: cmake --help-property-list
get_target_property(Defs ${tgt} INTERFACE_COMPILE_DEFINITIONS)
if (Defs)
list(REMOVE_DUPLICATES Defs)
foreach(Def ${Defs})
list(APPEND CompileOpts "-D${Def}")
endforeach()
endif()
get_target_property(Opts ${tgt} INTERFACE_COMPILE_OPTIONS)
if (Opts)
foreach(Opt ${Opts})
list(APPEND CompileOpts "${Opt}")
endforeach()
endif()
get_target_property(Dirs ${tgt} INTERFACE_INCLUDE_DIRECTORIES)
if (Dirs)
list(REMOVE_DUPLICATES Dirs)
foreach(Dir ${Dirs})
list(APPEND CompileOpts "-I\"${Dir}\"")
endforeach()
endif()
get_target_property(SysDirs ${tgt} INTERFACE_SYSTEM_INCLUDE_DIRECTORIES)
if (SysDirs)
list(REMOVE_DUPLICATES SysDirs)
foreach(SysDir ${SysDirs})
list(APPEND CompileOpts "-isystem \"${SysDir}\"")
endforeach()
endif()
if ("${type}" STREQUAL "STATIC_LIBRARY")
get_target_property(Location ${tgt} LOCATION)
if (Location)
list(APPEND LinkOpts "\"${Location}\"")
else()
message(STATUS " *** Warning: [${tgt}] LOCATION not defined!")
endif()
elseif ("${type}" STREQUAL "SHARED_LIBRARY")
get_target_property(Location ${tgt} LOCATION)
if (Location)
get_filename_component(Dir ${Location} DIRECTORY)
get_filename_component(NameWE ${Location} NAME_WE)
string(REGEX REPLACE "^lib" "" LibName ${NameWE})
list(APPEND LinkOpts
"-L\"${Dir}\""
"${shared_link_flag}\"${Dir}\""
"-l${LibName}")
else()
message(STATUS " *** Warning: [${tgt}] LOCATION not defined!")
endif()
elseif ("${type}" STREQUAL "INTERFACE_LIBRARY")
get_target_property(Libs ${tgt} INTERFACE_LINK_LIBRARIES)
if (Libs)
foreach(Lib ${Libs})
if (NOT (TARGET ${Lib}))
list(APPEND LinkOpts "${Lib}")
else()
mfem_get_target_options(${Lib} COpts LOpts)
list(APPEND CompileOpts ${COpts})
list(APPEND LinkOpts ${LOpts})
endif()
endforeach()
endif()
# Other properties we may need to handle:
# INTERFACE_LINK_DEPENDS
# INTERFACE_LINK_DIRECTORIES
# INTERFACE_LINK_OPTIONS
else()
message(STATUS " *** Warning: [${tgt}] uses target type '${type}'"
" which is not supported!")
endif()
# Other potentially relevant properties:
# - For all target types:
# IMPORTED_LIBNAME
# IMPORTED_LIBNAME_${ImportConfig}
# INTERFACE_AUTOUIC_OPTIONS
# INTERFACE_COMPILE_FEATURES
# INTERFACE_POSITION_INDEPENDENT_CODE
# INTERFACE_SOURCES
# INTERFACE_SYSTEM_INCLUDE_DIRECTORIES)
# - For non-"INTERFACE_LIBRARY" target types only:
# IMPORTED_LOCATION
# IMPORTED_LOCATION_${ImportConfig}
# IMPORTED_LINK_INTERFACE_LIBRARIES
# IMPORTED_LINK_INTERFACE_LIBRARIES_${ImportConfig}
# LINK_FLAGS
# LINK_FLAGS_${ImportConfig}
# LOCATION_${ImportConfig})
set(${CompileOptsVar} "${CompileOpts}" PARENT_SCOPE)
set(${LinkOptsVar} "${LinkOpts}" PARENT_SCOPE)
endfunction(mfem_get_target_options)
#
# Function that creates 'config.mk' from 'config.mk.in' for the both the
# build- and the install-locations and define install rules for 'config.mk'
@@ -760,13 +885,15 @@ function(mfem_export_mk_files)
# Convert Boolean vars to YES/NO without writing the values to cache
set(CONFIG_MK_BOOL_VARS MFEM_USE_MPI MFEM_USE_METIS MFEM_USE_METIS_5
MFEM_DEBUG MFEM_USE_EXCEPTIONS MFEM_USE_ZLIB MFEM_USE_LIBUNWIND
MFEM_USE_LAPACK MFEM_THREAD_SAFE MFEM_USE_OPENMP MFEM_USE_LEGACY_OPENMP
MFEM_USE_LAPACK MFEM_THREAD_SAFE MFEM_USE_LEGACY_OPENMP MFEM_USE_OPENMP
MFEM_USE_MEMALLOC MFEM_USE_SUNDIALS MFEM_USE_MESQUITE MFEM_USE_SUITESPARSE
MFEM_USE_SUPERLU MFEM_USE_STRUMPACK MFEM_USE_GINKGO MFEM_USE_AMGX
MFEM_USE_GNUTLS MFEM_USE_GSLIB MFEM_USE_NETCDF MFEM_USE_PETSC
MFEM_USE_SLEPC MFEM_USE_MPFR MFEM_USE_SIDRE MFEM_USE_CONDUIT MFEM_USE_PUMI
MFEM_USE_CUDA MFEM_USE_OCCA MFEM_USE_RAJA MFEM_USE_UMPIRE MFEM_USE_SIMD
MFEM_USE_ADIOS2 MFEM_USE_BENCHMARK MFEM_USE_PARELAG)
MFEM_USE_SUPERLU MFEM_USE_SUPERLU5 MFEM_USE_MUMPS MFEM_USE_STRUMPACK
MFEM_USE_GINKGO MFEM_USE_AMGX MFEM_USE_GNUTLS MFEM_USE_NETCDF
MFEM_USE_PETSC MFEM_USE_SLEPC MFEM_USE_MPFR MFEM_USE_SIDRE MFEM_USE_FMS
MFEM_USE_CONDUIT MFEM_USE_PUMI MFEM_USE_HIOP MFEM_USE_GSLIB MFEM_USE_CUDA
MFEM_USE_HIP MFEM_USE_RAJA MFEM_USE_OCCA MFEM_USE_CEED MFEM_USE_CALIPER
MFEM_USE_UMPIRE MFEM_USE_SIMD MFEM_USE_ADIOS2 MFEM_USE_MKL_CPARDISO
MFEM_USE_ADFORWARD MFEM_USE_CODIPACK MFEM_USE_BENCHMARK MFEM_USE_PARELAG)
foreach(var ${CONFIG_MK_BOOL_VARS})
if (${var})
set(${var} YES)
@@ -868,8 +995,18 @@ function(mfem_export_mk_files)
get_filename_component(suffix ${lib} EXT)
# handle interfaces (e.g., SCOREC::apf)
if ("${lib}" MATCHES "SCOREC::.*" OR "${lib}" MATCHES "Ginkgo::.*")
elseif (NOT "${lib}" MATCHES "SCOREC::.*" AND "${lib}" MATCHES ".*::.*")
message(FATAL_ERROR "***** interface lib found ... exiting *****")
elseif (TARGET "${lib}")
mfem_get_target_options(${lib} CompileOpts LinkOpts)
# Removing duplicates may lead to issues:
# list(REMOVE_DUPLICATES CompileOpts)
# list(REMOVE_DUPLICATES LinkOpts)
string(REPLACE ";" " " COpts "${CompileOpts}")
string(REPLACE ";" " " LOpts "${LinkOpts}")
# message(STATUS "${lib}[COpts]: '${COpts}'")
# message(STATUS "${lib}[LOpts]: '${LOpts}'")
set(MFEM_TPLFLAGS "${MFEM_TPLFLAGS} ${COpts}")
set(MFEM_EXT_LIBS "${MFEM_EXT_LIBS} ${LOpts}")
# message(FATAL_ERROR "***** interface lib found ... exiting *****")
# handle static and shared libs
elseif ("${suffix}" STREQUAL "${CMAKE_SHARED_LIBRARY_SUFFIX}")
get_filename_component(dir ${lib} DIRECTORY)
+1 -1
View File
@@ -91,7 +91,7 @@ MFEM_MPIEXEC_NP = @MFEM_MPIEXEC_NP@
MFEM_MPI_NP = @MFEM_MPI_NP@
# The NVCC compiler cannot link with -x=cu
MFEM_LINK_FLAGS := $(filter-out -x=cu, $(MFEM_FLAGS))
MFEM_LINK_FLAGS := $(filter-out -x=cu -xhip, $(MFEM_FLAGS))
# Optional extra configuration
@MFEM_CONFIG_EXTRA@
+9 -1
View File
@@ -50,6 +50,7 @@ option(MFEM_USE_CONDUIT "Enable Conduit usage" OFF)
option(MFEM_USE_PUMI "Enable PUMI" OFF)
option(MFEM_USE_HIOP "Enable HiOp" OFF)
option(MFEM_USE_CUDA "Enable CUDA" OFF)
option(MFEM_USE_HIP "Enable HIP" OFF)
option(MFEM_USE_OCCA "Enable OCCA" OFF)
option(MFEM_USE_RAJA "Enable RAJA" OFF)
option(MFEM_USE_CEED "Enable CEED" OFF)
@@ -107,6 +108,7 @@ if (MFEM_USE_CUDA)
set(HYPRE_REQUIRED_LIBRARIES "-lcusparse" "-lcurand" CACHE STRING
"Libraries that HYPRE depends on.")
endif()
# HIP dependency for HYPRE is handled in FindHYPRE.cmake.
set(METIS_DIR "${MFEM_DIR}/../metis-4.0" CACHE PATH "Path to the METIS library.")
@@ -226,6 +228,11 @@ set(MKL_LIBRARY_DIR "" CACHE STRING "Custom library subdirectory")
set(OCCA_DIR "${MFEM_DIR}/../occa" CACHE PATH "Path to OCCA")
set(RAJA_DIR "${MFEM_DIR}/../raja" CACHE PATH "Path to RAJA")
# If RAJA is built with external CAMP:
# set(RAJA_REQUIRED_PACKAGES "camp"
# CACHE STRING "Packages that RAJA depends on.")
# set(camp_DIR "${MFEM_DIR}/../camp/lib/cmake/camp"
# CACHE PATH "Path to CAMP CMake files.")
set(CEED_DIR "${MFEM_DIR}/../libCEED" CACHE PATH "Path to libCEED")
set(UMPIRE_DIR "${MFEM_DIR}/../umpire" CACHE PATH "Path to Umpire")
set(CALIPER_DIR "${MFEM_DIR}/../caliper" CACHE PATH "Path to Caliper")
@@ -245,7 +252,8 @@ set(BLAS_LIBRARIES "" CACHE STRING "The BLAS library.")
set(LAPACK_INCLUDE_DIRS "" CACHE STRING "Path to LAPACK headers.")
set(LAPACK_LIBRARIES "" CACHE STRING "The LAPACK library.")
set(CODIPACK_INCLUDE_DIRS "${MFEM_DIR}/../CoDiPack/inlude" CACHE STRING "Path to CoDiPack headers.")
set(CODIPACK_INCLUDE_DIRS "${MFEM_DIR}/../CoDiPack/include" CACHE STRING
"Path to CoDiPack headers.")
set(CODIPACK_LIBRARIES "")
# Some useful variables:
+21 -2
View File
@@ -172,6 +172,20 @@ ifeq ($(MFEM_USE_MPI)$(MFEM_USE_HIP),YESYES)
MPI_LIB = -L$(MPI_DIR)/lib $(XLINKER)-rpath,$(MPI_DIR)/lib -lmpi
endif
# ROCM/HIP directory such that ROCM/HIP libraries like rocsparse and rocrand are
# found in $(HIP_DIR)/lib, usually as links. Typically, this directoory is of
# the form /opt/rocm-X.Y.Z which is called ROCM_PATH by hipconfig.
ifeq ($(MFEM_USE_HIP),YES)
HIP_DIR := $(patsubst %/,%,$(dir $(shell which $(HIP_CXX))))
HIP_DIR := $(patsubst %/,%,$(dir $(HIP_DIR)))
ifeq (,$(wildcard $(HIP_DIR)/lib/librocsparse.*))
HIP_DIR := $(shell hipconfig --rocmpath 2> /dev/null)
ifeq (,$(wildcard $(HIP_DIR)/lib/librocsparse.*))
$(error Unable to determine HIP_DIR. Please set it manually.)
endif
endif
endif
# Compile and link options for zlib.
ZLIB_DIR =
ZLIB_OPT = $(if $(ZLIB_DIR),-I$(ZLIB_DIR)/include)
@@ -189,6 +203,11 @@ ifeq (YES,$(MFEM_USE_CUDA))
# This is only necessary when hypre is built with cuda:
HYPRE_LIB += -lcusparse -lcurand
endif
ifeq (YES,$(MFEM_USE_HIP))
# This is only necessary when hypre is built with hip:
HYPRE_LIB += -L$(HIP_DIR)/lib $(XLINKER)-rpath,$(HIP_DIR)/lib\
-lrocsparse -lrocrand
endif
# METIS library configuration
ifeq ($(MFEM_USE_SUPERLU)$(MFEM_USE_STRUMPACK)$(MFEM_USE_MUMPS),NONONO)
@@ -430,9 +449,9 @@ GSLIB_LIB = -L$(GSLIB_DIR)/lib -lgs
CUDA_OPT =
CUDA_LIB = -lcusparse
# HIP library configuration (currently not needed)
# HIP library configuration
HIP_OPT =
HIP_LIB =
HIP_LIB = -L$(HIP_DIR)/lib $(XLINKER)-rpath,$(HIP_DIR)/lib -lhipsparse
# OCCA library configuration
OCCA_DIR = @MFEM_DIR@/../occa
+3 -3
View File
@@ -58,14 +58,14 @@ ifneq (,$(filter test%,$(MAKECMDGOALS)))
MAKEFLAGS += -k
endif
# Test runs of the examples/miniapps with parameters - check exit code:
# 0 means success, 255 means the test was skipped, anything else means error
# 0 means success, 242 means the test was skipped, anything else means error
mfem-test = \
printf " $(3) [$(2) $(1) ... ]: "; \
$(call $(TIMEFUN),$(TIMECMD),$(2) ./$(1) $(if $(5),,-no-vis )$(4) \
> $(1).stderr 2>&1); \
err="$$3"; \
if [ "$$3" = 0 ]; then $(PRINT_OK); \
else if [ "$$3" = 255 ]; then $(PRINT_SKIP); err=0; \
else if [ "$$3" = 242 ]; then $(PRINT_SKIP); err=0; \
else $(PRINT_FAILED); cat $(1).stderr; fi; fi; \
rm -f $(1).stderr; exit $$err
@@ -76,7 +76,7 @@ mfem-test-file = \
$(call $(TIMEFUN),$(TIMECMD),$(2) ./$(1) -no-vis > $(1).stderr 2>&1); \
err="$$3"; \
if [ "$$3" = 0 ] && [ -e $(4) ]; then $(PRINT_OK); \
else if [ "$$3" = 255 ] && [ -e $(4) ]; then $(PRINT_SKIP); err=0; \
else if [ "$$3" = 242 ] && [ -e $(4) ]; then $(PRINT_SKIP); err=0; \
else $(PRINT_FAILED); cat $(1).stderr; err=64; fi; fi; \
rm -f $(1).stderr; exit $$err
+13 -12
View File
@@ -149,7 +149,7 @@ void InitialDeformation(const Vector &x, Vector &y);
void InitialVelocity(const Vector &x, Vector &v);
void visualize(ostream &out, Mesh *mesh, GridFunction *deformed_nodes,
void visualize(ostream &os, Mesh *mesh, GridFunction *deformed_nodes,
GridFunction *field, const char *field_name = NULL,
bool init_vis = false);
@@ -376,10 +376,10 @@ int main(int argc, char *argv[])
}
void visualize(ostream &out, Mesh *mesh, GridFunction *deformed_nodes,
void visualize(ostream &os, Mesh *mesh, GridFunction *deformed_nodes,
GridFunction *field, const char *field_name, bool init_vis)
{
if (!out)
if (!os)
{
return;
}
@@ -389,24 +389,25 @@ void visualize(ostream &out, Mesh *mesh, GridFunction *deformed_nodes,
mesh->SwapNodes(nodes, owns_nodes);
out << "solution\n" << *mesh << *field;
os << "solution\n" << *mesh << *field;
mesh->SwapNodes(nodes, owns_nodes);
if (init_vis)
{
out << "window_size 800 800\n";
out << "window_title '" << field_name << "'\n";
os << "window_size 800 800\n";
os << "window_title '" << field_name << "'\n";
if (mesh->SpaceDimension() == 2)
{
out << "view 0 0\n"; // view from top
out << "keys jl\n"; // turn off perspective and light
os << "view 0 0\n"; // view from top
os << "keys jl\n"; // turn off perspective and light
}
out << "keys cm\n"; // show colorbar and mesh
out << "autoscale value\n"; // update value-range; keep mesh-extents fixed
out << "pause\n";
os << "keys cm\n"; // show colorbar and mesh
// update value-range; keep mesh-extents fixed
os << "autoscale value\n";
os << "pause\n";
}
out << flush;
os << flush;
}
+17 -13
View File
@@ -154,7 +154,8 @@ void InitialDeformation(const Vector &x, Vector &y);
void InitialVelocity(const Vector &x, Vector &v);
void visualize(ostream &out, ParMesh *mesh, ParGridFunction *deformed_nodes,
void visualize(ostream &os, ParMesh *mesh,
ParGridFunction *deformed_nodes,
ParGridFunction *field, const char *field_name = NULL,
bool init_vis = false);
@@ -438,10 +439,11 @@ int main(int argc, char *argv[])
return 0;
}
void visualize(ostream &out, ParMesh *mesh, ParGridFunction *deformed_nodes,
void visualize(ostream &os, ParMesh *mesh,
ParGridFunction *deformed_nodes,
ParGridFunction *field, const char *field_name, bool init_vis)
{
if (!out)
if (!os)
{
return;
}
@@ -451,25 +453,27 @@ void visualize(ostream &out, ParMesh *mesh, ParGridFunction *deformed_nodes,
mesh->SwapNodes(nodes, owns_nodes);
out << "parallel " << mesh->GetNRanks() << " " << mesh->GetMyRank() << "\n";
out << "solution\n" << *mesh << *field;
os << "parallel " << mesh->GetNRanks()
<< " " << mesh->GetMyRank() << "\n";
os << "solution\n" << *mesh << *field;
mesh->SwapNodes(nodes, owns_nodes);
if (init_vis)
{
out << "window_size 800 800\n";
out << "window_title '" << field_name << "'\n";
os << "window_size 800 800\n";
os << "window_title '" << field_name << "'\n";
if (mesh->SpaceDimension() == 2)
{
out << "view 0 0\n"; // view from top
out << "keys jl\n"; // turn off perspective and light
os << "view 0 0\n"; // view from top
os << "keys jl\n"; // turn off perspective and light
}
out << "keys cm\n"; // show colorbar and mesh
out << "autoscale value\n"; // update value-range; keep mesh-extents fixed
out << "pause\n";
os << "keys cm\n"; // show colorbar and mesh
// update value-range; keep mesh-extents fixed
os << "autoscale value\n";
os << "pause\n";
}
out << flush;
os << flush;
}
+10 -10
View File
@@ -32,7 +32,7 @@ private:
mutable DenseTensor flux;
mutable Vector z;
void GetFlux(const DenseMatrix &state, DenseTensor &flux) const;
void GetFlux(const DenseMatrix &state_, DenseTensor &flux_) const;
public:
FE_Evolution(FiniteElementSpace &vfes_,
@@ -256,26 +256,26 @@ inline double ComputeMaxCharSpeed(const Vector &state, const int dim)
}
// Compute the flux at solution nodes.
void FE_Evolution::GetFlux(const DenseMatrix &x, DenseTensor &flux) const
void FE_Evolution::GetFlux(const DenseMatrix &x_, DenseTensor &flux_) const
{
const int dof = flux.SizeI();
const int dim = flux.SizeJ();
const int flux_dof = flux_.SizeI();
const int flux_dim = flux_.SizeJ();
for (int i = 0; i < dof; i++)
for (int i = 0; i < flux_dof; i++)
{
for (int k = 0; k < num_equation; k++) { state(k) = x(i, k); }
ComputeFlux(state, dim, f);
for (int k = 0; k < num_equation; k++) { state(k) = x_(i, k); }
ComputeFlux(state, flux_dim, f);
for (int d = 0; d < dim; d++)
for (int d = 0; d < flux_dim; d++)
{
for (int k = 0; k < num_equation; k++)
{
flux(i, d, k) = f(k, d);
flux_(i, d, k) = f(k, d);
}
}
// Update max char speed
const double mcs = ComputeMaxCharSpeed(state, dim);
const double mcs = ComputeMaxCharSpeed(state, flux_dim);
if (mcs > max_char_speed) { max_char_speed = mcs; }
}
}
+13 -11
View File
@@ -171,7 +171,7 @@ public:
};
// Visualization driver
void visualize(ostream &out, Mesh *mesh, GridFunction *deformed_nodes,
void visualize(ostream &os, Mesh *mesh, GridFunction *deformed_nodes,
GridFunction *field, const char *field_name = NULL,
bool init_vis = false);
@@ -542,10 +542,10 @@ RubberOperator::~RubberOperator()
// Inline visualization
void visualize(ostream &out, Mesh *mesh, GridFunction *deformed_nodes,
void visualize(ostream &os, Mesh *mesh, GridFunction *deformed_nodes,
GridFunction *field, const char *field_name, bool init_vis)
{
if (!out)
if (!os)
{
return;
}
@@ -555,23 +555,25 @@ void visualize(ostream &out, Mesh *mesh, GridFunction *deformed_nodes,
mesh->SwapNodes(nodes, owns_nodes);
out << "solution\n" << *mesh << *field;
os << "solution\n" << *mesh << *field;
mesh->SwapNodes(nodes, owns_nodes);
if (init_vis)
{
out << "window_size 800 800\n";
out << "window_title '" << field_name << "'\n";
os << "window_size 800 800\n";
os << "window_title '" << field_name << "'\n";
if (mesh->SpaceDimension() == 2)
{
out << "view 0 0\n"; // view from top
out << "keys jlA\n"; // turn off perspective and light, +anti-aliasing
os << "view 0 0\n"; // view from top
// turn off perspective and light, +anti-aliasing
os << "keys jlA\n";
}
out << "keys cmA\n"; // show colorbar and mesh, +anti-aliasing
out << "autoscale value\n"; // update value-range; keep mesh-extents fixed
os << "keys cmA\n"; // show colorbar and mesh, +anti-aliasing
// update value-range; keep mesh-extents fixed
os << "autoscale value\n";
}
out << flush;
os << flush;
}
void ReferenceConfiguration(const Vector &x, Vector &y)
+22 -17
View File
@@ -185,7 +185,8 @@ public:
};
// Visualization driver
void visualize(ostream &out, ParMesh *mesh, ParGridFunction *deformed_nodes,
void visualize(ostream &os, ParMesh *mesh,
ParGridFunction *deformed_nodes,
ParGridFunction *field, const char *field_name = NULL,
bool init_vis = false);
@@ -196,10 +197,10 @@ void InitialDeformation(const Vector &x, Vector &y);
int main(int argc, char *argv[])
{
#ifdef HYPRE_USING_CUDA
#ifdef HYPRE_USING_GPU
cout << "\nAs of mfem-4.3 and hypre-2.22.0 (July 2021) this example\n"
<< "is NOT supported with the CUDA version of hypre.\n\n";
return 255;
<< "is NOT supported with the GPU version of hypre.\n\n";
return 242;
#endif
// 1. Initialize MPI
@@ -486,8 +487,8 @@ void JacobianPreconditioner::SetOperator(const Operator &op)
if (!spaces[0]->GetParMesh()->Nonconforming())
{
#ifndef HYPRE_USING_CUDA
// Not available yet when hypre is built with CUDA
#if !defined(HYPRE_USING_GPU)
// Not available yet when hypre is built with GPU support
stiff_prec_amg->SetElasticityOptions(spaces[0]);
#endif
}
@@ -617,10 +618,11 @@ RubberOperator::~RubberOperator()
// Inline visualization
void visualize(ostream &out, ParMesh *mesh, ParGridFunction *deformed_nodes,
void visualize(ostream &os, ParMesh *mesh,
ParGridFunction *deformed_nodes,
ParGridFunction *field, const char *field_name, bool init_vis)
{
if (!out)
if (!os)
{
return;
}
@@ -630,24 +632,27 @@ void visualize(ostream &out, ParMesh *mesh, ParGridFunction *deformed_nodes,
mesh->SwapNodes(nodes, owns_nodes);
out << "parallel " << mesh->GetNRanks() << " " << mesh->GetMyRank() << "\n";
out << "solution\n" << *mesh << *field;
os << "parallel " << mesh->GetNRanks() << " " << mesh->GetMyRank() <<
"\n";
os << "solution\n" << *mesh << *field;
mesh->SwapNodes(nodes, owns_nodes);
if (init_vis)
{
out << "window_size 800 800\n";
out << "window_title '" << field_name << "'\n";
os << "window_size 800 800\n";
os << "window_title '" << field_name << "'\n";
if (mesh->SpaceDimension() == 2)
{
out << "view 0 0\n"; // view from top
out << "keys jlA\n"; // turn off perspective and light, +anti-aliasing
os << "view 0 0\n"; // view from top
// turn off perspective and light, +anti-aliasing
os << "keys jlA\n";
}
out << "keys cmA\n"; // show colorbar and mesh, +anti-aliasing
out << "autoscale value\n"; // update value-range; keep mesh-extents fixed
os << "keys cmA\n"; // show colorbar and mesh, +anti-aliasing
// update value-range; keep mesh-extents fixed
os << "autoscale value\n";
}
out << flush;
os << flush;
}
void ReferenceConfiguration(const Vector &x, Vector &y)
+19 -18
View File
@@ -75,7 +75,7 @@ Mesh * GenerateSerialMesh(int ref);
// alpha*n.Grad(sol) + beta*sol - gamma over the same boundary.
double IntegrateBC(const GridFunction &sol, const Array<int> &bdr_marker,
double alpha, double beta, double gamma,
double &err);
double &error);
int main(int argc, char *argv[])
{
@@ -302,26 +302,26 @@ int main(int argc, char *argv[])
{
// Integrate the solution on the Dirichlet boundary and compare to the
// expected value.
double err, avg = IntegrateBC(u, dbc_bdr, 0.0, 1.0, dbc_val, err);
double error, avg = IntegrateBC(u, dbc_bdr, 0.0, 1.0, dbc_val, error);
bool hom_dbc = (dbc_val == 0.0);
err /= hom_dbc ? 1.0 : fabs(dbc_val);
error /= hom_dbc ? 1.0 : fabs(dbc_val);
mfem::out << "Average of solution on Gamma_dbc:\t"
<< avg << ", \t"
<< (hom_dbc ? "absolute" : "relative")
<< " error " << err << endl;
<< " error " << error << endl;
}
{
// Integrate n.Grad(u) on the inhomogeneous Neumann boundary and compare
// to the expected value.
double err, avg = IntegrateBC(u, nbc_bdr, 1.0, 0.0, nbc_val, err);
double error, avg = IntegrateBC(u, nbc_bdr, 1.0, 0.0, nbc_val, error);
bool hom_nbc = (nbc_val == 0.0);
err /= hom_nbc ? 1.0 : fabs(nbc_val);
error /= hom_nbc ? 1.0 : fabs(nbc_val);
mfem::out << "Average of n.Grad(u) on Gamma_nbc:\t"
<< avg << ", \t"
<< (hom_nbc ? "absolute" : "relative")
<< " error " << err << endl;
<< " error " << error << endl;
}
{
// Integrate n.Grad(u) on the homogeneous Neumann boundary and compare to
@@ -330,25 +330,26 @@ int main(int argc, char *argv[])
nbc0_bdr = 0;
nbc0_bdr[3] = 1;
double err, avg = IntegrateBC(u, nbc0_bdr, 1.0, 0.0, 0.0, err);
double error, avg = IntegrateBC(u, nbc0_bdr, 1.0, 0.0, 0.0, error);
bool hom_nbc = true;
mfem::out << "Average of n.Grad(u) on Gamma_nbc0:\t"
<< avg << ", \t"
<< (hom_nbc ? "absolute" : "relative")
<< " error " << err << endl;
<< " error " << error << endl;
}
{
// Integrate n.Grad(u) + a * u on the Robin boundary and compare to the
// expected value.
double err, avg = IntegrateBC(u, rbc_bdr, 1.0, rbc_a_val, rbc_b_val, err);
double error;
double avg = IntegrateBC(u, rbc_bdr, 1.0, rbc_a_val, rbc_b_val, error);
bool hom_rbc = (rbc_b_val == 0.0);
err /= hom_rbc ? 1.0 : fabs(rbc_b_val);
error /= hom_rbc ? 1.0 : fabs(rbc_b_val);
mfem::out << "Average of n.Grad(u)+a*u on Gamma_rbc:\t"
<< avg << ", \t"
<< (hom_rbc ? "absolute" : "relative")
<< " error " << err << endl;
<< " error " << error << endl;
}
// 14. Save the refined mesh and the solution. This output can be viewed
@@ -637,11 +638,11 @@ Mesh * GenerateSerialMesh(int ref)
double IntegrateBC(const GridFunction &x, const Array<int> &bdr,
double alpha, double beta, double gamma,
double &err)
double &error)
{
double nrm = 0.0;
double avg = 0.0;
err = 0.0;
error = 0.0;
const bool a_is_zero = alpha == 0.0;
const bool b_is_zero = beta == 0.0;
@@ -705,20 +706,20 @@ double IntegrateBC(const GridFunction &x, const Array<int> &bdr,
// Integrate |alpha * n.Grad(x) + beta * x - gamma|^2
val -= gamma;
err += (val*val) * ip.weight * face_weight;
error += (val*val) * ip.weight * face_weight;
}
}
// Normalize by the length of the boundary
if (std::abs(nrm) > 0.0)
{
err /= nrm;
error /= nrm;
avg /= nrm;
}
// Compute l2 norm of the error in the boundary condition (negative
// quadrature weights may produce negative 'err')
err = (err >= 0.0) ? sqrt(err) : -sqrt(-err);
// quadrature weights may produce negative 'error')
error = (error >= 0.0) ? sqrt(error) : -sqrt(-error);
// Return the average value of alpha * n.Grad(x) + beta * x
return avg;
+17 -16
View File
@@ -75,7 +75,7 @@ Mesh * GenerateSerialMesh(int ref);
// alpha*n.Grad(sol) + beta*sol - gamma over the same boundary.
double IntegrateBC(const ParGridFunction &sol, const Array<int> &bdr_marker,
double alpha, double beta, double gamma,
double &err);
double &error);
int main(int argc, char *argv[])
{
@@ -321,26 +321,26 @@ int main(int argc, char *argv[])
{
// Integrate the solution on the Dirichlet boundary and compare to the
// expected value.
double err, avg = IntegrateBC(u, dbc_bdr, 0.0, 1.0, dbc_val, err);
double error, avg = IntegrateBC(u, dbc_bdr, 0.0, 1.0, dbc_val, error);
bool hom_dbc = (dbc_val == 0.0);
err /= hom_dbc ? 1.0 : fabs(dbc_val);
error /= hom_dbc ? 1.0 : fabs(dbc_val);
mfem::out << "Average of solution on Gamma_dbc:\t"
<< avg << ", \t"
<< (hom_dbc ? "absolute" : "relative")
<< " error " << err << endl;
<< " error " << error << endl;
}
{
// Integrate n.Grad(u) on the inhomogeneous Neumann boundary and compare
// to the expected value.
double err, avg = IntegrateBC(u, nbc_bdr, 1.0, 0.0, nbc_val, err);
double error, avg = IntegrateBC(u, nbc_bdr, 1.0, 0.0, nbc_val, error);
bool hom_nbc = (nbc_val == 0.0);
err /= hom_nbc ? 1.0 : fabs(nbc_val);
error /= hom_nbc ? 1.0 : fabs(nbc_val);
mfem::out << "Average of n.Grad(u) on Gamma_nbc:\t"
<< avg << ", \t"
<< (hom_nbc ? "absolute" : "relative")
<< " error " << err << endl;
<< " error " << error << endl;
}
{
// Integrate n.Grad(u) on the homogeneous Neumann boundary and compare to
@@ -349,25 +349,26 @@ int main(int argc, char *argv[])
nbc0_bdr = 0;
nbc0_bdr[3] = 1;
double err, avg = IntegrateBC(u, nbc0_bdr, 1.0, 0.0, 0.0, err);
double error, avg = IntegrateBC(u, nbc0_bdr, 1.0, 0.0, 0.0, error);
bool hom_nbc = true;
mfem::out << "Average of n.Grad(u) on Gamma_nbc0:\t"
<< avg << ", \t"
<< (hom_nbc ? "absolute" : "relative")
<< " error " << err << endl;
<< " error " << error << endl;
}
{
// Integrate n.Grad(u) + a * u on the Robin boundary and compare to the
// expected value.
double err, avg = IntegrateBC(u, rbc_bdr, 1.0, rbc_a_val, rbc_b_val, err);
double error, avg = IntegrateBC(u, rbc_bdr, 1.0, rbc_a_val, rbc_b_val,
error);
bool hom_rbc = (rbc_b_val == 0.0);
err /= hom_rbc ? 1.0 : fabs(rbc_b_val);
error /= hom_rbc ? 1.0 : fabs(rbc_b_val);
mfem::out << "Average of n.Grad(u)+a*u on Gamma_rbc:\t"
<< avg << ", \t"
<< (hom_rbc ? "absolute" : "relative")
<< " error " << err << endl;
<< " error " << error << endl;
}
// 15. Save the refined mesh and the solution in parallel. This output can be
@@ -667,11 +668,11 @@ double IntegrateBC(const ParGridFunction &x, const Array<int> &bdr,
double loc_vals[3];
double &nrm = loc_vals[0];
double &avg = loc_vals[1];
double &err = loc_vals[2];
double &error = loc_vals[2];
nrm = 0.0;
avg = 0.0;
err = 0.0;
error = 0.0;
const bool a_is_zero = alpha == 0.0;
const bool b_is_zero = beta == 0.0;
@@ -735,7 +736,7 @@ double IntegrateBC(const ParGridFunction &x, const Array<int> &bdr,
// Integrate |alpha * n.Grad(x) + beta * x - gamma|^2
val -= gamma;
err += (val*val) * ip.weight * face_weight;
error += (val*val) * ip.weight * face_weight;
}
}
@@ -754,7 +755,7 @@ double IntegrateBC(const ParGridFunction &x, const Array<int> &bdr,
}
// Compute l2 norm of the error in the boundary condition (negative
// quadrature weights may produce negative 'err')
// quadrature weights may produce negative 'error')
glb_err = (glb_err >= 0.0) ? sqrt(glb_err) : -sqrt(-glb_err);
// Return the average value of alpha * n.Grad(x) + beta * x
+3 -3
View File
@@ -81,10 +81,10 @@ Mesh * build_trapezoid_mesh(double offset)
int main(int argc, char *argv[])
{
#ifdef HYPRE_USING_CUDA
#ifdef HYPRE_USING_GPU
cout << "\nAs of mfem-4.3 and hypre-2.22.0 (July 2021) this example\n"
<< "is NOT supported with the CUDA version of hypre.\n\n";
return 255;
<< "is NOT supported with the GPU version of hypre.\n\n";
return 242;
#endif
// 1. Initialize MPI.
+2 -2
View File
@@ -167,9 +167,9 @@ int main(int argc, char *argv[])
// 13. Compute error in the solution and its flux
FunctionCoefficient uCoef(uExact);
double err = x.ComputeL2Error(uCoef);
double error = x.ComputeL2Error(uCoef);
cout << "|u - u_h|_2 = " << err << endl;
cout << "|u - u_h|_2 = " << error << endl;
FiniteElementSpace flux_fespace(mesh, &fec, 3);
GridFunction flux(&flux_fespace);
+2 -2
View File
@@ -197,9 +197,9 @@ int main(int argc, char *argv[])
// 15. Compute error in the solution and its flux
FunctionCoefficient uCoef(uExact);
double err = x.ComputeL2Error(uCoef);
double error = x.ComputeL2Error(uCoef);
if (myid == 0) { cout << "|u - u_h|_2 = " << err << endl; }
if (myid == 0) { cout << "|u - u_h|_2 = " << error << endl; }
ParFiniteElementSpace flux_fespace(&pmesh, &fec, 3);
ParGridFunction flux(&flux_fespace);
+2 -2
View File
@@ -255,10 +255,10 @@ int main(int argc, char *argv[])
// 15. Compute and print the L^2 norm of the error.
{
double err = x.ComputeL2Error(E);
double error = x.ComputeL2Error(E);
if (myid == 0)
{
cout << "\n|| E_h - E ||_{L^2} = " << err << '\n' << endl;
cout << "\n|| E_h - E ||_{L^2} = " << error << '\n' << endl;
}
}
+2 -2
View File
@@ -256,10 +256,10 @@ int main(int argc, char *argv[])
// 15. Compute and print the L^2 norm of the error.
{
double err = x.ComputeL2Error(F);
double error = x.ComputeL2Error(F);
if (myid == 0)
{
cout << "\n|| F_h - F ||_{L^2} = " << err << '\n' << endl;
cout << "\n|| F_h - F ||_{L^2} = " << error << '\n' << endl;
}
}
+1 -1
View File
@@ -197,7 +197,7 @@ int main(int argc, char *argv[])
SparseMatrix &M(mVarf->SpMat());
SparseMatrix &B(bVarf->SpMat());
B *= -1.;
if (Device::IsEnabled()) { B.BuildTranspose(); }
B.EnsureMultTranspose();
Bt = new TransposeOperator(&B);
darcyOp.SetBlock(0,0, &M);
+2 -2
View File
@@ -282,10 +282,10 @@ int main(int argc, char *argv[])
delete b;
// 12. Compute and print the L^2 norm of the error.
double err = x.ComputeL2Error(sol_coef);
double error = x.ComputeL2Error(sol_coef);
if (myid == 0)
{
cout << "\nL2 norm of error: " << err << endl;
cout << "\nL2 norm of error: " << error << endl;
}
// 13. Save the refined mesh and the solution. This output can be viewed
+1
View File
@@ -27,6 +27,7 @@
// ex9 -pa -m ../data/periodic-cube.mesh -d cuda
// ex9 -ea -m ../data/periodic-cube.mesh -d cuda
// ex9 -fa -m ../data/periodic-cube.mesh -d cuda
// ex9 -pa -m ../data/amr-quad.mesh -p 1 -r 2 -dt 0.002 -tf 9 -d cuda
//
// Description: This example code solves the time-dependent advection equation
// du/dt + v.grad(u) = 0, where v is a given fluid velocity, and
+1
View File
@@ -28,6 +28,7 @@
// mpirun -np 4 ex9p -pa -m ../data/periodic-cube.mesh -d cuda
// mpirun -np 4 ex9p -ea -m ../data/periodic-cube.mesh -d cuda
// mpirun -np 4 ex9p -fa -m ../data/periodic-cube.mesh -d cuda
// mpirun -np 4 ex9p -pa -m ../data/amr-quad.mesh -p 1 -rp 1 -dt 0.002 -tf 9 -d cuda
//
// Description: This example code solves the time-dependent advection equation
// du/dt + v.grad(u) = 0, where v is a given fluid velocity, and
+19 -3
View File
@@ -31,6 +31,10 @@
// also illustrated. The example also shows how to form a linear
// system using a PETSc matrix and solve with a PETSc solver.
//
// The example also show how to use the non-overlapping feature of
// the ParBilinearForm class to obtain the linear operator in
// a format suitable for the BDDC preconditioner in PETSc.
//
// We recommend viewing Example 1 before viewing this example.
#include "mfem.hpp"
@@ -61,10 +65,15 @@ int main(int argc, char *argv[])
bool use_petsc = true;
const char *petscrc_file = "";
bool use_nonoverlapping = false;
int ser_ref_levels = -1, par_ref_levels = 1;
OptionsParser args(argc, argv);
args.AddOption(&mesh_file, "-m", "--mesh",
"Mesh file to use.");
args.AddOption(&ser_ref_levels, "-rs", "--refine-serial",
"Number of times to refine the mesh uniformly in serial.");
args.AddOption(&par_ref_levels, "-rp", "--refine-parallel",
"Number of times to refine the mesh uniformly in parallel.");
args.AddOption(&order, "-o", "--order",
"Finite element order (polynomial degree).");
args.AddOption(&amg_elast, "-elast", "--amg-for-elasticity", "-sys",
@@ -131,8 +140,8 @@ int main(int argc, char *argv[])
// 'ref_levels' to be the largest number that gives a final mesh with no
// more than 1,000 elements.
{
int ref_levels =
(int)floor(log(1000./mesh->GetNE())/log(2.)/dim);
int ref_levels = ser_ref_levels >= 0 ? ser_ref_levels :
(int)floor(log(1000./mesh->GetNE())/log(2.)/dim);
for (int l = 0; l < ref_levels; l++)
{
mesh->UniformRefinement();
@@ -145,7 +154,6 @@ int main(int argc, char *argv[])
ParMesh *pmesh = new ParMesh(MPI_COMM_WORLD, *mesh);
delete mesh;
{
int par_ref_levels = 1;
for (int l = 0; l < par_ref_levels; l++)
{
pmesh->UniformRefinement();
@@ -296,12 +304,20 @@ int main(int argc, char *argv[])
PetscPreconditioner *prec = NULL;
if (use_nonoverlapping)
{
// Compute dofs belonging to the natural boundary
Array<int> nat_tdof_list, nat_bdr(pmesh->bdr_attributes.Max());
nat_bdr = 1;
nat_bdr[0] = 0;
fespace->GetEssentialTrueDofs(nat_bdr, nat_tdof_list);
// Auxiliary class for BDDC customization
PetscBDDCSolverParams opts;
// Inform the solver about the finite element space
opts.SetSpace(fespace);
// Inform the solver about essential dofs
opts.SetEssBdrDofs(&ess_tdof_list);
// Inform the solver about natural dofs
opts.SetNatBdrDofs(&nat_tdof_list);
// Create a BDDC solver with parameters
prec = new PetscBDDCSolver(A,opts);
pcg->SetPreconditioner(*prec);
+2
View File
@@ -77,6 +77,7 @@ EX1_ARGS_P := -m ../../data/amr-quad.mesh --usepetsc --petscopts rc_e
EX1_ARGS_CUDA := -m ../../data/star.mesh --usepetsc --partial-assembly --device cuda --petscopts rc_ex1p_cuda
EX1_ARGS_CUDAAMG := -m ../../data/star.mesh --usepetsc --device cuda --petscopts rc_ex1p_cudaamg
EX2_ARGS := -m ../../data/beam-quad.mesh --usepetsc --petscopts rc_ex2p
EX2_ARGS_BDDC := -m ../../data/beam-tri.mesh --usepetsc --nonoverlapping --petscopts rc_ex2p_bddc
EX3_ARGS := -m ../../data/klein-bottle.mesh -o 2 -f 0.1 --usepetsc --petscopts rc_ex3p_bddc --nonoverlapping
EX4_ARGS := -m ../../data/klein-bottle.mesh -o 2 --usepetsc --petscopts rc_ex4p_bddc --nonoverlapping
EX4_HYB_ARGS := -m ../../data/klein-bottle.mesh -o 2 --usepetsc --petscopts rc_ex4p_bddc --nonoverlapping --hybridization
@@ -107,6 +108,7 @@ ifeq ($(MFEM_USE_CUDA),YES)
endif
ex2p-test-par: ex2p
@$(call mfem-test,$<, $(RUN_MPI), $(TESTNAME),$(EX2_ARGS))
@$(call mfem-test,$<, $(RUN_MPI), $(TESTNAME),$(EX2_ARGS_BDDC))
ex3p-test-par: ex3p
@$(call mfem-test,$<, $(RUN_MPI), $(TESTNAME),$(EX3_ARGS))
ex4p-test-par: ex4p
+25
View File
@@ -0,0 +1,25 @@
# Sample options for BDDC
-ksp_converged_reason
-ksp_view
-pc_type bddc
# Turn on diagnostic for errors
#-pc_bddc_check_level 1
# This is an H1 problem, local problems may be singular
# Turn on automatic corner selection
-pc_bddc_corner_selection
# Advanced customization
# Deluxe scaling
-pc_bddc_use_deluxe_scaling
# Adaptive primal space (requires PETSc configured with MUMPS or PARDISO support)
#-pc_bddc_adaptive_threshold 1.2 # tolerance for eigenvalue selection
#-pc_bddc_adaptive_userdefined # preserve RBMs
#-pc_bddc_monolithic # treat all displacements components at once -> smaller primal spaces, larger eigenvalue problems
# Select solver for coarse problem
# -pc_bddc_coarse_pc_type cholesky
+1 -1
View File
@@ -145,7 +145,7 @@ int main(int argc, char *argv[])
// Perform Uniform refinement
if (ref_levels > 1)
{
ma::Input* uniInput = ma::configureUniformRefine(pumi_mesh, ref_levels);
auto uniInput = ma::configureUniformRefine(pumi_mesh, ref_levels);
if (geom_order > 1)
{
+2 -4
View File
@@ -150,7 +150,7 @@ int main(int argc, char *argv[])
if (ref_levels > 1)
{
ma::Input* uniInput = ma::configureUniformRefine(pumi_mesh, ref_levels);
auto uniInput = ma::configureUniformRefine(pumi_mesh, ref_levels);
if ( geom_order > 1)
{
@@ -345,9 +345,7 @@ int main(int argc, char *argv[])
apf::destroyField(ipfield);
// 18. Perform MesAdapt.
ma::Input* erinput = ma::configure(pumi_mesh, sizefield);
erinput->shouldFixShape = true;
erinput->maximumIterations = 2;
auto erinput = ma::configure(pumi_mesh, sizefield);
if ( geom_order > 1)
{
crv::adapt(erinput);
+25 -25
View File
@@ -333,9 +333,9 @@ void BilinearForm::AssembleElementMatrix(
}
void BilinearForm::AssembleElementMatrix(
int i, const DenseMatrix &elmat, Array<int> &vdofs, int skip_zeros)
int i, const DenseMatrix &elmat, Array<int> &vdofs_, int skip_zeros)
{
fes->GetElementVDofs(i, vdofs);
fes->GetElementVDofs(i, vdofs_);
if (static_cond)
{
static_cond->AssembleMatrix(i, elmat);
@@ -346,7 +346,7 @@ void BilinearForm::AssembleElementMatrix(
{
AllocMat();
}
mat->AddSubMatrix(vdofs, vdofs, elmat, skip_zeros);
mat->AddSubMatrix(vdofs_, vdofs_, elmat, skip_zeros);
if (hybridization)
{
hybridization->AssembleMatrix(i, elmat);
@@ -361,9 +361,9 @@ void BilinearForm::AssembleBdrElementMatrix(
}
void BilinearForm::AssembleBdrElementMatrix(
int i, const DenseMatrix &elmat, Array<int> &vdofs, int skip_zeros)
int i, const DenseMatrix &elmat, Array<int> &vdofs_, int skip_zeros)
{
fes->GetBdrElementVDofs(i, vdofs);
fes->GetBdrElementVDofs(i, vdofs_);
if (static_cond)
{
static_cond->AssembleBdrMatrix(i, elmat);
@@ -374,7 +374,7 @@ void BilinearForm::AssembleBdrElementMatrix(
{
AllocMat();
}
mat->AddSubMatrix(vdofs, vdofs, elmat, skip_zeros);
mat->AddSubMatrix(vdofs_, vdofs_, elmat, skip_zeros);
if (hybridization)
{
hybridization->AssembleBdrMatrix(i, elmat);
@@ -965,14 +965,14 @@ void BilinearForm::EliminateEssentialBCDiag (const Array<int> &bdr_attr_is_ess,
}
}
void BilinearForm::EliminateVDofs(const Array<int> &vdofs,
void BilinearForm::EliminateVDofs(const Array<int> &vdofs_,
const Vector &sol, Vector &rhs,
DiagonalPolicy dpolicy)
{
vdofs.HostRead();
for (int i = 0; i < vdofs.Size(); i++)
vdofs_.HostRead();
for (int i = 0; i < vdofs_.Size(); i++)
{
int vdof = vdofs[i];
int vdof = vdofs_[i];
if ( vdof >= 0 )
{
mat -> EliminateRowCol (vdof, sol(vdof), rhs, dpolicy);
@@ -984,7 +984,7 @@ void BilinearForm::EliminateVDofs(const Array<int> &vdofs,
}
}
void BilinearForm::EliminateVDofs(const Array<int> &vdofs,
void BilinearForm::EliminateVDofs(const Array<int> &vdofs_,
DiagonalPolicy dpolicy)
{
if (mat_e == NULL)
@@ -992,9 +992,9 @@ void BilinearForm::EliminateVDofs(const Array<int> &vdofs,
mat_e = new SparseMatrix(height);
}
for (int i = 0; i < vdofs.Size(); i++)
for (int i = 0; i < vdofs_.Size(); i++)
{
int vdof = vdofs[i];
int vdof = vdofs_[i];
if ( vdof >= 0 )
{
mat -> EliminateRowCol (vdof, *mat_e, dpolicy);
@@ -1046,10 +1046,10 @@ void BilinearForm::EliminateEssentialBCFromDofsDiag (const Array<int> &ess_dofs,
}
void BilinearForm::EliminateVDofsInRHS(
const Array<int> &vdofs, const Vector &x, Vector &b)
const Array<int> &vdofs_, const Vector &x, Vector &b)
{
mat_e->AddMult(x, b, -1.);
mat->PartMult(vdofs, x, b);
mat->PartMult(vdofs_, x, b);
}
void BilinearForm::Mult(const Vector &x, Vector &y) const
@@ -1653,16 +1653,16 @@ void MixedBilinearForm::AssembleElementMatrix(
}
void MixedBilinearForm::AssembleElementMatrix(
int i, const DenseMatrix &elmat, Array<int> &trial_vdofs,
Array<int> &test_vdofs, int skip_zeros)
int i, const DenseMatrix &elmat, Array<int> &trial_vdofs_,
Array<int> &test_vdofs_, int skip_zeros)
{
trial_fes->GetElementVDofs(i, trial_vdofs);
test_fes->GetElementVDofs(i, test_vdofs);
trial_fes->GetElementVDofs(i, trial_vdofs_);
test_fes->GetElementVDofs(i, test_vdofs_);
if (mat == NULL)
{
mat = new SparseMatrix(height, width);
}
mat->AddSubMatrix(test_vdofs, trial_vdofs, elmat, skip_zeros);
mat->AddSubMatrix(test_vdofs_, trial_vdofs_, elmat, skip_zeros);
}
void MixedBilinearForm::AssembleBdrElementMatrix(
@@ -1672,16 +1672,16 @@ void MixedBilinearForm::AssembleBdrElementMatrix(
}
void MixedBilinearForm::AssembleBdrElementMatrix(
int i, const DenseMatrix &elmat, Array<int> &trial_vdofs,
Array<int> &test_vdofs, int skip_zeros)
int i, const DenseMatrix &elmat, Array<int> &trial_vdofs_,
Array<int> &test_vdofs_, int skip_zeros)
{
trial_fes->GetBdrElementVDofs(i, trial_vdofs);
test_fes->GetBdrElementVDofs(i, test_vdofs);
trial_fes->GetBdrElementVDofs(i, trial_vdofs_);
test_fes->GetBdrElementVDofs(i, test_vdofs_);
if (mat == NULL)
{
mat = new SparseMatrix(height, width);
}
mat->AddSubMatrix(test_vdofs, trial_vdofs, elmat, skip_zeros);
mat->AddSubMatrix(test_vdofs_, trial_vdofs_, elmat, skip_zeros);
}
void MixedBilinearForm::EliminateTrialDofs (
+4
View File
@@ -514,6 +514,10 @@ void EABilinearFormExtension::Assemble()
Array<BilinearFormIntegrator*> &integrators = *a->GetDBFI();
const int integratorCount = integrators.Size();
if ( integratorCount == 0 )
{
ea_data = 0.0;
}
for (int i = 0; i < integratorCount; ++i)
{
integrators[i]->AssembleEA(*a->FESpace(), ea_data, i);
+34 -34
View File
@@ -659,7 +659,7 @@ void GradientIntegrator::AssembleElementMatrix2(
const FiniteElement &trial_fe, const FiniteElement &test_fe,
ElementTransformation &Trans, DenseMatrix &elmat)
{
int dim = test_fe.GetDim();
dim = test_fe.GetDim();
int trial_dof = trial_fe.GetDof();
int test_dof = test_fe.GetDof();
double c;
@@ -726,7 +726,7 @@ void DiffusionIntegrator::AssembleElementMatrix
DenseMatrix &elmat )
{
int nd = el.GetDof();
int dim = el.GetDim();
dim = el.GetDim();
int spaceDim = Trans.GetSpaceDim();
bool square = (dim == spaceDim);
double w;
@@ -802,7 +802,7 @@ void DiffusionIntegrator::AssembleElementMatrix2(
{
int tr_nd = trial_fe.GetDof();
int te_nd = test_fe.GetDof();
int dim = trial_fe.GetDim();
dim = trial_fe.GetDim();
int spaceDim = Trans.GetSpaceDim();
bool square = (dim == spaceDim);
double w;
@@ -885,7 +885,7 @@ void DiffusionIntegrator::AssembleElementVector(
Vector &elvect)
{
int nd = el.GetDof();
int dim = el.GetDim();
dim = el.GetDim();
int spaceDim = Tr.GetSpaceDim();
double w;
@@ -966,7 +966,7 @@ void DiffusionIntegrator::ComputeElementFlux
( const FiniteElement &el, ElementTransformation &Trans,
Vector &u, const FiniteElement &fluxelem, Vector &flux, bool with_coef )
{
int i, j, nd, dim, spaceDim, fnd;
int nd, spaceDim, fnd;
nd = el.GetDof();
dim = el.GetDim();
@@ -1005,7 +1005,7 @@ void DiffusionIntegrator::ComputeElementFlux
fnd = ir.GetNPoints();
flux.SetSize( fnd * spaceDim );
for (i = 0; i < fnd; i++)
for (int i = 0; i < fnd; i++)
{
const IntegrationPoint &ip = ir.IntPoint(i);
el.CalcDShape(ip, dshape);
@@ -1023,7 +1023,7 @@ void DiffusionIntegrator::ComputeElementFlux
{
vecdxt *= Q->Eval(Trans,ip);
}
for (j = 0; j < spaceDim; j++)
for (int j = 0; j < spaceDim; j++)
{
flux(fnd*j+i) = vecdxt(j);
}
@@ -1043,7 +1043,7 @@ void DiffusionIntegrator::ComputeElementFlux
pointflux[j] = D[j] * vecdxt[j];
}
}
for (j = 0; j < spaceDim; j++)
for (int j = 0; j < spaceDim; j++)
{
flux(fnd*j+i) = pointflux(j);
}
@@ -1051,7 +1051,7 @@ void DiffusionIntegrator::ComputeElementFlux
}
else
{
for (j = 0; j < spaceDim; j++)
for (int j = 0; j < spaceDim; j++)
{
flux(fnd*j+i) = vecdxt(j);
}
@@ -1064,7 +1064,7 @@ double DiffusionIntegrator::ComputeFluxEnergy
Vector &flux, Vector* d_energy)
{
int nd = fluxelem.GetDof();
int dim = fluxelem.GetDim();
dim = fluxelem.GetDim();
int spaceDim = Trans.GetSpaceDim();
#ifdef MFEM_THREAD_SAFE
@@ -1295,7 +1295,7 @@ void ConvectionIntegrator::AssembleElementMatrix(
const FiniteElement &el, ElementTransformation &Trans, DenseMatrix &elmat)
{
int nd = el.GetDof();
int dim = el.GetDim();
dim = el.GetDim();
#ifdef MFEM_THREAD_SAFE
DenseMatrix dshape, adjJ, Q_ir;
@@ -1864,7 +1864,7 @@ void CurlCurlIntegrator::AssembleElementMatrix
DenseMatrix &elmat )
{
int nd = el.GetDof();
int dim = el.GetDim();
dim = el.GetDim();
int dimc = (dim == 3) ? 3 : 1;
double w;
@@ -1961,7 +1961,7 @@ double CurlCurlIntegrator::ComputeFluxEnergy(const FiniteElement &fluxelem,
Vector &flux, Vector *d_energy)
{
int nd = fluxelem.GetDof();
int dim = fluxelem.GetDim();
dim = fluxelem.GetDim();
#ifdef MFEM_THREAD_SAFE
DenseMatrix vshape;
@@ -2420,7 +2420,7 @@ void VectorDivergenceIntegrator::AssembleElementMatrix2(
ElementTransformation &Trans,
DenseMatrix &elmat)
{
int dim = trial_fe.GetDim();
dim = trial_fe.GetDim();
int trial_dof = trial_fe.GetDof();
int test_dof = test_fe.GetDof();
double c;
@@ -2523,9 +2523,9 @@ void VectorDiffusionIntegrator::AssembleElementMatrix(
ElementTransformation &Trans,
DenseMatrix &elmat)
{
const int dim = el.GetDim();
const int dof = el.GetDof();
const int sdim = Trans.GetSpaceDim();
dim = el.GetDim();
sdim = Trans.GetSpaceDim();
// If vdim is not set, set it to the space dimension;
vdim = (vdim <= 0) ? sdim : vdim;
@@ -2579,12 +2579,12 @@ void VectorDiffusionIntegrator::AssembleElementMatrix(
else if (MQ)
{
MQ->Eval(mcoeff, Trans, ip);
for (int i = 0; i < vdim; ++i)
for (int ii = 0; ii < vdim; ++ii)
{
for (int j = 0; j < vdim; ++j)
for (int jj = 0; jj < vdim; ++jj)
{
Mult_a_AAt(w*mcoeff(i,j), dshapedxt, pelmat);
elmat.AddMatrix(pelmat, dof*i, dof*j);
Mult_a_AAt(w*mcoeff(ii,jj), dshapedxt, pelmat);
elmat.AddMatrix(pelmat, dof*ii, dof*jj);
}
}
}
@@ -2604,9 +2604,9 @@ void VectorDiffusionIntegrator::AssembleElementVector(
const FiniteElement &el, ElementTransformation &Tr,
const Vector &elfun, Vector &elvect)
{
const int dim = el.GetDim();
const int dof = el.GetDof();
const int sdim = Tr.GetSpaceDim();
dim = el.GetDim();
sdim = Tr.GetSpaceDim();
// If vdim is not set, set it to the space dimension;
vdim = (vdim <= 0) ? sdim : vdim;
@@ -2665,13 +2665,13 @@ void VectorDiffusionIntegrator::AssembleElementVector(
else if (MQ)
{
MQ->Eval(mcoeff, Tr, ip);
for (int i = 0; i < vdim; ++i)
for (int ii = 0; ii < vdim; ++ii)
{
Vector vec_out(mat_out.GetColumn(i), dof);
for (int j = 0; j < vdim; ++j)
Vector vec_out(mat_out.GetColumn(ii), dof);
for (int jj = 0; jj < vdim; ++jj)
{
pelmat *= w*mcoeff(i,j);
const Vector vec_in(mat_in.GetColumn(j), dof);
pelmat *= w*mcoeff(ii,jj);
const Vector vec_in(mat_in.GetColumn(jj), dof);
pelmat.Mult(vec_in, vec_out);
}
}
@@ -2759,14 +2759,14 @@ void ElasticityIntegrator::AssembleElementMatrix(
elmat (dof*d+k, dof*d+l) += (M * w) * pelmat(k, l);
}
}
for (int i = 0; i < dim; i++)
for (int j = 0; j < dim; j++)
for (int ii = 0; ii < dim; ii++)
for (int jj = 0; jj < dim; jj++)
{
for (int k = 0; k < dof; k++)
for (int l = 0; l < dof; l++)
for (int kk = 0; kk < dof; kk++)
for (int ll = 0; ll < dof; ll++)
{
elmat(dof*i+k, dof*j+l) +=
(M * w) * gshape(k, j) * gshape(l, i);
elmat(dof*ii+kk, dof*jj+ll) +=
(M * w) * gshape(kk, jj) * gshape(ll, ii);
}
}
}
@@ -2947,7 +2947,7 @@ void DGTraceIntegrator::AssembleFaceMatrix(const FiniteElement &el1,
FaceElementTransformations &Trans,
DenseMatrix &elmat)
{
int dim, ndof1, ndof2;
int ndof1, ndof2;
double un, a, b, w;
+5 -5
View File
@@ -644,13 +644,13 @@ protected:
inline virtual void CalcVShape(const FiniteElement & vector_fe,
ElementTransformation &Trans,
DenseMatrix & shape)
{ vector_fe.CalcVShape(Trans, shape); }
DenseMatrix & shape_)
{ vector_fe.CalcVShape(Trans, shape_); }
inline virtual void CalcShape(const FiniteElement & scalar_fe,
ElementTransformation &Trans,
Vector & shape)
{ scalar_fe.CalcPhysShape(Trans, shape); }
Vector & shape_)
{ scalar_fe.CalcPhysShape(Trans, shape_); }
VectorCoefficient *VQ;
bool transpose;
@@ -2258,7 +2258,7 @@ public:
: vdim(q.GetVDim()), Q_order(qo), Q(NULL), VQ(NULL), MQ(&q) { }
int GetVDim() const { return vdim; }
void SetVDim(int vdim) { this->vdim = vdim; }
void SetVDim(int vdim_) { vdim = vdim_; }
virtual void AssembleElementMatrix(const FiniteElement &el,
ElementTransformation &Trans,
+26 -20
View File
@@ -182,22 +182,26 @@ void DGTraceIntegrator::SetupPA(const FiniteElementSpace &fes, FaceType type)
auto C = Reshape(vel.HostWrite(), dim, nq, nf);
Vector Vq(dim);
int f_ind = 0;
for (int f = 0; f < fes.GetNF(); ++f)
for (int f = 0; f < mesh->GetNumFacesWithGhost(); ++f)
{
int e1, e2;
int inf1, inf2;
fes.GetMesh()->GetFaceElements(f, &e1, &e2);
fes.GetMesh()->GetFaceInfos(f, &inf1, &inf2);
int face_id = inf1 / 64;
if ((type==FaceType::Interior && (e2>=0 || (e2<0 && inf2>=0))) ||
(type==FaceType::Boundary && e2<0 && inf2<0) )
Mesh::FaceInformation face = mesh->GetFaceInformation(f);
if (face.IsNonconformingCoarse())
{
// We skip nonconforming coarse faces as they are treated
// by the corresponding nonconforming fine faces.
continue;
}
else if ( face.IsOfFaceType(type) )
{
const int mask = FaceElementTransformations::HAVE_ELEM1 |
FaceElementTransformations::HAVE_LOC1;
FaceElementTransformations &T =
*fes.GetMesh()->GetFaceElementTransformations(f);
*fes.GetMesh()->GetFaceElementTransformations(f, mask);
for (int q = 0; q < nq; ++q)
{
// Convert to lexicographic ordering
int iq = ToLexOrdering(dim, face_id, quad1D, q);
int iq = ToLexOrdering(dim, face.element[0].local_face_id,
quad1D, q);
T.SetAllIntPoints(&ir->IntPoint(q));
const IntegrationPoint &eip1 = T.GetElement1IntPoint();
u->Eval(Vq, *T.Elem1, eip1);
@@ -242,29 +246,31 @@ void DGTraceIntegrator::SetupPA(const FiniteElementSpace &fes, FaceType type)
auto n = Reshape(geom->normal.HostRead(), nq, dim, nf);
auto C = Reshape(r.HostWrite(), nq, nf);
int f_ind = 0;
for (int f = 0; f < fes.GetNF(); ++f)
for (int f = 0; f < mesh->GetNumFacesWithGhost(); ++f)
{
int e1, e2;
int inf1, inf2;
fes.GetMesh()->GetFaceElements(f, &e1, &e2);
fes.GetMesh()->GetFaceInfos(f, &inf1, &inf2);
int face_id = inf1 / 64;
if ((type==FaceType::Interior && (e2>=0 || (e2<0 && inf2>=0))) ||
(type==FaceType::Boundary && e2<0 && inf2<0) )
Mesh::FaceInformation face = mesh->GetFaceInformation(f);
if (face.IsNonconformingCoarse())
{
// We skip nonconforming coarse faces as they are treated
// by the corresponding nonconforming fine faces.
continue;
}
else if ( face.IsOfFaceType(type) )
{
FaceElementTransformations &T =
*fes.GetMesh()->GetFaceElementTransformations(f);
for (int q = 0; q < nq; ++q)
{
// Convert to lexicographic ordering
int iq = ToLexOrdering(dim, face_id, quad1D, q);
int iq = ToLexOrdering(dim, face.element[0].local_face_id,
quad1D, q);
T.SetAllIntPoints(&ir->IntPoint(q));
const IntegrationPoint &eip1 = T.GetElement1IntPoint();
const IntegrationPoint &eip2 = T.GetElement2IntPoint();
double r;
if (inf2 < 0)
if ( face.IsBoundary() )
{
r = rho->Eval(*T.Elem1, eip1);
}
+5 -2
View File
@@ -41,6 +41,7 @@ void MassIntegrator::AssemblePA(const FiniteElementSpace &fes)
ceedOp = new ceed::PAMassIntegrator(fes, *ir, Q);
return;
}
int map_type = el.GetMapType();
dim = mesh->Dimension();
ne = fes.GetMesh()->GetNE();
nq = ir->GetNPoints();
@@ -93,6 +94,7 @@ void MassIntegrator::AssemblePA(const FiniteElementSpace &fes)
const int NE = ne;
const int Q1D = quad1D;
const bool const_c = coeff.Size() == 1;
const bool by_val = map_type == FiniteElement::VALUE;
const auto W = Reshape(ir->GetWeights().Read(), Q1D,Q1D);
const auto J = Reshape(geom->J.Read(), Q1D,Q1D,2,2,NE);
const auto C = const_c ? Reshape(coeff.Read(), 1,1,1) :
@@ -110,7 +112,7 @@ void MassIntegrator::AssemblePA(const FiniteElementSpace &fes)
const double J22 = J(qx,qy,1,1,e);
const double detJ = (J11*J22)-(J21*J12);
const double coeff = const_c ? C(0,0,0) : C(qx,qy,e);
v(qx,qy,e) = W(qx,qy) * coeff * detJ;
v(qx,qy,e) = W(qx,qy) * coeff * (by_val ? detJ : 1.0/detJ);
}
}
});
@@ -120,6 +122,7 @@ void MassIntegrator::AssemblePA(const FiniteElementSpace &fes)
const int NE = ne;
const int Q1D = quad1D;
const bool const_c = coeff.Size() == 1;
const bool by_val = map_type == FiniteElement::VALUE;
const auto W = Reshape(ir->GetWeights().Read(), Q1D,Q1D,Q1D);
const auto J = Reshape(geom->J.Read(), Q1D,Q1D,Q1D,3,3,NE);
const auto C = const_c ? Reshape(coeff.Read(), 1,1,1,1) :
@@ -146,7 +149,7 @@ void MassIntegrator::AssemblePA(const FiniteElementSpace &fes)
/* */ J21 * (J12 * J33 - J32 * J13) +
/* */ J31 * (J12 * J23 - J22 * J13);
const double coeff = const_c ? C(0,0,0,0) : C(qx,qy,qz,e);
v(qx,qy,qz,e) = W(qx,qy,qz) * coeff * detJ;
v(qx,qy,qz,e) = W(qx,qy,qz) * coeff * (by_val ? detJ : 1.0/detJ);
}
}
}
+1 -1
View File
@@ -667,7 +667,7 @@ AlgebraicSpaceHierarchy::AlgebraicSpaceHierarchy(FiniteElementSpace &fes)
const SparseMatrix *R = fespaces[ilevel+1]->GetRestrictionMatrix();
if (R)
{
R->BuildTranspose();
R->EnsureMultTranspose();
R_tr[ilevel] = new TransposeOperator(*R);
}
else
+98 -7
View File
@@ -21,6 +21,33 @@ namespace mfem
using namespace std;
// Given an ElementTransformation and IntegrationPoint in a refined mesh,
// return the ElementTransformation of the parent coarse element, and set
// coarse_ip to the location of the original ip within the coarse element.
ElementTransformation *RefinedToCoarse(
Mesh &coarse_mesh, const ElementTransformation &T,
const IntegrationPoint &ip, IntegrationPoint &coarse_ip)
{
Mesh &fine_mesh = *T.mesh;
// Get the element transformation of the coarse element containing the
// fine element.
int fine_element = T.ElementNo;
const CoarseFineTransformations &cf = fine_mesh.GetRefinementTransforms();
int coarse_element = cf.embeddings[fine_element].parent;
ElementTransformation *coarse_T = coarse_mesh.GetElementTransformation(
coarse_element);
// Transform the integration point from fine element coordinates to coarse
// element coordinates.
Geometry::Type geom = T.GetGeometryType();
IntegrationPointTransformation fine_to_coarse;
IsoparametricTransformation &emb_tr = fine_to_coarse.Transf;
emb_tr.SetIdentityTransformation(geom);
emb_tr.SetPointMat(cf.point_matrices[geom](cf.embeddings[fine_element].matrix));
fine_to_coarse.Transform(ip, coarse_ip);
coarse_T->SetIntPoint(&coarse_ip);
return coarse_T;
}
double PWConstCoefficient::Eval(ElementTransformation & T,
const IntegrationPoint & ip)
{
@@ -95,7 +122,17 @@ double FunctionCoefficient::Eval(ElementTransformation & T,
double GridFunctionCoefficient::Eval (ElementTransformation &T,
const IntegrationPoint &ip)
{
return GridF -> GetValue (T, ip, Component);
Mesh *gf_mesh = GridF->FESpace()->GetMesh();
if (T.mesh == gf_mesh)
{
return GridF->GetValue(T, ip, Component);
}
else
{
IntegrationPoint coarse_ip;
ElementTransformation *coarse_T = RefinedToCoarse(*gf_mesh, T, ip, coarse_ip);
return GridF->GetValue(*coarse_T, coarse_ip, Component);
}
}
void TransformedCoefficient::SetTime(double t)
@@ -305,13 +342,30 @@ void VectorGridFunctionCoefficient::SetGridFunction(const GridFunction *gf)
void VectorGridFunctionCoefficient::Eval(Vector &V, ElementTransformation &T,
const IntegrationPoint &ip)
{
GridFunc->GetVectorValue(T, ip, V);
Mesh *gf_mesh = GridFunc->FESpace()->GetMesh();
if (T.mesh == gf_mesh)
{
GridFunc->GetVectorValue(T, ip, V);
}
else
{
IntegrationPoint coarse_ip;
ElementTransformation *coarse_T = RefinedToCoarse(*gf_mesh, T, ip, coarse_ip);
GridFunc->GetVectorValue(*coarse_T, coarse_ip, V);
}
}
void VectorGridFunctionCoefficient::Eval(
DenseMatrix &M, ElementTransformation &T, const IntegrationRule &ir)
{
GridFunc->GetVectorValues(T, ir, M);
if (T.mesh == GridFunc->FESpace()->GetMesh())
{
GridFunc->GetVectorValues(T, ir, M);
}
else
{
VectorCoefficient::Eval(M, T, ir);
}
}
GradientGridFunctionCoefficient::GradientGridFunctionCoefficient (
@@ -331,13 +385,30 @@ void GradientGridFunctionCoefficient::SetGridFunction(const GridFunction *gf)
void GradientGridFunctionCoefficient::Eval(Vector &V, ElementTransformation &T,
const IntegrationPoint &ip)
{
GridFunc->GetGradient(T, V);
Mesh *gf_mesh = GridFunc->FESpace()->GetMesh();
if (T.mesh == gf_mesh)
{
GridFunc->GetGradient(T, V);
}
else
{
IntegrationPoint coarse_ip;
ElementTransformation *coarse_T = RefinedToCoarse(*gf_mesh, T, ip, coarse_ip);
GridFunc->GetGradient(*coarse_T, V);
}
}
void GradientGridFunctionCoefficient::Eval(
DenseMatrix &M, ElementTransformation &T, const IntegrationRule &ir)
{
GridFunc->GetGradients(T, ir, M);
if (T.mesh == GridFunc->FESpace()->GetMesh())
{
GridFunc->GetGradients(T, ir, M);
}
else
{
VectorCoefficient::Eval(M, T, ir);
}
}
CurlGridFunctionCoefficient::CurlGridFunctionCoefficient(
@@ -363,7 +434,17 @@ void CurlGridFunctionCoefficient::SetGridFunction(const GridFunction *gf)
void CurlGridFunctionCoefficient::Eval(Vector &V, ElementTransformation &T,
const IntegrationPoint &ip)
{
GridFunc->GetCurl(T, V);
Mesh *gf_mesh = GridFunc->FESpace()->GetMesh();
if (T.mesh == gf_mesh)
{
GridFunc->GetCurl(T, V);
}
else
{
IntegrationPoint coarse_ip;
ElementTransformation *coarse_T = RefinedToCoarse(*gf_mesh, T, ip, coarse_ip);
GridFunc->GetCurl(*coarse_T, V);
}
}
DivergenceGridFunctionCoefficient::DivergenceGridFunctionCoefficient (
@@ -375,7 +456,17 @@ DivergenceGridFunctionCoefficient::DivergenceGridFunctionCoefficient (
double DivergenceGridFunctionCoefficient::Eval(ElementTransformation &T,
const IntegrationPoint &ip)
{
return GridFunc->GetDivergence(T);
Mesh *gf_mesh = GridFunc->FESpace()->GetMesh();
if (T.mesh == gf_mesh)
{
return GridFunc->GetDivergence(T);
}
else
{
IntegrationPoint coarse_ip;
ElementTransformation *coarse_T = RefinedToCoarse(*gf_mesh, T, ip, coarse_ip);
return GridFunc->GetDivergence(*coarse_T);
}
}
void VectorDeltaCoefficient::SetTime(double t)
+5 -4
View File
@@ -574,6 +574,7 @@ public:
/// Evaluate the coefficient.
virtual void Eval(Vector &V, ElementTransformation &T,
const IntegrationPoint &ip);
using VectorCoefficient::Eval;
};
/// A general vector function coefficient
@@ -1604,22 +1605,22 @@ public:
void SetTime(double t);
/// Reset the first vector coefficient
void SetACoef(VectorCoefficient &A) { ACoef = &A; }
void SetACoef(VectorCoefficient &A_) { ACoef = &A_; }
/// Return the first vector coefficient
VectorCoefficient * GetACoef() const { return ACoef; }
/// Reset the second vector coefficient
void SetBCoef(VectorCoefficient &B) { BCoef = &B; }
void SetBCoef(VectorCoefficient &B_) { BCoef = &B_; }
/// Return the second vector coefficient
VectorCoefficient * GetBCoef() const { return BCoef; }
/// Reset the factor in front of the first vector coefficient
void SetAlphaCoef(Coefficient &A) { alphaCoef = &A; }
void SetAlphaCoef(Coefficient &A_) { alphaCoef = &A_; }
/// Return the factor in front of the first vector coefficient
Coefficient * GetAlphaCoef() const { return alphaCoef; }
/// Reset the factor in front of the second vector coefficient
void SetBetaCoef(Coefficient &B) { betaCoef = &B; }
void SetBetaCoef(Coefficient &B_) { betaCoef = &B_; }
/// Return the factor in front of the second vector coefficient
Coefficient * GetBetaCoef() const { return betaCoef; }
+2 -2
View File
@@ -1243,7 +1243,7 @@ ParSesquilinearForm::FormLinearSystem(const Array<int> &ess_tdof_list,
HypreParMatrix * Ah;
A_i.Get(Ah);
hypre_ParCSRMatrix *Aih = *Ah;
#ifndef HYPRE_USING_CUDA
#if !defined(HYPRE_USING_GPU)
ess_tdof_list.HostRead();
for (int k = 0; k < n; k++)
{
@@ -1256,7 +1256,7 @@ ParSesquilinearForm::FormLinearSystem(const Array<int> &ess_tdof_list,
ess_tdof_list.GetMemory().Read(MemoryClass::DEVICE, n);
const int *d_diag_i = Aih->diag->i;
double *d_diag_data = Aih->diag->data;
CuWrap1D(n, [=] MFEM_DEVICE (int k)
MFEM_GPU_FORALL(k, n,
{
const int j = d_ess_tdof_list[k];
d_diag_data[d_diag_i[j]] = 0.0;
+1 -1
View File
@@ -330,7 +330,7 @@ ConduitDataCollection::BlueprintMeshToMesh(const Node &n_mesh,
}
else
{
Node &(n_bndry_conn_conv) =
Node &n_bndry_conn_conv =
n_conv["topologies"][bndry_topo_name]["elements/connectivity"];
n_bndry_conn.to_int_array(n_bndry_conn_conv);
bndry_indices = (n_bndry_conn_conv).value();
+128 -136
View File
@@ -11,6 +11,7 @@
#include "fem.hpp"
#include "../mesh/nurbs.hpp"
#include "../mesh/vtk.hpp"
#include "../general/binaryio.hpp"
#include "../general/text.hpp"
#include "picojson.h"
@@ -187,7 +188,7 @@ void DataCollection::SetPrefixPath(const std::string& prefix)
}
}
void DataCollection::Load(int cycle)
void DataCollection::Load(int cycle_)
{
MFEM_ABORT("this method is not implemented");
}
@@ -787,53 +788,44 @@ void ParaViewDataCollection::Load(int )
std::string ParaViewDataCollection::GenerateCollectionPath()
{
std::string out = "";
out = prefix_path + DataCollection::GetCollectionName();
return out;
return prefix_path + DataCollection::GetCollectionName();
}
std::string ParaViewDataCollection::GeneratePVTUPath()
{
std::string out = "Cycle" + to_padded_string(cycle,pad_digits_cycle);
return out;
return "Cycle" + to_padded_string(cycle,pad_digits_cycle);
}
std::string ParaViewDataCollection::GenerateVTUPath()
{
std::string out = GeneratePVTUPath();
return out;
return GeneratePVTUPath();
}
std::string ParaViewDataCollection::GeneratePVDFileName()
{
std::string out = GetCollectionName()+".pvd";
return out;
return GetCollectionName() + ".pvd";
}
std::string ParaViewDataCollection::GeneratePVTUFileName()
std::string ParaViewDataCollection::GeneratePVTUFileName(
const std::string &prefix)
{
std::string out = "data.pvtu";
return out;
return prefix + ".pvtu";
}
std::string ParaViewDataCollection::GenerateVTUFileName()
std::string ParaViewDataCollection::GenerateVTUFileName(
const std::string &prefix, int rank)
{
std::string out = "proc" + to_padded_string(myid,pad_digits_rank)+".vtu";
return out;
}
std::string ParaViewDataCollection::GenerateVTUFileName(int crank)
{
std::string out = "proc" + to_padded_string(crank,pad_digits_rank)+".vtu";
return out;
return prefix + to_padded_string(rank, pad_digits_rank) + ".vtu";
}
void ParaViewDataCollection::Save()
{
// add a new collection to the PDV file
std::string col_path = GenerateCollectionPath();
// check if the directories are created
{
std::string path = GenerateCollectionPath()+"/"+GenerateVTUPath();
std::string path = col_path + "/" + GenerateVTUPath();
int err = create_directory(path, mesh, myid);
if (err)
{
@@ -850,8 +842,7 @@ void ParaViewDataCollection::Save()
if (myid == 0 && !pvd_stream.is_open())
{
std::string dpath=GenerateCollectionPath();
std::string pvdname=dpath+"/"+GeneratePVDFileName();
std::string pvdname = col_path + "/" + GeneratePVDFileName();
bool write_header = true;
std::ifstream pvd_in;
@@ -915,80 +906,87 @@ void ParaViewDataCollection::Save()
}
}
// define the vtu file
std::string vtu_prefix = col_path + "/" + GenerateVTUPath() + "/";
// Save the local part of the mesh and grid functions fields to the local
// VTU file
{
std::string fname = GenerateCollectionPath()+"/"+GenerateVTUPath()+"/"
+GenerateVTUFileName();
std::fstream out(fname, std::ios::out);
std::ofstream out(vtu_prefix + GenerateVTUFileName("proc", myid));
out.precision(precision);
SaveDataVTU(out,levels_of_detail);
out.close();
SaveDataVTU(out, levels_of_detail);
}
// define the pvtu file only on process 0
if (myid==0)
// Save the local part of the quadrature function fields
for (const auto &qfield : q_field_map)
{
std::string fname = GenerateCollectionPath()+"/"+GeneratePVTUPath()+"/"
+GeneratePVTUFileName();
std::fstream out(fname, std::ios::out);
const std::string &field_name = qfield.first;
std::ofstream out(vtu_prefix + GenerateVTUFileName(field_name, myid));
qfield.second->SaveVTU(out, pv_data_format, compression);
}
out << "<?xml version=\"1.0\"?>\n";
out << "<VTKFile type=\"PUnstructuredGrid\"";
out << " version =\"0.1\" byte_order=\"" << VTKByteOrder() << "\">\n";
out << "<PUnstructuredGrid GhostLevel=\"0\">\n";
out << "<PPoints>\n";
out << "\t<PDataArray type=\"" << GetDataTypeString() << "\" ";
out << " Name=\"Points\" NumberOfComponents=\"3\""
<< " format=\"" << GetDataFormatString() << "\"/>\n";
out << "</PPoints>\n";
out << "<PCells>\n";
out << "\t<PDataArray type=\"Int32\" ";
out << " Name=\"connectivity\" NumberOfComponents=\"1\""
<< " format=\"" << GetDataFormatString() << "\"/>\n";
out << "\t<PDataArray type=\"Int32\" ";
out << " Name=\"offsets\" NumberOfComponents=\"1\""
<< " format=\"" << GetDataFormatString() << "\"/>\n";
out << "\t<PDataArray type=\"UInt8\" ";
out << " Name=\"types\" NumberOfComponents=\"1\""
<< " format=\"" << GetDataFormatString() << "\"/>\n";
out << "</PCells>\n";
out << "<PPointData>\n";
for (FieldMapIterator it=field_map.begin(); it!=field_map.end(); ++it)
// MPI rank 0 also creates a "PVTU" file that points to all of the separately
// written VTU files.
// This file path is then appended to the PVD file.
if (myid == 0)
{
// Create the main PVTU file
{
int vec_dim=it->second->VectorDim();
out << "<PDataArray type=\"" << GetDataTypeString()
<< "\" Name=\"" << it->first
<< "\" NumberOfComponents=\"" << vec_dim << "\" "
<< "format=\"" << GetDataFormatString() << "\" />\n";
std::ofstream pvtu_out(vtu_prefix + GeneratePVTUFileName("data"));
WritePVTUHeader(pvtu_out);
// Grid function fields
pvtu_out << "<PPointData>\n";
for (auto &field_it : field_map)
{
int vec_dim = field_it.second->VectorDim();
pvtu_out << "<PDataArray type=\"" << GetDataTypeString()
<< "\" Name=\"" << field_it.first
<< "\" NumberOfComponents=\"" << vec_dim << "\" "
<< "format=\"" << GetDataFormatString() << "\" />\n";
}
pvtu_out << "</PPointData>\n";
// Element attributes
pvtu_out << "<PCellData>\n";
pvtu_out << "\t<PDataArray type=\"Int32\" Name=\"" << "attribute"
<< "\" NumberOfComponents=\"1\""
<< " format=\"" << GetDataFormatString() << "\"/>\n";
pvtu_out << "</PCellData>\n";
WritePVTUFooter(pvtu_out, "proc");
}
out << "</PPointData>\n";
// CELL DATA
out << "<PCellData>\n";
out << "\t<PDataArray type=\"Int32\" Name=\"" << "attribute"
<< "\" NumberOfComponents=\"1\""
<< " format=\"" << GetDataFormatString() << "\"/>\n";
out << "</PCellData>\n";
// Add the latest PVTU to the PVD
pvd_stream << "<DataSet timestep=\"" << GetTime()
<< "\" group=\"\" part=\"" << 0 << "\" file=\""
<< GeneratePVTUPath() + "/" + GeneratePVTUFileName("data")
<< "\" name=\"mesh\"/>\n";
for (int ii=0; ii<num_procs; ii++)
// Create PVTU files for each quadrature field and add them to the PVD
// file
for (auto &q_field : q_field_map)
{
// this one is generated without the path
std::string nfname=GenerateVTUFileName(ii);
out << "<Piece Source=\"" << nfname << "\"/>\n";
}
out << "</PUnstructuredGrid>\n";
out << "</VTKFile>\n";
out.close();
const std::string &q_field_name = q_field.first;
std::string q_fname = GeneratePVTUPath() + "/"
+ GeneratePVTUFileName(q_field_name);
fname = GeneratePVTUPath()+"/"+GeneratePVTUFileName();
// add the pvtu file to the pvd_stream
pvd_stream << "<DataSet timestep=\"" << GetTime(); // GetCycle();
pvd_stream << "\" group=\"\" part=\"" << 0 << "\" file=\"";
pvd_stream << fname << "\"/>\n";
std::ofstream pvtu_out(col_path + "/" + q_fname);
WritePVTUHeader(pvtu_out);
int vec_dim = q_field.second->GetVDim();
pvtu_out << "<PPointData>\n";
pvtu_out << "<PDataArray type=\"" << GetDataTypeString()
<< "\" Name=\"" << q_field_name
<< "\" NumberOfComponents=\"" << vec_dim << "\" "
<< "format=\"" << GetDataFormatString() << "\" />\n";
pvtu_out << "</PPointData>\n";
WritePVTUFooter(pvtu_out, q_field_name);
pvd_stream << "<DataSet timestep=\"" << GetTime()
<< "\" group=\"\" part=\"" << 0 << "\" file=\""
<< q_fname << "\" name=\"" << q_field_name << "\"/>\n";
}
pvd_stream.flush();
// Move the insertion point before the closing collection tag, so that
// the PVD file is valid even when writing incrementally.
std::fstream::pos_type pos = pvd_stream.tellp();
pvd_stream << "</Collection>\n";
pvd_stream << "</VTKFile>" << std::endl;
@@ -996,6 +994,44 @@ void ParaViewDataCollection::Save()
}
}
void ParaViewDataCollection::WritePVTUHeader(std::ostream &out)
{
out << "<?xml version=\"1.0\"?>\n";
out << "<VTKFile type=\"PUnstructuredGrid\"";
out << " version =\"0.1\" byte_order=\"" << VTKByteOrder() << "\">\n";
out << "<PUnstructuredGrid GhostLevel=\"0\">\n";
out << "<PPoints>\n";
out << "\t<PDataArray type=\"" << GetDataTypeString() << "\" ";
out << " Name=\"Points\" NumberOfComponents=\"3\""
<< " format=\"" << GetDataFormatString() << "\"/>\n";
out << "</PPoints>\n";
out << "<PCells>\n";
out << "\t<PDataArray type=\"Int32\" ";
out << " Name=\"connectivity\" NumberOfComponents=\"1\""
<< " format=\"" << GetDataFormatString() << "\"/>\n";
out << "\t<PDataArray type=\"Int32\" ";
out << " Name=\"offsets\" NumberOfComponents=\"1\""
<< " format=\"" << GetDataFormatString() << "\"/>\n";
out << "\t<PDataArray type=\"UInt8\" ";
out << " Name=\"types\" NumberOfComponents=\"1\""
<< " format=\"" << GetDataFormatString() << "\"/>\n";
out << "</PCells>\n";
}
void ParaViewDataCollection::WritePVTUFooter(std::ostream &out,
const std::string &vtu_prefix)
{
for (int ii=0; ii<num_procs; ii++)
{
std::string vtu_filename = GenerateVTUFileName(vtu_prefix, ii);
out << "<Piece Source=\"" << vtu_filename << "\"/>\n";
}
out << "</PUnstructuredGrid>\n";
out << "</VTKFile>\n";
}
void ParaViewDataCollection::SaveDataVTU(std::ostream &out, int ref)
{
out << "<VTKFile type=\"UnstructuredGrid\"";
@@ -1015,16 +1051,6 @@ void ParaViewDataCollection::SaveDataVTU(std::ostream &out, int ref)
{
SaveGFieldVTU(out,ref,it);
}
// iterate over all quadrature functions
// if the Quadrature functions are dumped as cell data
// the cycle should be moved before the grid functions
// and the PrintVTU CellData section should be open in the mesh dump
for (QFieldMapIterator it=q_field_map.begin(); it!=q_field_map.end(); ++it)
{
// save the quadrature functions
// this one is not implemented yet
SaveQFieldVTU(out,ref,it);
}
out << "</PointData>\n";
// close the mesh
out << "</Piece>\n"; // close the piece open in the PrintVTU method
@@ -1032,27 +1058,21 @@ void ParaViewDataCollection::SaveDataVTU(std::ostream &out, int ref)
out << "</VTKFile>" << std::endl;
}
void ParaViewDataCollection::SaveQFieldVTU(std::ostream &out, int ref,
const QFieldMapIterator& it )
{
MFEM_WARNING("SaveQFieldVTU is not currently implemented - field name:"<<it->second);
}
void ParaViewDataCollection::SaveGFieldVTU(std::ostream &out, int ref_,
const FieldMapIterator& it)
const FieldMapIterator &it)
{
RefinedGeometry *RefG;
Vector val;
DenseMatrix vval, pmat;
std::vector<char> buf;
int vec_dim = it->second->VectorDim();
out << "<DataArray type=\"" << GetDataTypeString()
<< "\" Name=\"" << it->first;
out << "\" NumberOfComponents=\"" << vec_dim << "\""
<< " format=\"" << GetDataFormatString() << "\" >" << '\n';
if (vec_dim == 1)
{
// scalar data
out << "<DataArray type=\"" << GetDataTypeString()
<< "\" Name=\"" << it->first;
out << "\" NumberOfComponents=\"1\" format=\""
<< GetDataFormatString() << "\" >\n";
for (int i = 0; i < mesh->GetNE(); i++)
{
RefG = GlobGeometryRefiner.Refine(
@@ -1060,51 +1080,23 @@ void ParaViewDataCollection::SaveGFieldVTU(std::ostream &out, int ref_,
it->second->GetValues(i, RefG->RefPts, val, pmat);
for (int j = 0; j < val.Size(); j++)
{
if (pv_data_format == VTKFormat::ASCII)
{
out << ZeroSubnormal(val(j)) << '\n';
}
else if (pv_data_format == VTKFormat::BINARY)
{
bin_io::AppendBytes(buf, val(j));
}
else
{
bin_io::AppendBytes<float>(buf, float(val(j)));
}
WriteBinaryOrASCII(out, buf, val(j), "\n", pv_data_format);
}
}
}
else
{
// vector data
out << "<DataArray type=\"" << GetDataTypeString()
<< "\" Name=\"" << it->first;
out << "\" NumberOfComponents=\"" << vec_dim << "\""
<< " format=\"" << GetDataFormatString() << "\" >" << '\n';
for (int i = 0; i < mesh->GetNE(); i++)
{
RefG = GlobGeometryRefiner.Refine(
mesh->GetElementBaseGeometry(i), ref_, 1);
it->second->GetVectorValues(i, RefG->RefPts, vval, pmat);
for (int jj = 0; jj < vval.Width(); jj++)
{
for (int ii = 0; ii < vval.Height(); ii++)
{
if (pv_data_format == VTKFormat::ASCII)
{
out << ZeroSubnormal(vval(ii,jj)) << ' ';
}
else if (pv_data_format == VTKFormat::BINARY)
{
bin_io::AppendBytes(buf, vval(ii,jj));
}
else
{
bin_io::AppendBytes<float>(buf, float(vval(ii,jj)));
}
WriteBinaryOrASCII(out, buf, vval(ii,jj), " ", pv_data_format);
}
if (pv_data_format == VTKFormat::ASCII) { out << '\n'; }
}
+11 -10
View File
@@ -258,8 +258,8 @@ public:
{ q_field_map.Deregister(field_name, own_data); }
/// Check if a grid function is part of the collection
bool HasField(const std::string& name) const
{ return field_map.Has(name); }
bool HasField(const std::string& field_name) const
{ return field_map.Has(field_name); }
/// Get a pointer to a grid function in the collection.
/** Returns NULL if @a field_name is not in the collection. */
@@ -491,19 +491,20 @@ private:
bool restart_mode;
protected:
void WritePVTUHeader(std::ostream &out);
void WritePVTUFooter(std::ostream &out, const std::string &vtu_prefix);
void SaveDataVTU(std::ostream &out, int ref);
void SaveGFieldVTU(std::ostream& out, int ref_, const FieldMapIterator& it);
void SaveQFieldVTU(std::ostream &out, int ref, const QFieldMapIterator& it);
const char *GetDataFormatString() const;
const char *GetDataTypeString() const;
std::string GenerateCollectionPath();
std::string GenerateVTUFileName();
std::string GenerateVTUFileName(int rank);
std::string GenerateVTUPath();
std::string GeneratePVDFileName();
std::string GeneratePVTUFileName();
std::string GeneratePVTUPath();
std::string GenerateCollectionPath();
std::string GenerateVTUFileName(const std::string &prefix, int rank);
std::string GenerateVTUPath();
std::string GeneratePVDFileName();
std::string GeneratePVTUFileName(const std::string &prefix);
std::string GeneratePVTUPath();
public:
/// Constructor. The collection name is used when saving the data.
+1
View File
@@ -243,6 +243,7 @@ public:
void TransformDual(double *v) const;
void InvTransformDual(double *v) const;
using DofTransformation::InvTransformDual;
};
/// DoF transformation implementation for the Nedelec basis on tetrahedra
+2 -1
View File
@@ -21,7 +21,8 @@ ElementTransformation::ElementTransformation()
EvalState(0),
geom(Geometry::INVALID),
Attribute(-1),
ElementNo(-1)
ElementNo(-1),
mesh(nullptr)
{ }
double ElementTransformation::EvalWeight()
+6
View File
@@ -75,6 +75,12 @@ public:
int Attribute, ElementNo, ElementType;
/// The Mesh object containing the element.
/** If the element transformation belongs to a mesh, this will point to the
containing Mesh object. ElementNo will be the number of the element in
this Mesh. This will be NULL if the element does not belong to a mesh. */
class Mesh *mesh;
ElementTransformation();
/** @brief Force the reevaluation of the Jacobian in the next call. */
+2 -2
View File
@@ -234,7 +234,7 @@ protected:
bool own_flux_fes; ///< Ownership flag for flux_space and smooth_flux_space.
/// Initialize with the integrator, solution, and flux finite element spaces.
void Init(BilinearFormIntegrator &integ,
void Init(BilinearFormIntegrator &integ_,
ParGridFunction &sol,
ParFiniteElementSpace *flux_fes,
ParFiniteElementSpace *smooth_flux_fes)
@@ -242,7 +242,7 @@ protected:
current_sequence = -1;
local_norm_p = 1;
total_error = 0.0;
this->integ = &integ;
integ = &integ_;
solution = &sol;
flux_space = flux_fes;
smooth_flux_space = smooth_flux_fes;
+31 -1
View File
@@ -1538,7 +1538,7 @@ void VectorFiniteElement::LocalRestriction_ND(
Poly_1D::Basis::Basis(const int p, const double *nodes, EvalType etype)
: etype(etype), auxiliary_basis(NULL)
: etype(etype), auxiliary_basis(NULL), scale_integrated(false)
{
switch (etype)
{
@@ -1838,11 +1838,29 @@ void Poly_1D::Basis::EvalIntegrated(const Vector &d_aux, Vector &u) const
MFEM_VERIFY(etype == Integrated,
"EvalIntegrated is only valid for Integrated basis type");
int p = d_aux.Size() - 1;
// See Gerritsma, M. (2010). "Edge functions for spectral element methods",
// in Lecture Notes in Computational Science and Engineering, 199--207.
u[0] = -d_aux[0];
for (int j=1; j<p; ++j)
{
u[j] = u[j-1] - d_aux[j];
}
// If scale_integrated is true, the degrees of freedom represent mean values,
// otherwise they represent subcell integrals. Generally, scale_integrated
// should be true for MapType::VALUE, and false for other map types.
if (scale_integrated)
{
Vector &aux_nodes = auxiliary_basis->x;
for (int j=0; j<aux_nodes.Size()-1; ++j)
{
u[j] *= aux_nodes[j+1] - aux_nodes[j];
}
}
}
void Poly_1D::Basis::ScaleIntegrated(bool scale_integrated_)
{
scale_integrated = scale_integrated_;
}
Poly_1D::Basis::~Basis()
@@ -2379,6 +2397,18 @@ NodalTensorFiniteElement::NodalTensorFiniteElement(const int dims,
lex_ordering = dof_map;
}
void NodalTensorFiniteElement::SetMapType(const int map_type)
{
ScalarFiniteElement::SetMapType(map_type);
// If we are using the "integrated" basis, the basis functions should be
// scaled for MapType::VALUE, and not scaled for MapType::INTEGRAL. This
// ensures spectral equivalence of the mass matrix with its low-order-refined
// counterpart (cf. LORDiscretization)
if (basis1d.IsIntegratedType())
{
basis1d.ScaleIntegrated(map_type == VALUE);
}
}
VectorTensorFiniteElement::VectorTensorFiniteElement(const int dims,
const int d,
+44 -15
View File
@@ -657,7 +657,7 @@ public:
/** @brief Set the FiniteElement::MapType of the element to either VALUE or
INTEGRAL. Also sets the FiniteElement::DerivType to GRAD if the
FiniteElement::MapType is VALUE. */
void SetMapType(int M)
virtual void SetMapType(int M)
{
MFEM_VERIFY(M == VALUE || M == INTEGRAL, "unknown MapType");
map_type = M;
@@ -955,41 +955,68 @@ public:
};
/// Class for computing 1D special polynomials and their associated basis
/// @brief Class for computing 1D special polynomials and their associated basis
/// functions
class Poly_1D
{
public:
/// One-dimensional basis evaluation type
enum EvalType
{
ChangeOfBasis = 0, // Use change of basis, O(p^2) Evals
Barycentric = 1, // Use barycentric Lagrangian interpolation, O(p) Evals
Positive = 2, // Fast evaluation of Bernstein polynomials
Integrated = 3, // Integrated indicator functions (cf. Gerritsma)
NumEvalTypes = 4 // Keep count of the number of eval types
ChangeOfBasis = 0, ///< Use change of basis, O(p^2) Evals
Barycentric = 1, ///< Use barycentric Lagrangian interpolation, O(p) Evals
Positive = 2, ///< Fast evaluation of Bernstein polynomials
Integrated = 3, ///< Integrated indicator functions (cf. Gerritsma)
NumEvalTypes = 4 ///< Keep count of the number of eval types
};
/// @brief Class for evaluating 1D nodal, positive (Bernstein), or integrated
/// (Gerritsma) bases.
class Basis
{
private:
int etype;
EvalType etype; ///< Determines how the basis functions should be evaluated.
DenseMatrixInverse Ai;
mutable Vector x, w;
// The following data members are used for "integrated basis type", which
// is defined in terms of nodal basis of one degree higher.
/// The following data members are used for "integrated basis type", which
/// is defined in terms of nodal basis of one degree higher.
///@{
mutable Vector u_aux, d_aux, d2_aux;
Basis *auxiliary_basis; // Non-NULL only for etype == Integrated
///@}
/// @brief An auxiliary nodal basis used to evaluate the integrated basis.
/// This member variable is NULL whenever etype != Integrated.
Basis *auxiliary_basis;
/// Should the integrated basis functions be scaled? See ScaleIntegrated.
bool scale_integrated;
public:
/// Create a nodal or positive (Bernstein) basis
/// Create a nodal or positive (Bernstein) basis of degree @a p
Basis(const int p, const double *nodes, EvalType etype = Barycentric);
/// Evaluate the basis functions at point @a x in [0,1]
void Eval(const double x, Vector &u) const;
/// @brief Evaluate the basis functions and their derivatives at point @a
/// x in [0,1]
void Eval(const double x, Vector &u, Vector &d) const;
/// @brief Evaluate the basis functions and their first two derivatives at
/// point @a x in [0,1]
void Eval(const double x, Vector &u, Vector &d, Vector &d2) const;
/// Evaluate the "integrated" basis, which is given by the negative
/// partial sum of the corresponding closed basis derivatives. The closed
/// basis derivatives are given by @a d, and the result is stored in @a i.
/// @brief Evaluate the "integrated" basis type using pre-computed closed
/// basis derivatives.
///
/// This basis is given by the negative partial sum of the corresponding
/// closed basis derivatives. The closed basis derivatives are given by @a
/// d, and the result is stored in @a i.
void EvalIntegrated(const Vector &d, Vector &i) const;
/// @brief Set whether the "integrated" basis should be scaled by the
/// subcell sizes. Has no effect for non-integrated bases.
///
/// Generally, this should be true for mfem::FiniteElement::MapType VALUE
/// and false for all other map types. If this option is enabled, the
/// basis functions will be scaled by the widths of the subintervals, so
/// that the basis functions represent mean values. Otherwise, the basis
/// functions represent integrated values.
void ScaleIntegrated(bool scale_integrated_);
/// Returns true if the basis is "integrated", false otherwise.
bool IsIntegratedType() const { return etype == Integrated; }
~Basis();
};
@@ -1193,6 +1220,8 @@ public:
ScalarFiniteElement::GetTensorDofToQuad(*this, ir, mode);
}
virtual void SetMapType(const int map_type_);
virtual void GetTransferMatrix(const FiniteElement &fe,
ElementTransformation &Trans,
DenseMatrix &I) const
+27 -26
View File
@@ -1897,21 +1897,21 @@ const int *H1_FECollection::DofOrderForOrientation(Geometry::Type GeomType,
FiniteElementCollection *H1_FECollection::GetTraceCollection() const
{
int p = H1_dof[Geometry::SEGMENT] + 1;
int dim = -1;
int tr_p = H1_dof[Geometry::SEGMENT] + 1;
int tr_dim = -1;
if (!strncmp(h1_name, "H1_", 3))
{
dim = atoi(h1_name + 3);
tr_dim = atoi(h1_name + 3);
}
else if (!strncmp(h1_name, "H1Pos_", 6))
{
dim = atoi(h1_name + 6);
tr_dim = atoi(h1_name + 6);
}
else if (!strncmp(h1_name, "H1@", 3))
{
dim = atoi(h1_name + 5);
tr_dim = atoi(h1_name + 5);
}
return (dim < 0) ? NULL : new H1_Trace_FECollection(p, dim, b_type);
return (dim < 0) ? NULL : new H1_Trace_FECollection(tr_p, tr_dim, b_type);
}
const int *H1_FECollection::GetDofMap(Geometry::Type GeomType) const
@@ -2374,7 +2374,7 @@ RT_FECollection::RT_FECollection(const int p, const int dim,
InitFaces(p, dim, map_type, signs);
}
void RT_FECollection::InitFaces(const int p, const int dim,
void RT_FECollection::InitFaces(const int p, const int dim_,
const int map_type,
const bool signs)
{
@@ -2404,7 +2404,7 @@ void RT_FECollection::InitFaces(const int p, const int dim,
QuadDofOrd[i] = NULL;
}
if (dim == 2)
if (dim_ == 2)
{
L2_SegmentElement *l2_seg = new L2_SegmentElement(p, ob_type);
l2_seg->SetMapType(map_type);
@@ -2419,7 +2419,7 @@ void RT_FECollection::InitFaces(const int p, const int dim,
SegDofOrd[1][i] = signs ? (-1 - (p - i)) : (p - i);
}
}
else if (dim == 3)
else if (dim_ == 3)
{
L2_TriangleElement *l2_tri = new L2_TriangleElement(p, ob_type);
l2_tri->SetMapType(map_type);
@@ -2453,9 +2453,9 @@ void RT_FECollection::InitFaces(const int p, const int dim,
TriDofOrd[5][o] = -1-(TriDof-((pp2-i)*(pp1-i))/2+j); // (0,2,1)
if (!signs)
{
for (int k = 1; k < 6; k += 2)
for (int kk = 1; kk < 6; kk += 2)
{
TriDofOrd[k][o] = -1 - TriDofOrd[k][o];
TriDofOrd[kk][o] = -1 - TriDofOrd[kk][o];
}
}
}
@@ -2529,18 +2529,19 @@ const int *RT_FECollection::DofOrderForOrientation(Geometry::Type GeomType,
FiniteElementCollection *RT_FECollection::GetTraceCollection() const
{
int dim, p;
int tr_dim, tr_p;
if (!strncmp(rt_name, "RT_", 3))
{
dim = atoi(rt_name + 3);
p = atoi(rt_name + 7);
tr_dim = atoi(rt_name + 3);
tr_p = atoi(rt_name + 7);
}
else // rt_name = RT@.._.D_P*
{
dim = atoi(rt_name + 6);
p = atoi(rt_name + 10);
tr_dim = atoi(rt_name + 6);
tr_p = atoi(rt_name + 10);
}
return new RT_Trace_FECollection(p, dim, FiniteElement::INTEGRAL, ob_type);
return new RT_Trace_FECollection(tr_p, tr_dim, FiniteElement::INTEGRAL,
ob_type);
}
RT_FECollection::~RT_FECollection()
@@ -2814,22 +2815,22 @@ const int *ND_FECollection::DofOrderForOrientation(Geometry::Type GeomType,
FiniteElementCollection *ND_FECollection::GetTraceCollection() const
{
int p, dim, cb_type, ob_type;
int tr_p, tr_dim, tr_cb_type, tr_ob_type;
p = ND_dof[Geometry::SEGMENT];
tr_p = ND_dof[Geometry::SEGMENT];
if (nd_name[2] == '_') // ND_
{
dim = atoi(nd_name + 3);
cb_type = BasisType::GaussLobatto;
ob_type = BasisType::GaussLegendre;
tr_dim = atoi(nd_name + 3);
tr_cb_type = BasisType::GaussLobatto;
tr_ob_type = BasisType::GaussLegendre;
}
else // ND@
{
dim = atoi(nd_name + 6);
cb_type = BasisType::GetType(nd_name[3]);
ob_type = BasisType::GetType(nd_name[4]);
tr_dim = atoi(nd_name + 6);
tr_cb_type = BasisType::GetType(nd_name[3]);
tr_ob_type = BasisType::GetType(nd_name[4]);
}
return new ND_Trace_FECollection(p, dim, cb_type, ob_type);
return new ND_Trace_FECollection(tr_p, tr_dim, tr_cb_type, tr_ob_type);
}
ND_FECollection::~ND_FECollection()
+1 -1
View File
@@ -1117,7 +1117,7 @@ public:
{ return (GeomType == GeomType_) ? Local_Element : NULL; }
virtual int DofForGeometry(Geometry::Type GeomType_) const
{ return (GeomType == GeomType_) ? Local_Element->GetDof() : 0; }
virtual const int *DofOrderForOrientation(Geometry::Type GeomType,
virtual const int *DofOrderForOrientation(Geometry::Type GeomType_,
int Or) const
{ return NULL; }
virtual const char *Name() const { return d_name; }
+100 -81
View File
@@ -70,14 +70,14 @@ FiniteElementSpace::FiniteElementSpace()
{ }
FiniteElementSpace::FiniteElementSpace(const FiniteElementSpace &orig,
Mesh *mesh,
const FiniteElementCollection *fec)
Mesh *mesh_,
const FiniteElementCollection *fec_)
: VDoFTrans(orig.vdim, orig.ordering)
{
mesh = mesh ? mesh : orig.mesh;
fec = fec ? fec : orig.fec;
mesh_ = mesh_ ? mesh_ : orig.mesh;
fec_ = fec_ ? fec_ : orig.fec;
NURBSExtension *NURBSext = NULL;
NURBSExtension *nurbs_ext = NULL;
if (orig.NURBSext && orig.NURBSext != orig.mesh->NURBSext)
{
#ifdef MFEM_USE_MPI
@@ -85,16 +85,16 @@ FiniteElementSpace::FiniteElementSpace(const FiniteElementSpace &orig,
dynamic_cast<ParNURBSExtension *>(orig.NURBSext);
if (pNURBSext)
{
NURBSext = new ParNURBSExtension(*pNURBSext);
nurbs_ext = new ParNURBSExtension(*pNURBSext);
}
else
#endif
{
NURBSext = new NURBSExtension(*orig.NURBSext);
nurbs_ext = new NURBSExtension(*orig.NURBSext);
}
}
Constructor(mesh, NURBSext, fec, orig.vdim, orig.ordering);
Constructor(mesh_, nurbs_ext, fec_, orig.vdim, orig.ordering);
}
void FiniteElementSpace::CopyProlongationAndRestriction(
@@ -192,74 +192,74 @@ int FiniteElementSpace::GetElementOrderImpl(int i) const
return elem_order.Size() ? elem_order[i] : fec->GetOrder();
}
void FiniteElementSpace::GetVDofs(int vd, Array<int>& dofs, int ndofs) const
void FiniteElementSpace::GetVDofs(int vd, Array<int>& dofs, int ndofs_) const
{
if (ndofs < 0) { ndofs = this->ndofs; }
if (ndofs_ < 0) { ndofs_ = this->ndofs; }
if (ordering == Ordering::byNODES)
{
for (int i = 0; i < dofs.Size(); i++)
{
dofs[i] = Ordering::Map<Ordering::byNODES>(ndofs, vdim, i, vd);
dofs[i] = Ordering::Map<Ordering::byNODES>(ndofs_, vdim, i, vd);
}
}
else
{
for (int i = 0; i < dofs.Size(); i++)
{
dofs[i] = Ordering::Map<Ordering::byVDIM>(ndofs, vdim, i, vd);
dofs[i] = Ordering::Map<Ordering::byVDIM>(ndofs_, vdim, i, vd);
}
}
}
void FiniteElementSpace::DofsToVDofs (Array<int> &dofs, int ndofs) const
void FiniteElementSpace::DofsToVDofs (Array<int> &dofs, int ndofs_) const
{
if (vdim == 1) { return; }
if (ndofs < 0) { ndofs = this->ndofs; }
if (ndofs_ < 0) { ndofs_ = this->ndofs; }
if (ordering == Ordering::byNODES)
{
Ordering::DofsToVDofs<Ordering::byNODES>(ndofs, vdim, dofs);
Ordering::DofsToVDofs<Ordering::byNODES>(ndofs_, vdim, dofs);
}
else
{
Ordering::DofsToVDofs<Ordering::byVDIM>(ndofs, vdim, dofs);
Ordering::DofsToVDofs<Ordering::byVDIM>(ndofs_, vdim, dofs);
}
}
void FiniteElementSpace::DofsToVDofs(int vd, Array<int> &dofs, int ndofs) const
void FiniteElementSpace::DofsToVDofs(int vd, Array<int> &dofs, int ndofs_) const
{
if (vdim == 1) { return; }
if (ndofs < 0) { ndofs = this->ndofs; }
if (ndofs_ < 0) { ndofs_ = this->ndofs; }
if (ordering == Ordering::byNODES)
{
for (int i = 0; i < dofs.Size(); i++)
{
dofs[i] = Ordering::Map<Ordering::byNODES>(ndofs, vdim, dofs[i], vd);
dofs[i] = Ordering::Map<Ordering::byNODES>(ndofs_, vdim, dofs[i], vd);
}
}
else
{
for (int i = 0; i < dofs.Size(); i++)
{
dofs[i] = Ordering::Map<Ordering::byVDIM>(ndofs, vdim, dofs[i], vd);
dofs[i] = Ordering::Map<Ordering::byVDIM>(ndofs_, vdim, dofs[i], vd);
}
}
}
int FiniteElementSpace::DofToVDof(int dof, int vd, int ndofs) const
int FiniteElementSpace::DofToVDof(int dof, int vd, int ndofs_) const
{
if (vdim == 1) { return dof; }
if (ndofs < 0) { ndofs = this->ndofs; }
if (ndofs_ < 0) { ndofs_ = this->ndofs; }
if (ordering == Ordering::byNODES)
{
return Ordering::Map<Ordering::byNODES>(ndofs, vdim, dof, vd);
return Ordering::Map<Ordering::byNODES>(ndofs_, vdim, dof, vd);
}
else
{
return Ordering::Map<Ordering::byVDIM>(ndofs, vdim, dof, vd);
return Ordering::Map<Ordering::byVDIM>(ndofs_, vdim, dof, vd);
}
}
@@ -713,8 +713,8 @@ FiniteElementSpace::H2L_GlobalRestrictionMatrix (FiniteElementSpace *lfes)
DenseMatrix loc_restr;
Array<int> l_dofs, h_dofs, l_vdofs, h_vdofs;
int vdim = lfes->GetVDim();
R = new SparseMatrix (vdim * lfes -> GetNDofs(), vdim * ndofs);
int lvdim = lfes->GetVDim();
R = new SparseMatrix (lvdim * lfes -> GetNDofs(), lvdim * ndofs);
Geometry::Type cached_geom = Geometry::INVALID;
const FiniteElement *h_fe = NULL;
@@ -737,7 +737,7 @@ FiniteElementSpace::H2L_GlobalRestrictionMatrix (FiniteElementSpace *lfes)
cached_geom = geom;
}
for (int vd = 0; vd < vdim; vd++)
for (int vd = 0; vd < lvdim; vd++)
{
l_dofs.Copy(l_vdofs);
lfes->DofsToVDofs(vd, l_vdofs);
@@ -894,9 +894,10 @@ int FiniteElementSpace::GetDegenerateFaceDofs(int index, Array<int> &dofs,
int FiniteElementSpace::GetNumBorderDofs(Geometry::Type geom, int order) const
{
// return the number of vertex and edge DOFs that precede inner DOFs
int nv = fec->GetNumDof(Geometry::POINT, order);
int ne = fec->GetNumDof(Geometry::SEGMENT, order);
return Geometry::NumVerts[geom] * (nv + ne);
const int nv = fec->GetNumDof(Geometry::POINT, order);
const int ne = fec->GetNumDof(Geometry::SEGMENT, order);
return Geometry::NumVerts[geom] * (geom == Geometry::SEGMENT ? nv : (nv + ne));
}
int FiniteElementSpace::GetEntityDofs(int entity, int index, Array<int> &dofs,
@@ -934,6 +935,12 @@ void FiniteElementSpace::BuildConformingInterpolation() const
if (cP_is_set) { return; }
cP_is_set = true;
if (FEColl()->GetContType() == FiniteElementCollection::DISCONTINUOUS)
{
cP = cR = cR_hp = NULL; // will be treated as identities
return;
}
Array<int> master_dofs, slave_dofs, highest_dofs;
IsoparametricTransformation T;
@@ -1054,6 +1061,7 @@ void FiniteElementSpace::BuildConformingInterpolation() const
// get lowest order variant DOFs and FE
int p = GetEntityDofs(entity, i, master_dofs, geom, 0);
const auto *master_fe = fec->GetFE(geom, p);
if (!master_fe) { break; }
// constrain all higher order DOFs: interpolate lowest order function
for (int variant = 1; ; variant++)
@@ -1192,7 +1200,7 @@ void FiniteElementSpace::BuildConformingInterpolation() const
if (cR_hp) { MakeVDimMatrix(*cR_hp); }
}
if (Device::IsEnabled()) { cP->BuildTranspose(); }
cP->EnsureMultTranspose();
}
void FiniteElementSpace::MakeVDimMatrix(SparseMatrix &mat) const
@@ -1300,7 +1308,14 @@ const FaceRestriction *FiniteElementSpace::GetFaceRestriction(
FaceRestriction *res;
if (is_dg_space)
{
res = new L2FaceRestriction(*this, e_ordering, type, m);
if (Conforming())
{
res = new L2FaceRestriction(*this, e_ordering, type, m);
}
else
{
res = new NCL2FaceRestriction(*this, e_ordering, type, m);
}
}
else
{
@@ -1540,11 +1555,11 @@ void FiniteElementSpace::RefinementOperator
old_DoFTrans[i] = NULL;
}
const FiniteElementCollection *fec = fespace->FEColl();
if (dynamic_cast<const ND_FECollection*>(fec))
const FiniteElementCollection *fec_ref = fespace->FEColl();
if (dynamic_cast<const ND_FECollection*>(fec_ref))
{
const FiniteElement * nd_tri =
fec->FiniteElementForGeometry(Geometry::TRIANGLE);
fec_ref->FiniteElementForGeometry(Geometry::TRIANGLE);
if (nd_tri)
{
old_DoFTrans[Geometry::TRIANGLE] =
@@ -1552,7 +1567,7 @@ void FiniteElementSpace::RefinementOperator
}
const FiniteElement * nd_tet =
fec->FiniteElementForGeometry(Geometry::TETRAHEDRON);
fec_ref->FiniteElementForGeometry(Geometry::TETRAHEDRON);
if (nd_tet)
{
old_DoFTrans[Geometry::TETRAHEDRON] =
@@ -1564,20 +1579,21 @@ void FiniteElementSpace::RefinementOperator
void FiniteElementSpace::RefinementOperator
::Mult(const Vector &x, Vector &y) const
{
Mesh* mesh = fespace->GetMesh();
const CoarseFineTransformations &rtrans = mesh->GetRefinementTransforms();
Mesh* mesh_ref = fespace->GetMesh();
const CoarseFineTransformations &trans_ref =
mesh_ref->GetRefinementTransforms();
Array<int> dofs, vdofs, old_dofs, old_vdofs, old_Fo;
int vdim = fespace->GetVDim();
int old_ndofs = width / vdim;
int rvdim = fespace->GetVDim();
int old_ndofs = width / rvdim;
Vector subY, subX;
for (int k = 0; k < mesh->GetNE(); k++)
for (int k = 0; k < mesh_ref->GetNE(); k++)
{
const Embedding &emb = rtrans.embeddings[k];
const Geometry::Type geom = mesh->GetElementBaseGeometry(k);
const Embedding &emb = trans_ref.embeddings[k];
const Geometry::Type geom = mesh_ref->GetElementBaseGeometry(k);
const DenseMatrix &lP = localP[geom](emb.matrix);
subY.SetSize(lP.Height());
@@ -1587,7 +1603,7 @@ void FiniteElementSpace::RefinementOperator
if (!doftrans)
{
for (int vd = 0; vd < vdim; vd++)
for (int vd = 0; vd < rvdim; vd++)
{
dofs.Copy(vdofs);
fespace->DofsToVDofs(vd, vdofs);
@@ -1612,7 +1628,7 @@ void FiniteElementSpace::RefinementOperator
doftrans = vdoftrans->GetDofTransformation();
}
for (int vd = 0; vd < vdim; vd++)
for (int vd = 0; vd < rvdim; vd++)
{
dofs.Copy(vdofs);
fespace->DofsToVDofs(vd, vdofs);
@@ -1638,23 +1654,24 @@ void FiniteElementSpace::RefinementOperator
{
y = 0.0;
Mesh* mesh = fespace->GetMesh();
const CoarseFineTransformations &rtrans = mesh->GetRefinementTransforms();
Mesh* mesh_ref = fespace->GetMesh();
const CoarseFineTransformations &trans_ref =
mesh_ref->GetRefinementTransforms();
Array<char> processed(fespace->GetVSize());
processed = 0;
Array<int> f_dofs, c_dofs, f_vdofs, c_vdofs, old_Fo;
int vdim = fespace->GetVDim();
int old_ndofs = width / vdim;
int rvdim = fespace->GetVDim();
int old_ndofs = width / rvdim;
Vector subY, subX, subYt, subXt;
Vector subY, subX, subYt;
for (int k = 0; k < mesh->GetNE(); k++)
for (int k = 0; k < mesh_ref->GetNE(); k++)
{
const Embedding &emb = rtrans.embeddings[k];
const Geometry::Type geom = mesh->GetElementBaseGeometry(k);
const Embedding &emb = trans_ref.embeddings[k];
const Geometry::Type geom = mesh_ref->GetElementBaseGeometry(k);
const DenseMatrix &lP = localP[geom](emb.matrix);
DofTransformation * doftrans = fespace->GetElementDofs(k, f_dofs);
@@ -1664,7 +1681,7 @@ void FiniteElementSpace::RefinementOperator
{
subY.SetSize(lP.Width());
for (int vd = 0; vd < vdim; vd++)
for (int vd = 0; vd < rvdim; vd++)
{
f_dofs.Copy(f_vdofs);
fespace->DofsToVDofs(vd, f_vdofs);
@@ -1701,7 +1718,7 @@ void FiniteElementSpace::RefinementOperator
doftrans = vdoftrans->GetDofTransformation();
}
for (int vd = 0; vd < vdim; vd++)
for (int vd = 0; vd < rvdim; vd++)
{
f_dofs.Copy(f_vdofs);
fespace->DofsToVDofs(vd, f_vdofs);
@@ -1960,15 +1977,16 @@ void FiniteElementSpace::DerefinementOperator
Array<int> c_vdofs, f_vdofs;
Vector loc_x, loc_y;
DenseMatrix loc_x_mat, loc_y_mat;
const int vdim = fine_fes->GetVDim();
const int coarse_ndofs = height/vdim;
const int fine_vdim = fine_fes->GetVDim();
const int coarse_ndofs = height/fine_vdim;
for (int coarse_el = 0; coarse_el < coarse_to_fine.Size(); coarse_el++)
{
coarse_elem_dof->GetRow(coarse_el, c_vdofs);
fine_fes->DofsToVDofs(c_vdofs, coarse_ndofs);
loc_y.SetSize(c_vdofs.Size());
loc_y = 0.0;
loc_y_mat.UseExternalData(loc_y.GetData(), c_vdofs.Size()/vdim, vdim);
loc_y_mat.UseExternalData(loc_y.GetData(), c_vdofs.Size()/fine_vdim,
fine_vdim);
const int ref_type = coarse_to_ref_type[coarse_el];
const Geometry::Type geom = ref_type_to_geom[ref_type];
const int *fine_elems = coarse_to_fine.GetRow(coarse_el);
@@ -1979,7 +1997,8 @@ void FiniteElementSpace::DerefinementOperator
const DenseMatrix &lR = localR[geom](lR_offset+s);
fine_fes->GetElementVDofs(fine_elems[s], f_vdofs);
x.GetSubVector(f_vdofs, loc_x);
loc_x_mat.UseExternalData(loc_x.GetData(), f_vdofs.Size()/vdim, vdim);
loc_x_mat.UseExternalData(loc_x.GetData(), f_vdofs.Size()/fine_vdim,
fine_vdim);
AddMult(lR, loc_x_mat, loc_y_mat);
}
y.SetSubVector(c_vdofs, loc_y);
@@ -2111,14 +2130,14 @@ void FiniteElementSpace::GetLocalRefinementMatrices(
}
}
void FiniteElementSpace::Constructor(Mesh *mesh, NURBSExtension *NURBSext,
const FiniteElementCollection *fec,
int vdim, int ordering)
void FiniteElementSpace::Constructor(Mesh *mesh_, NURBSExtension *NURBSext_,
const FiniteElementCollection *fec_,
int vdim_, int ordering_)
{
this->mesh = mesh;
this->fec = fec;
this->vdim = vdim;
this->ordering = (Ordering::Type) ordering;
mesh = mesh_;
fec = fec_;
vdim = vdim_;
ordering = (Ordering::Type) ordering_;
elem_dof = NULL;
elem_fos = NULL;
@@ -2131,19 +2150,19 @@ void FiniteElementSpace::Constructor(Mesh *mesh, NURBSExtension *NURBSext,
Th.SetType(Operator::ANY_TYPE);
const NURBSFECollection *nurbs_fec =
dynamic_cast<const NURBSFECollection *>(fec);
dynamic_cast<const NURBSFECollection *>(fec_);
if (nurbs_fec)
{
MFEM_VERIFY(mesh->NURBSext, "NURBS FE space requires a NURBS mesh.");
MFEM_VERIFY(mesh_->NURBSext, "NURBS FE space requires a NURBS mesh.");
if (NURBSext == NULL)
if (NURBSext_ == NULL)
{
this->NURBSext = mesh->NURBSext;
NURBSext = mesh_->NURBSext;
own_ext = 0;
}
else
{
this->NURBSext = NURBSext;
NURBSext = NURBSext_;
own_ext = 1;
}
UpdateNURBS();
@@ -2154,7 +2173,7 @@ void FiniteElementSpace::Constructor(Mesh *mesh, NURBSExtension *NURBSext,
}
else
{
this->NURBSext = NULL;
NURBSext = NULL;
own_ext = 0;
Construct();
}
@@ -3502,7 +3521,7 @@ FiniteElementCollection *FiniteElementSpace::Load(Mesh *m, std::istream &input)
input >> ord;
NURBSFECollection *nurbs_fec = dynamic_cast<NURBSFECollection*>(r_fec);
NURBSExtension *NURBSext = NULL;
NURBSExtension *nurbs_ext = NULL;
if (fes_format == 90) // original format, v0.9
{
if (nurbs_fec)
@@ -3512,7 +3531,7 @@ FiniteElementCollection *FiniteElementSpace::Load(Mesh *m, std::istream &input)
if (order != m->NURBSext->GetOrder() &&
order != NURBSFECollection::VariableOrder)
{
NURBSext = new NURBSExtension(m->NURBSext, order);
nurbs_ext = new NURBSExtension(m->NURBSext, order);
}
}
}
@@ -3529,18 +3548,18 @@ FiniteElementCollection *FiniteElementSpace::Load(Mesh *m, std::istream &input)
MFEM_VERIFY(nurbs_fec,
buff << ": NURBS FE collection is required!");
MFEM_VERIFY(m->NURBSext, buff << ": NURBS mesh is required!");
MFEM_VERIFY(!NURBSext, buff << ": order redefinition!");
MFEM_VERIFY(!nurbs_ext, buff << ": order redefinition!");
if (buff == "NURBS_order")
{
int order;
input >> order;
NURBSext = new NURBSExtension(m->NURBSext, order);
nurbs_ext = new NURBSExtension(m->NURBSext, order);
}
else
{
Array<int> orders;
orders.Load(m->NURBSext->GetNKV(), input);
NURBSext = new NURBSExtension(m->NURBSext, orders);
nurbs_ext = new NURBSExtension(m->NURBSext, orders);
}
}
else if (buff == "NURBS_periodic")
@@ -3548,13 +3567,13 @@ FiniteElementCollection *FiniteElementSpace::Load(Mesh *m, std::istream &input)
Array<int> master, slave;
master.Load(input);
slave.Load(input);
NURBSext->ConnectBoundaries(master,slave);
nurbs_ext->ConnectBoundaries(master,slave);
}
else if (buff == "NURBS_weights")
{
MFEM_VERIFY(NURBSext, "NURBS_weights: NURBS_orders have to be "
MFEM_VERIFY(nurbs_ext, "NURBS_weights: NURBS_orders have to be "
"specified before NURBS_weights!");
NURBSext->GetWeights().Load(input, NURBSext->GetNDof());
nurbs_ext->GetWeights().Load(input, nurbs_ext->GetNDof());
}
else if (buff == "element_orders")
{
@@ -3573,7 +3592,7 @@ FiniteElementCollection *FiniteElementSpace::Load(Mesh *m, std::istream &input)
}
}
Constructor(m, NURBSext, r_fec, vdim, ord);
Constructor(m, nurbs_ext, r_fec, vdim, ord);
return r_fec;
}
+1 -2
View File
@@ -112,7 +112,7 @@ FmsFieldToGridFunction(FmsMesh fms_mesh, FmsField f, Mesh *mesh,
// NOTE: transplanted from the FmsMeshToMesh function
// We should do this work once and save it.
//--------------------------------------------------
FmsInt dim, n_vert, n_elem, space_dim;
FmsInt dim, n_elem, space_dim;
// Find the first component that has coordinates - that will be the new mfem
// mesh.
@@ -144,7 +144,6 @@ FmsFieldToGridFunction(FmsMesh fms_mesh, FmsField f, Mesh *mesh,
n_ents[et] += num_ents;
}
}
n_vert = n_ents[FMS_VERTEX];
//--------------------------------------------------
// Interrogate the field.
+3 -3
View File
@@ -1337,9 +1337,9 @@ RefinedGeometry * GeometryRefiner::Refine(Geometry::Type Geom,
// (ii,jj,kk) are coordinates in the reference tetrahedron,
// transform to coordinates (i,j,k) in the auxiliary
// tetrahedron defined by (0,0,0), (0,0,1), (1,1,1), (0,1,1)
int i = jj;
int j = jj+kk;
int k = ii+jj+kk;
i = jj;
j = jj+kk;
k = ii+jj+kk;
l = i + (j + k * (n+1)) * (n+1);
// map from linear Cartesian hex index in the auxiliary tet
// to lexicographic in the reference tet
+128 -4
View File
@@ -323,10 +323,11 @@ int GridFunction::VectorDim() const
const FiniteElement *fe;
if (!fes->GetNE())
{
const FiniteElementCollection *fec = fes->FEColl();
const FiniteElementCollection *fe_coll = fes->FEColl();
static const Geometry::Type geoms[3] =
{ Geometry::SEGMENT, Geometry::TRIANGLE, Geometry::TETRAHEDRON };
fe = fec->FiniteElementForGeometry(geoms[fes->GetMesh()->Dimension()-1]);
fe = fe_coll->
FiniteElementForGeometry(geoms[fes->GetMesh()->Dimension()-1]);
}
else
{
@@ -605,11 +606,11 @@ const
ET->SetIntPoint(&ip);
FElem->CalcPhysHessian(*ET, DofHes);
for (int i = 0; i < size; i++)
for (int j = 0; j < size; j++)
{
for (int d = 0; d < dof; d++)
{
hess(k,i) += DofHes(d,i) * loc_data[d];
hess(k,j) += DofHes(d,j) * loc_data[d];
}
}
}
@@ -3948,6 +3949,129 @@ std::ostream &operator<<(std::ostream &out, const QuadratureFunction &qf)
return out;
}
void QuadratureFunction::SaveVTU(std::ostream &out, VTKFormat format,
int compression_level) const
{
out << R"(<VTKFile type="UnstructuredGrid" version="0.1")";
if (compression_level != 0)
{
out << R"( compressor="vtkZLibDataCompressor")";
}
out << " byte_order=\"" << VTKByteOrder() << "\">\n";
out << "<UnstructuredGrid>\n";
const char *fmt_str = (format == VTKFormat::ASCII) ? "ascii" : "binary";
const char *type_str = (format != VTKFormat::BINARY32) ? "Float64" : "Float32";
std::vector<char> buf;
int np = qspace->GetSize();
int ne = qspace->GetNE();
int sdim = qspace->GetMesh()->SpaceDimension();
// For quadrature functions, each point is a vertex cell, so number of cells
// is equal to number of points
out << "<Piece NumberOfPoints=\"" << np
<< "\" NumberOfCells=\"" << np << "\">\n";
// print out the points
out << "<Points>\n";
out << "<DataArray type=\"" << type_str
<< "\" NumberOfComponents=\"3\" format=\"" << fmt_str << "\">\n";
Vector pt(sdim);
for (int i = 0; i < ne; i++)
{
ElementTransformation &T = *qspace->GetMesh()->GetElementTransformation(i);
const IntegrationRule &ir = GetElementIntRule(i);
for (int j = 0; j < ir.Size(); j++)
{
T.Transform(ir[j], pt);
WriteBinaryOrASCII(out, buf, pt[0], " ", format);
if (sdim > 1) { WriteBinaryOrASCII(out, buf, pt[1], " ", format); }
else { WriteBinaryOrASCII(out, buf, 0.0, " ", format); }
if (sdim > 2) { WriteBinaryOrASCII(out, buf, pt[2], "", format); }
else { WriteBinaryOrASCII(out, buf, 0.0, "", format); }
if (format == VTKFormat::ASCII) { out << '\n'; }
}
}
if (format != VTKFormat::ASCII)
{
WriteBase64WithSizeAndClear(out, buf, compression_level);
}
out << "</DataArray>\n";
out << "</Points>\n";
// Write cells (each cell is just a vertex)
out << "<Cells>\n";
// Connectivity
out << R"(<DataArray type="Int32" Name="connectivity" format=")"
<< fmt_str << "\">\n";
for (int i=0; i<np; ++i) { WriteBinaryOrASCII(out, buf, i, "\n", format); }
if (format != VTKFormat::ASCII)
{
WriteBase64WithSizeAndClear(out, buf, compression_level);
}
out << "</DataArray>\n";
// Offsets
out << R"(<DataArray type="Int32" Name="offsets" format=")"
<< fmt_str << "\">\n";
for (int i=0; i<np; ++i) { WriteBinaryOrASCII(out, buf, i, "\n", format); }
if (format != VTKFormat::ASCII)
{
WriteBase64WithSizeAndClear(out, buf, compression_level);
}
out << "</DataArray>\n";
// Types
out << R"(<DataArray type="UInt8" Name="types" format=")"
<< fmt_str << "\">\n";
for (int i = 0; i < np; i++)
{
uint8_t vtk_cell_type = VTKGeometry::POINT;
WriteBinaryOrASCII(out, buf, vtk_cell_type, "\n", format);
}
if (format != VTKFormat::ASCII)
{
WriteBase64WithSizeAndClear(out, buf, compression_level);
}
out << "</DataArray>\n";
out << "</Cells>\n";
out << "<PointData>\n";
out << "<DataArray type=\"" << type_str << "\" Name=\"u\" format=\""
<< fmt_str << "\" NumberOfComponents=\"" << vdim << "\">\n";
for (int i = 0; i < ne; i++)
{
DenseMatrix vals;
GetElementValues(i, vals);
for (int j = 0; j < vals.Size(); ++j)
{
for (int vd = 0; vd < vdim; ++vd)
{
WriteBinaryOrASCII(out, buf, vals(vd, j), " ", format);
}
if (format == VTKFormat::ASCII) { out << '\n'; }
}
}
if (format != VTKFormat::ASCII)
{
WriteBase64WithSizeAndClear(out, buf, compression_level);
}
out << "</DataArray>\n";
out << "</PointData>\n";
out << "</Piece>\n";
out << "</UnstructuredGrid>\n";
out << "</VTKFile>" << std::endl;
}
void QuadratureFunction::SaveVTU(const std::string &filename, VTKFormat format,
int compression_level) const
{
std::ofstream f(filename + ".vtu");
SaveVTU(f, format, compression_level);
}
double ZZErrorEstimator(BilinearFormIntegrator &blfi,
GridFunction &u,
+16
View File
@@ -902,6 +902,22 @@ public:
/// Write the QuadratureFunction to the stream @a out.
void Save(std::ostream &out) const;
/// @brief Write the QuadratureFunction to @a out in VTU (ParaView) format.
///
/// The data will be uncompressed if @a compression_level is zero, or if the
/// format is VTKFormat::ASCII. Otherwise, zlib compression will be used for
/// binary data.
void SaveVTU(std::ostream &out, VTKFormat format=VTKFormat::ASCII,
int compression_level=0) const;
/// @brief Save the QuadratureFunction to a VTU (ParaView) file.
///
/// The extension ".vtu" will be appended to @a filename.
/// @sa SaveVTU(std::ostream &out, VTKFormat format=VTKFormat::ASCII,
/// int compression_level=0)
void SaveVTU(const std::string &filename, VTKFormat format=VTKFormat::ASCII,
int compression_level=0) const;
};
/// Overload operator<< for std::ostream and QuadratureFunction.
+6 -1
View File
@@ -78,6 +78,8 @@ void FindPointsGSLIB::Setup(Mesh &m, const double bb_t, const double newt_tol,
MFEM_VERIFY(m.GetNodes() != NULL, "Mesh nodes are required.");
MFEM_VERIFY(m.GetNumGeometries(m.Dimension()) == 1,
"Mixed meshes are not currently supported in FindPointsGSLIB.");
MFEM_VERIFY(!(m.GetNodes()->FESpace()->IsVariableOrder()),
"Variable order mesh is not currently supported.");
// call FreeData if FindPointsGSLIB::Setup has been called already
if (setupflag) { FreeData(); }
@@ -590,7 +592,8 @@ void FindPointsGSLIB::Interpolate(const GridFunction &field_in,
const L2_FECollection *fec_l2 = dynamic_cast<const L2_FECollection *>(fec_in);
if (fec_h1 && gf_order == mesh_order &&
fec_h1->GetBasisType() == BasisType::GaussLobatto)
fec_h1->GetBasisType() == BasisType::GaussLobatto &&
!field_in.FESpace()->IsVariableOrder())
{
InterpolateH1(field_in, field_out);
return;
@@ -857,6 +860,8 @@ void OversetFindPointsGSLIB::Setup(Mesh &m, const int meshid,
MFEM_VERIFY(m.GetNodes() != NULL, "Mesh nodes are required.");
MFEM_VERIFY(m.GetNumGeometries(m.Dimension()) == 1,
"Mixed meshes are not currently supported in FindPointsGSLIB.");
MFEM_VERIFY(!(m.GetNodes()->FESpace()->IsVariableOrder()),
"Variable order mesh is not currently supported.");
// FreeData if OversetFindPointsGSLIB::Setup has been called already
if (setupflag) { FreeData(); }
+10 -2
View File
@@ -776,7 +776,7 @@ void Hybridization::MultAfInv(const Vector &b, const Vector &lambda, Vector &bf,
if (vdof_marker[vdof]) { el_vals(j) = 0.0; }
else { vdof_marker[vdof] = true; }
}
bf_i.SetDataAndSize(&bf[hat_offsets[i]], vdofs.Size());
bf_i.MakeRef(bf, hat_offsets[i], vdofs.Size());
if (mode == 1)
{
el_vals -= bf_i;
@@ -821,7 +821,15 @@ void Hybridization::ReduceRHS(const Vector &b, Vector &b_r) const
else
{
Vector bl(pC ? pC->Height() : Ct->Width());
pC ? pC->Mult(bf, bl) : Ct->MultTranspose(bf, bl);
if (pC)
{
pC->Mult(bf, bl);
}
else
{
Ct->EnsureMultTranspose();
Ct->MultTranspose(bf, bl);
}
b_r.SetSize(pH.Ptr()->Height());
(P_pc ? P_pc : c_pfes->GetProlongationMatrix())->MultTranspose(bl, b_r);
}
+4 -6
View File
@@ -106,8 +106,6 @@ void LinearForm::Assemble()
DofTransformation *doftrans;
Vector elemvect;
int i;
Vector::operator=(0.0);
// The above operation is executed on device because of UseDevice().
@@ -127,7 +125,7 @@ void LinearForm::Assemble()
}
}
for (i = 0; i < fes -> GetNE(); i++)
for (int i = 0; i < fes -> GetNE(); i++)
{
int elem_attr = fes->GetMesh()->GetAttribute(i);
for (int k = 0; k < domain_integs.Size(); k++)
@@ -175,7 +173,7 @@ void LinearForm::Assemble()
}
}
for (i = 0; i < fes -> GetNBE(); i++)
for (int i = 0; i < fes -> GetNBE(); i++)
{
const int bdr_attr = mesh->GetBdrAttribute(i);
if (bdr_attr_marker[bdr_attr-1] == 0) { continue; }
@@ -223,7 +221,7 @@ void LinearForm::Assemble()
}
}
for (i = 0; i < mesh->GetNBE(); i++)
for (int i = 0; i < mesh->GetNBE(); i++)
{
const int bdr_attr = mesh->GetBdrAttribute(i);
if (bdr_attr_marker[bdr_attr-1] == 0) { continue; }
@@ -253,7 +251,7 @@ void LinearForm::Assemble()
for (int k = 0; k < interior_face_integs.Size(); k++)
{
for (i = 0; i < mesh->GetNumFaces(); i++)
for (int i = 0; i < mesh->GetNumFaces(); i++)
{
FaceElementTransformations *tr = NULL;
tr = mesh->GetInteriorFaceTransformations (i);
+7 -7
View File
@@ -67,11 +67,11 @@ void LORBase::ResetIntegrationRules(GetIntegratorsFn get_integrators)
LORBase::FESpaceType LORBase::GetFESpaceType() const
{
const FiniteElementCollection *fec = fes_ho.FEColl();
if (dynamic_cast<const H1_FECollection*>(fec)) { return H1; }
else if (dynamic_cast<const ND_FECollection*>(fec)) { return ND; }
else if (dynamic_cast<const RT_FECollection*>(fec)) { return RT; }
else if (dynamic_cast<const L2_FECollection*>(fec)) { return L2; }
const FiniteElementCollection *fec_ho = fes_ho.FEColl();
if (dynamic_cast<const H1_FECollection*>(fec_ho)) { return H1; }
else if (dynamic_cast<const ND_FECollection*>(fec_ho)) { return ND; }
else if (dynamic_cast<const RT_FECollection*>(fec_ho)) { return RT; }
else if (dynamic_cast<const L2_FECollection*>(fec_ho)) { return L2; }
else { MFEM_ABORT("Bad LOR space type."); }
return INVALID;
}
@@ -87,9 +87,9 @@ void LORBase::ConstructLocalDofPermutation(Array<int> &perm_) const
FESpaceType type = GetFESpaceType();
MFEM_VERIFY(type != H1 && type != L2, "");
auto get_dof_map = [](FiniteElementSpace &fes, int i)
auto get_dof_map = [](FiniteElementSpace &fes_, int i)
{
const FiniteElement *fe = fes.GetFE(i);
const FiniteElement *fe = fes_.GetFE(i);
auto tfe = dynamic_cast<const TensorBasisElement*>(fe);
MFEM_ASSERT(tfe != NULL, "");
return tfe->GetDofMap();
+2 -2
View File
@@ -151,8 +151,8 @@ public:
void SetEssentialVDofs(const Array<int> &ess_vdofs_list);
/// Specify essential boundary conditions.
void SetEssentialTrueDofs(const Array<int> &ess_tdof_list)
{ ess_tdof_list.Copy(this->ess_tdof_list); }
void SetEssentialTrueDofs(const Array<int> &ess_tdof_list_)
{ ess_tdof_list_.Copy(this->ess_tdof_list); }
/// Return a (read-only) list of all essential true dofs.
const Array<int> &GetEssentialTrueDofs() const { return ess_tdof_list; }
+12 -12
View File
@@ -746,7 +746,7 @@ void VectorConvectionNLFIntegrator::AssembleElementVector(
Vector &elvect)
{
const int nd = el.GetDof();
const int dim = el.GetDim();
dim = el.GetDim();
shape.SetSize(nd);
dshape.SetSize(nd, dim);
@@ -783,7 +783,7 @@ void VectorConvectionNLFIntegrator::AssembleElementGrad(
DenseMatrix &elmat)
{
const int nd = el.GetDof();
const int dim = el.GetDim();
dim = el.GetDim();
shape.SetSize(nd);
dshape.SetSize(nd, dim);
@@ -826,9 +826,9 @@ void VectorConvectionNLFIntegrator::AssembleElementGrad(
dshape.Mult(vec2, vec3);
MultVWt(shape, vec3, elmat_comp);
for (int i = 0; i < dim; i++)
for (int ii = 0; ii < dim; ii++)
{
elmat.AddMatrix(elmat_comp, i * nd, i * nd);
elmat.AddMatrix(elmat_comp, ii * nd, ii * nd);
}
MultVVt(shape, elmat_comp);
@@ -837,11 +837,11 @@ void VectorConvectionNLFIntegrator::AssembleElementGrad(
{
w *= Q->Eval(trans, ip);
}
for (int i = 0; i < dim; i++)
for (int ii = 0; ii < dim; ii++)
{
for (int j = 0; j < dim; j++)
for (int jj = 0; jj < dim; jj++)
{
elmat.AddMatrix(w * gradEF(i, j), elmat_comp, i * nd, j * nd);
elmat.AddMatrix(w * gradEF(ii, jj), elmat_comp, ii * nd, jj * nd);
}
}
}
@@ -889,9 +889,9 @@ void ConvectiveVectorConvectionNLFIntegrator::AssembleElementGrad(
dshape.Mult(vec2, vec3); // (u^n \cdot grad u^{n+1})
MultVWt(shape, vec3, elmat_comp); // (u^n \cdot grad u^{n+1},v)
for (int i = 0; i < dim; i++)
for (int ii = 0; ii < dim; ii++)
{
elmat.AddMatrix(elmat_comp, i * nd, i * nd);
elmat.AddMatrix(elmat_comp, ii * nd, ii * nd);
}
}
}
@@ -944,10 +944,10 @@ void SkewSymmetricVectorConvectionNLFIntegrator::AssembleElementGrad(
MultVWt(shape, vec3, elmat_comp); // (u^n \cdot grad u^{n+1},v)
elmat_comp_T.Transpose(elmat_comp);
for (int i = 0; i < dim; i++)
for (int ii = 0; ii < dim; ii++)
{
elmat.AddMatrix(.5, elmat_comp, i * nd, i * nd);
elmat.AddMatrix(-.5, elmat_comp_T, i * nd, i * nd);
elmat.AddMatrix(.5, elmat_comp, ii * nd, ii * nd);
elmat.AddMatrix(-.5, elmat_comp_T, ii * nd, ii * nd);
}
}
}
+14 -13
View File
@@ -317,26 +317,26 @@ ParallelEliminateEssentialBC(const Array<int> &bdr_attr_is_ess,
void ParBilinearForm::TrueAddMult(const Vector &x, Vector &y, const double a)
const
{
if (X.ParFESpace() != pfes)
if (Xaux.ParFESpace() != pfes)
{
X.SetSpace(pfes);
Y.SetSpace(pfes);
Xaux.SetSpace(pfes);
Yaux.SetSpace(pfes);
Ytmp.SetSize(pfes->GetTrueVSize());
}
X.Distribute(&x);
Xaux.Distribute(&x);
if (ext)
{
ext->Mult(X, Y);
ext->Mult(Xaux, Yaux);
}
else
{
MFEM_VERIFY(interior_face_integs.Size() == 0,
"the case of interior face integrators is not"
" implemented");
mat->Mult(X, Y);
mat->Mult(Xaux, Yaux);
}
pfes->GetProlongationMatrix()->MultTranspose(Y, Ytmp);
pfes->GetProlongationMatrix()->MultTranspose(Yaux, Ytmp);
y.Add(a,Ytmp);
}
@@ -373,6 +373,7 @@ void ParBilinearForm::FormLinearSystem(
P.MultTranspose(b, true_B);
R.Mult(x, true_X);
p_mat.EliminateBC(p_mat_e, ess_tdof_list, true_X, true_B);
R.EnsureMultTranspose();
R.MultTranspose(true_B, b);
hybridization->ReduceRHS(true_B, B);
X.SetSize(B.Size());
@@ -537,15 +538,15 @@ void ParMixedBilinearForm::ParallelAssemble(OperatorHandle &A)
void ParMixedBilinearForm::TrueAddMult(const Vector &x, Vector &y,
const double a) const
{
if (X.ParFESpace() != trial_pfes)
if (Xaux.ParFESpace() != trial_pfes)
{
X.SetSpace(trial_pfes);
Y.SetSpace(test_pfes);
Xaux.SetSpace(trial_pfes);
Yaux.SetSpace(test_pfes);
}
X.Distribute(&x);
mat->Mult(X, Y);
test_pfes->Dof_TrueDof_Matrix()->MultTranspose(a, Y, 1.0, y);
Xaux.Distribute(&x);
mat->Mult(Xaux, Yaux);
test_pfes->Dof_TrueDof_Matrix()->MultTranspose(a, Yaux, 1.0, y);
}
void ParMixedBilinearForm::FormRectangularSystemMatrix(
+2 -2
View File
@@ -32,7 +32,7 @@ protected:
ParFiniteElementSpace *pfes; ///< Points to the same object as #fes
/// Auxiliary objects used in TrueAddMult().
mutable ParGridFunction X, Y;
mutable ParGridFunction Xaux, Yaux;
mutable Vector Ytmp;
OperatorHandle p_mat, p_mat_e;
@@ -211,7 +211,7 @@ protected:
/// Points to the same object as #test_fes
ParFiniteElementSpace *test_pfes;
/// Auxiliary objects used in TrueAddMult().
mutable ParGridFunction X, Y;
mutable ParGridFunction Xaux, Yaux;
/// Matrix and eliminated matrix
OperatorHandle p_mat, p_mat_e;
+71 -58
View File
@@ -232,7 +232,7 @@ void ParFiniteElementSpace::PrintPartitionStats()
}
void ParFiniteElementSpace::GetGroupComm(
GroupCommunicator &gc, int ldof_type, Array<int> *ldof_sign)
GroupCommunicator &gc, int ldof_type, Array<int> *g_ldof_sign)
{
int gr;
int ng = pmesh->GetNGroups();
@@ -257,10 +257,10 @@ void ParFiniteElementSpace::GetGroupComm(
}
}
if (ldof_sign)
if (g_ldof_sign)
{
ldof_sign->SetSize(GetNDofs());
*ldof_sign = 1;
g_ldof_sign->SetSize(GetNDofs());
*g_ldof_sign = 1;
}
// count the number of ldofs in all groups (excluding the local group 0)
@@ -333,9 +333,9 @@ void ParFiniteElementSpace::GetGroupComm(
if (ind[l] < 0)
{
dofs[l] = m + (-1-ind[l]);
if (ldof_sign)
if (g_ldof_sign)
{
(*ldof_sign)[dofs[l]] = -1;
(*g_ldof_sign)[dofs[l]] = -1;
}
}
else
@@ -371,9 +371,9 @@ void ParFiniteElementSpace::GetGroupComm(
if (ind[l] < 0)
{
dofs[l] = m + (-1-ind[l]);
if (ldof_sign)
if (g_ldof_sign)
{
(*ldof_sign)[dofs[l]] = -1;
(*g_ldof_sign)[dofs[l]] = -1;
}
}
else
@@ -409,9 +409,9 @@ void ParFiniteElementSpace::GetGroupComm(
if (ind[l] < 0)
{
dofs[l] = m + (-1-ind[l]);
if (ldof_sign)
if (g_ldof_sign)
{
(*ldof_sign)[dofs[l]] = -1;
(*g_ldof_sign)[dofs[l]] = -1;
}
}
else
@@ -556,11 +556,25 @@ const FaceRestriction *ParFiniteElementSpace::GetFaceRestriction(
FaceRestriction *res;
if (is_dg_space)
{
res = new ParL2FaceRestriction(*this, e_ordering, type, m);
if (Conforming())
{
res = new ParL2FaceRestriction(*this, e_ordering, type, m);
}
else
{
res = new ParNCL2FaceRestriction(*this, e_ordering, type, m);
}
}
else
{
res = new H1FaceRestriction(*this, e_ordering, type);
if (Conforming())
{
res = new H1FaceRestriction(*this, e_ordering, type);
}
else
{
res = new ParNCH1FaceRestriction(*this, e_ordering, type);
}
}
L2F[key] = res;
return res;
@@ -750,10 +764,10 @@ void ParFiniteElementSpace::Build_Dof_TrueDof_Matrix() const // matrix P
diag_counter = offd_counter = 0;
for (int i = 0; i < ldof; i++)
{
int ltdof = GetLocalTDofNumber(i);
if (ltdof >= 0)
int ltdof_i = GetLocalTDofNumber(i);
if (ltdof_i >= 0)
{
j_diag[diag_counter++] = ltdof;
j_diag[diag_counter++] = ltdof_i;
}
else
{
@@ -870,10 +884,10 @@ void ParFiniteElementSpace::Build_Dof_TrueDof_Matrix() const // matrix P
int offd_col_counter = 0;
for (int i = 0; i < ldof; i++)
{
int ltdof = GetLocalTDofNumber(i);
if (ltdof >= 0)
int ltdofi = GetLocalTDofNumber(i);
if (ltdofi >= 0)
{
j_diag[diag_counter] = ltdof;
j_diag[diag_counter] = ltdofi;
d_diag[diag_counter++] = 1.0;
}
else
@@ -1010,12 +1024,9 @@ void ParFiniteElementSpace::GetEssentialVDofs(const Array<int> &bdr_attr_is_ess,
{
FiniteElementSpace::GetEssentialVDofs(bdr_attr_is_ess, ess_dofs, component);
if (Conforming())
{
// Make sure that processors without boundary elements mark
// their boundary dofs (if they have any).
Synchronize(ess_dofs);
}
// Make sure that processors without boundary elements mark
// their boundary dofs (if they have any).
Synchronize(ess_dofs);
}
void ParFiniteElementSpace::GetEssentialTrueDofs(const Array<int>
@@ -1041,7 +1052,8 @@ void ParFiniteElementSpace::GetEssentialTrueDofs(const Array<int>
{
if (bool(ted[i]) != bool(true_ess_dofs2[i])) { counter++; }
}
MFEM_VERIFY(counter == 0, "internal MFEM error: counter = " << counter);
MFEM_VERIFY(counter == 0, "internal MFEM error: counter = " << counter
<< ", rank = " << MyRank);
#endif
MarkerToList(true_ess_dofs, ess_tdof_list);
@@ -1329,12 +1341,12 @@ void ParFiniteElementSpace::ExchangeFaceNbrData()
for (int fn = 0, j = 0; fn < num_face_nbrs; fn++)
{
int num_ldofs = send_face_nbr_ldof.RowSize(fn);
int *ldofs = send_face_nbr_ldof.GetRow(fn);
int *ldofs_fn = send_face_nbr_ldof.GetRow(fn);
int j_end = send_I[send_el_off[fn+1]];
for (int i = 0; i < num_ldofs; i++)
{
int ldof = (ldofs[i] >= 0 ? ldofs[i] : -1-ldofs[i]);
int ldof = (ldofs_fn[i] >= 0 ? ldofs_fn[i] : -1-ldofs_fn[i]);
ldof_marker[ldof] = i;
}
@@ -2025,7 +2037,7 @@ public:
const RowInfo::List& GetRows() const { return rows; }
void SetNCMesh(ParNCMesh* pnc) { pncmesh = pnc; }
void SetFEC(const FiniteElementCollection* fec) { this->fec = fec; }
void SetFEC(const FiniteElementCollection* fec_) { this->fec = fec_; }
typedef std::map<int, NeighborRowMessage> Map;
@@ -2288,7 +2300,7 @@ void ParFiniteElementSpace
#endif
int ParFiniteElementSpace
::BuildParallelConformingInterpolation(HypreParMatrix **P, SparseMatrix **R,
::BuildParallelConformingInterpolation(HypreParMatrix **P_, SparseMatrix **R_,
Array<HYPRE_BigInt> &dof_offs,
Array<HYPRE_BigInt> &tdof_offs,
Array<int> *dof_tdof,
@@ -2445,10 +2457,10 @@ int ParFiniteElementSpace
HYPRE_BigInt my_tdof_offset =
tdof_offs[HYPRE_AssumedPartitionCheck() ? 0 : MyRank];
if (R)
if (R_)
{
// initialize the restriction matrix (also parallel but block-diagonal)
*R = new SparseMatrix(num_true_dofs*vdim, ndofs*vdim);
*R_ = new SparseMatrix(num_true_dofs*vdim, ndofs*vdim);
}
if (dof_tdof)
{
@@ -2486,7 +2498,7 @@ int ParFiniteElementSpace
int vdof = dof*vdim_factor + vd*dof_stride;
int vtdof = tdof*vdim_factor + vd*tdof_stride;
if (R) { (*R)->Add(vtdof, vdof, 1.0); }
if (R_) { (*R_)->Add(vtdof, vdof, 1.0); }
if (dof_tdof) { (*dof_tdof)[vdof] = vtdof; }
}
tdof++;
@@ -2499,7 +2511,7 @@ int ParFiniteElementSpace
n_msgs_sent += send_msg.back().size();
#endif
if (R) { (*R)->Finalize(); }
if (R_) { (*R_)->Finalize(); }
// *** STEP 4: main loop ***
@@ -2608,10 +2620,10 @@ int ParFiniteElementSpace
#endif
}
if (P)
if (P_)
{
*P = MakeVDimHypreMatrix(pmatrix, ndofs, num_true_dofs,
dof_offs, tdof_offs);
*P_ = MakeVDimHypreMatrix(pmatrix, ndofs, num_true_dofs,
dof_offs, tdof_offs);
}
// clean up possible remaining messages in the queue to avoid receiving
@@ -2800,13 +2812,13 @@ ParFiniteElementSpace::RebalanceMatrix(int old_ndofs,
? old_dof_offsets[0] : old_dof_offsets[MyRank];
// send old DOFs of elements we used to own
ParNCMesh* pncmesh = pmesh->pncmesh;
pncmesh->SendRebalanceDofs(old_ndofs, *old_elem_dof, old_offset, this);
ParNCMesh* old_pncmesh = pmesh->pncmesh;
old_pncmesh->SendRebalanceDofs(old_ndofs, *old_elem_dof, old_offset, this);
Array<int> dofs;
int vsize = GetVSize();
const Array<int> &old_index = pncmesh->GetRebalanceOldIndex();
const Array<int> &old_index = old_pncmesh->GetRebalanceOldIndex();
MFEM_VERIFY(old_index.Size() == pmesh->GetNE(),
"Mesh::Rebalance was not called before "
"ParFiniteElementSpace::RebalanceMatrix");
@@ -2840,7 +2852,7 @@ ParFiniteElementSpace::RebalanceMatrix(int old_ndofs,
// receive old DOFs for elements we obtained from others in Rebalance
Array<int> new_elements;
Array<long> old_remote_dofs;
pncmesh->RecvRebalanceDofs(new_elements, old_remote_dofs);
old_pncmesh->RecvRebalanceDofs(new_elements, old_remote_dofs);
// create the offdiagonal part of the matrix
HYPRE_BigInt* i_offd = make_i_array<HYPRE_BigInt>(vsize);
@@ -2938,7 +2950,7 @@ ParFiniteElementSpace::ParallelDerefinementMatrix(int old_ndofs,
Array<int> dofs, old_dofs, old_vdofs;
Vector row;
ParNCMesh* pncmesh = pmesh->pncmesh;
ParNCMesh* old_pncmesh = pmesh->pncmesh;
int ldof[Geometry::NumGeom];
for (int i = 0; i < Geometry::NumGeom; i++)
@@ -2951,8 +2963,9 @@ ParFiniteElementSpace::ParallelDerefinementMatrix(int old_ndofs,
ldof[geom] = fec->FiniteElementForGeometry(geom)->GetDof();
}
const CoarseFineTransformations &dtrans = pncmesh->GetDerefinementTransforms();
const Array<int> &old_ranks = pncmesh->GetDerefineOldRanks();
const CoarseFineTransformations &dtrans =
old_pncmesh->GetDerefinementTransforms();
const Array<int> &old_ranks = old_pncmesh->GetDerefineOldRanks();
std::map<int, DerefDofMessage> messages;
@@ -2967,7 +2980,7 @@ ParFiniteElementSpace::ParallelDerefinementMatrix(int old_ndofs,
int fine_rank = old_ranks[k];
int coarse_rank = (emb.parent < 0) ? (-1 - emb.parent)
: pncmesh->ElementRank(emb.parent);
: old_pncmesh->ElementRank(emb.parent);
if (coarse_rank != MyRank && fine_rank == MyRank)
{
@@ -3017,7 +3030,7 @@ ParFiniteElementSpace::ParallelDerefinementMatrix(int old_ndofs,
const Embedding &emb = dtrans.embeddings[k];
if (emb.parent < 0) { continue; }
int coarse_rank = pncmesh->ElementRank(emb.parent);
int coarse_rank = old_pncmesh->ElementRank(emb.parent);
int fine_rank = old_ranks[k];
if (coarse_rank == MyRank && fine_rank == MyRank)
@@ -3067,7 +3080,7 @@ ParFiniteElementSpace::ParallelDerefinementMatrix(int old_ndofs,
const Embedding &emb = dtrans.embeddings[k];
if (emb.parent < 0) { continue; }
int coarse_rank = pncmesh->ElementRank(emb.parent);
int coarse_rank = old_pncmesh->ElementRank(emb.parent);
int fine_rank = old_ranks[k];
if (coarse_rank == MyRank && fine_rank != MyRank)
@@ -3148,14 +3161,14 @@ ParFiniteElementSpace::ParallelDerefinementMatrix(int old_ndofs,
offd->SortColumnIndices();
}
HypreParMatrix* R;
R = new HypreParMatrix(MyComm, dof_offsets[nrk], old_dof_offsets[nrk],
dof_offsets, old_dof_offsets, diag, offd, cmap,
true);
HypreParMatrix* new_R;
new_R = new HypreParMatrix(MyComm, dof_offsets[nrk], old_dof_offsets[nrk],
dof_offsets, old_dof_offsets, diag, offd, cmap,
true);
R->SetOwnerFlags(R->OwnsDiag(), R->OwnsOffd(), 1);
new_R->SetOwnerFlags(new_R->OwnsDiag(), new_R->OwnsOffd(), 1);
return R;
return new_R;
}
void ParFiniteElementSpace::Destroy()
@@ -3539,18 +3552,18 @@ DeviceConformingProlongationOperator::DeviceConformingProlongationOperator(
shr_buf.UseDevice(true);
shr_buf_offsets = nbr_ltdof.GetIMemory();
{
Array<int> shr_ltdof(nbr_ltdof.GetJ(), nb_connections);
Array<int> unique_ltdof(shr_ltdof);
Array<int> shared_ltdof(nbr_ltdof.GetJ(), nb_connections);
Array<int> unique_ltdof(shared_ltdof);
unique_ltdof.Sort();
unique_ltdof.Unique();
// Note: the next loop modifies the J array of nbr_ltdof
for (int i = 0; i < shr_ltdof.Size(); i++)
for (int i = 0; i < shared_ltdof.Size(); i++)
{
shr_ltdof[i] = unique_ltdof.FindSorted(shr_ltdof[i]);
MFEM_ASSERT(shr_ltdof[i] != -1, "internal error");
shared_ltdof[i] = unique_ltdof.FindSorted(shared_ltdof[i]);
MFEM_ASSERT(shared_ltdof[i] != -1, "internal error");
}
Table unique_shr;
Transpose(shr_ltdof, unique_shr, unique_ltdof.Size());
Transpose(shared_ltdof, unique_shr, unique_ltdof.Size());
unq_ltdof = Array<int>(unique_ltdof, unique_ltdof.Size());
unq_shr_i = Array<int>(unique_shr.GetI(), unique_shr.Size()+1);
unq_shr_j = Array<int>(unique_shr.GetJ(), unique_shr.Size_of_connections());
+2 -2
View File
@@ -90,8 +90,8 @@ void ParNonlinearForm::Mult(const Vector &x, Vector &y) const
const int N = ess_tdof_list.Size();
const auto idx = ess_tdof_list.Read();
auto Y = y.ReadWrite();
MFEM_FORALL(i, N, Y[idx[i]] = 0.0; );
auto Y_RW = y.ReadWrite();
MFEM_FORALL(i, N, Y_RW[idx[i]] = 0.0; );
}
const SparseMatrix &ParNonlinearForm::GetLocalGradient(const Vector &x) const
+878 -325
View File
File diff suppressed because it is too large Load Diff
+331 -17
View File
@@ -23,34 +23,348 @@ namespace mfem
class ParFiniteElementSpace;
/// Operator that extracts Face degrees of freedom in parallel.
/** Objects of this type are typically created and owned by FiniteElementSpace
objects, see FiniteElementSpace::GetFaceRestriction(). */
class ParL2FaceRestriction : public L2FaceRestriction
/// Operator that extracts Face degrees of freedom for NCMesh in parallel.
/** Objects of this type are typically created and owned by
ParFiniteElementSpace objects, see
ParFiniteElementSpace::GetFaceRestriction(). */
class ParNCH1FaceRestriction : public H1FaceRestriction
{
protected:
const FaceType type;
InterpolationManager interpolations;
mutable Vector x_interp;
public:
ParL2FaceRestriction(const ParFiniteElementSpace&, ElementDofOrdering,
/** @brief Constructs an ParNCH1FaceRestriction.
@param[in] fes The ParFiniteElementSpace on which this operates
@param[in] ordering Request a specific ordering
@param[in] type Request internal or boundary faces dofs */
ParNCH1FaceRestriction(const ParFiniteElementSpace &fes,
ElementDofOrdering ordering,
FaceType type);
/** @brief Scatter the degrees of freedom, i.e. goes from L-Vector to
face E-Vector.
@param[in] x The L-vector degrees of freedom.
@param[out] y The face E-Vector degrees of freedom with the given format:
face_dofs x vdim x nf
where nf is the number of interior or boundary faces
requested by @a type in the constructor.
The face_dofs are ordered according to the given
ElementDofOrdering. */
void Mult(const Vector &x, Vector &y) const override;
/** @brief Gather the degrees of freedom, i.e. goes from face E-Vector to
L-Vector.
@param[in] x The face E-Vector degrees of freedom with the given format:
face_dofs x vdim x nf
where nf is the number of interior or boundary faces
requested by @a type in the constructor.
The face_dofs should be ordered according to the given
ElementDofOrdering.
@param[in,out] y The L-vector degrees of freedom. */
void AddMultTranspose(const Vector &x, Vector &y) const override;
private:
/** @brief Compute the scatter indices: L-vector to E-vector, the offsets
for the gathering: E-vector to L-vector, and the interpolators from
coarse to fine face for master non-comforming faces.
@param[in] ordering Request a specific element ordering.
@param[in] type Request internal or boundary faces dofs.
*/
void ComputeScatterIndicesAndOffsets(const ElementDofOrdering ordering,
const FaceType type);
/** @brief Compute the gather indices: E-vector to L-vector.
Note: Requires the gather offsets to be computed.
@param[in] ordering Request a specific element ordering.
@param[in] type Request internal or boundary faces dofs.
*/
void ComputeGatherIndices(const ElementDofOrdering ordering,
const FaceType type);
};
/// Operator that extracts Face degrees of freedom in parallel.
/** Objects of this type are typically created and owned by
ParFiniteElementSpace objects, see
ParFiniteElementSpace::GetFaceRestriction(). */
class ParL2FaceRestriction : virtual public L2FaceRestriction
{
protected:
/** @brief Constructs an ParL2FaceRestriction.
@param[in] fes The ParFiniteElementSpace on which this operates
@param[in] ordering Request a specific ordering
@param[in] type Request internal or boundary faces dofs
@param[in] m Request the face dofs for elem1, or both elem1 and
elem2
@param[in] build Request the ParL2FaceRestriction to compute the
scatter/gather indices. False should only be used
when inheriting from ParL2FaceRestriction. */
ParL2FaceRestriction(const ParFiniteElementSpace& fes,
ElementDofOrdering ordering,
FaceType type,
L2FaceValues m,
bool build);
public:
/** @brief Constructs an ParL2FaceRestriction.
@param[in] fes The ParFiniteElementSpace on which this operates
@param[in] ordering Request a specific ordering
@param[in] type Request internal or boundary faces dofs
@param[in] m Request the face dofs for elem1, or both elem1 and
elem2 */
ParL2FaceRestriction(const ParFiniteElementSpace& fes,
ElementDofOrdering ordering,
FaceType type,
L2FaceValues m = L2FaceValues::DoubleValued);
void Mult(const Vector &x, Vector &y) const;
/** @brief Scatter the degrees of freedom, i.e. goes from L-Vector to
face E-Vector.
@param[in] x The L-vector degrees of freedom.
@param[out] y The face E-Vector degrees of freedom with the given format:
if L2FacesValues::DoubleValued (face_dofs x vdim x 2 x nf),
if L2FacesValues::SingleValued (face_dofs x vdim x nf),
where nf is the number of interior or boundary faces
requested by @a type in the constructor.
The face_dofs are ordered according to the given
ElementDofOrdering. */
void Mult(const Vector &x, Vector &y) const override;
/** Fill the I array of SparseMatrix corresponding to the sparsity pattern
given by this L2FaceRestriction. */
virtual void FillI(SparseMatrix &mat, const bool keep_nbr_block = false) const;
given by this ParL2FaceRestriction.
@param[in,out] mat The sparse matrix for which we want to initialize the
row offsets.
@param[in] keep_nbr_block When set to true the SparseMatrix will
include the rows (in addition to the columns)
corresponding to face-neighbor dofs. The
default behavior is to disregard those rows. */
void FillI(SparseMatrix &mat,
const bool keep_nbr_block = false) const override;
/** Fill the I array of SparseMatrix corresponding to the sparsity pattern
given by this L2FaceRestriction. @a mat contains the interior dofs
given by this ParL2FaceRestriction. @a mat contains the interior dofs
contribution, the @a face_mat contains the shared dofs contribution.*/
virtual void FillI(SparseMatrix &mat, SparseMatrix &face_mat) const;
void FillI(SparseMatrix &mat,
SparseMatrix &face_mat) const;
/** Fill the J and Data arrays of SparseMatrix corresponding to the sparsity
pattern given by this L2FaceRestriction, and the values of ea_data.
pattern given by this ParL2FaceRestriction, and the values of ea_data.
@a mat contains the interior dofs contribution, the @a face_mat contains
the shared dofs contribution.*/
virtual void FillJAndData(const Vector &ea_data,
SparseMatrix &mat,
SparseMatrix &face_mat) const;
void FillJAndData(const Vector &ea_data,
SparseMatrix &mat,
SparseMatrix &face_mat) const;
virtual void FillJAndData(const Vector &ea_data,
SparseMatrix &mat,
const bool keep_nbr_block = false) const;
/** @brief Fill the J and Data arrays of the SparseMatrix corresponding to
the sparsity pattern given by this ParL2FaceRestriction, and the values of
fea_data.
@param[in] fea_data The dense matrices representing the local operators
on each face. The format is:
face_dofs x face_dofs x 2 x nf.
On each face the first local matrix corresponds to
the contribution of elem1 on elem2, and the second to
the contribution of elem2 on elem1.
@param[in,out] mat The sparse matrix that is getting filled.
@param[in] keep_nbr_block When set to true the SparseMatrix will
include the rows (in addition to the columns)
corresponding to face-neighbor dofs. The
default behavior is to disregard those rows. */
void FillJAndData(const Vector &fea_data,
SparseMatrix &mat,
const bool keep_nbr_block = false) const override;
private:
/** @brief Compute the scatter indices: L-vector to E-vector, and the offsets
for the gathering: E-vector to L-vector.
@param[in] ordering Request a specific element ordering.
@param[in] type Request internal or boundary faces dofs.
*/
void ComputeScatterIndicesAndOffsets(const ElementDofOrdering ordering,
const FaceType type);
/** @brief Compute the gather indices: E-vector to L-vector.
Note: Requires the gather offsets to be computed.
@param[in] ordering Request a specific element ordering.
@param[in] type Request internal or boundary faces dofs.
*/
void ComputeGatherIndices(const ElementDofOrdering ordering,
const FaceType type);
public:
/** @brief Scatter the degrees of freedom, i.e. goes from L-Vector to
face E-Vector. Should only be used with conforming faces and when:
m == L2FacesValues::DoubleValued
@param[in] x The L-vector degrees of freedom.
@param[out] y The face E-Vector degrees of freedom with the given format:
face_dofs x vdim x 2 x nf
where nf is the number of interior or boundary faces
requested by @a type in the constructor.
The face_dofs are ordered according to the given
ElementDofOrdering. */
void DoubleValuedConformingMult(const Vector& x, Vector& y) const override;
};
/// Operator that extracts Face degrees of freedom for NCMesh in parallel.
/** Objects of this type are typically created and owned by
ParFiniteElementSpace objects, see
ParFiniteElementSpace::GetFaceRestriction(). */
class ParNCL2FaceRestriction
: public NCL2FaceRestriction, public ParL2FaceRestriction
{
public:
/** @brief Constructs an ParNCL2FaceRestriction.
@param[in] fes The ParFiniteElementSpace on which this operates
@param[in] ordering Request a specific ordering
@param[in] type Request internal or boundary faces dofs
@param[in] m Request the face dofs for elem1, or both elem1 and
elem2 */
ParNCL2FaceRestriction(const ParFiniteElementSpace& fes,
ElementDofOrdering ordering,
FaceType type,
L2FaceValues m = L2FaceValues::DoubleValued);
/** @brief Scatter the degrees of freedom, i.e. goes from L-Vector to
face E-Vector.
@param[in] x The L-vector degrees of freedom.
@param[out] y The face E-Vector degrees of freedom with the given format:
if L2FacesValues::DoubleValued (face_dofs x vdim x 2 x nf),
if L2FacesValues::SingleValued (face_dofs x vdim x nf),
where nf is the number of interior or boundary faces
requested by @a type in the constructor.
The face_dofs are ordered according to the given
ElementDofOrdering. */
void Mult(const Vector &x, Vector &y) const override;
/** @brief Gather the degrees of freedom, i.e. goes from face E-Vector to
L-Vector.
@param[in] x The face E-Vector degrees of freedom with the given format:
if L2FacesValues::DoubleValued (face_dofs x vdim x 2 x nf),
if L2FacesValues::SingleValued (face_dofs x vdim x nf),
where nf is the number of interior or boundary faces
requested by @a type in the constructor.
The face_dofs should be ordered according to the given
ElementDofOrdering
@param[in,out] y The L-vector degrees of freedom. */
void AddMultTranspose(const Vector &x, Vector &y) const override;
/** @brief Fill the I array of SparseMatrix corresponding to the sparsity
pattern given by this ParNCL2FaceRestriction.
@param[in,out] mat The sparse matrix for which we want to initialize the
row offsets.
@param[in] keep_nbr_block When set to true the SparseMatrix will
include the rows (in addition to the columns)
corresponding to face-neighbor dofs. The
default behavior is to disregard those rows.
@warning This method is not implemented yet. */
void FillI(SparseMatrix &mat,
const bool keep_nbr_block = false) const override;
/** Fill the I array of SparseMatrix corresponding to the sparsity pattern
given by this ParNCL2FaceRestriction. @a mat contains the interior dofs
contribution, the @a face_mat contains the shared dofs contribution.
@warning This method is not implemented yet. */
void FillI(SparseMatrix &mat,
SparseMatrix &face_mat) const;
/** Fill the J and Data arrays of SparseMatrix corresponding to the sparsity
pattern given by this ParNCL2FaceRestriction, and the values of ea_data.
@a mat contains the interior dofs contribution, the @a face_mat contains
the shared dofs contribution.
@warning This method is not implemented yet. */
void FillJAndData(const Vector &fea_data,
SparseMatrix &mat,
SparseMatrix &face_mat) const;
/** @brief Fill the J and Data arrays of the SparseMatrix corresponding to
the sparsity pattern given by this ParNCL2FaceRestriction, and the values
of ea_data.
@param[in] fea_data The dense matrices representing the local operators
on each face. The format is:
face_dofs x face_dofs x 2 x nf.
On each face the first local matrix corresponds to
the contribution of elem1 on elem2, and the second to
the contribution of elem2 on elem1.
@param[in,out] mat The sparse matrix that is getting filled.
@param[in] keep_nbr_block When set to true the SparseMatrix will
include the rows (in addition to the columns)
corresponding to face-neighbor dofs. The
default behavior is to disregard those rows.
@warning This method is not implemented yet. */
void FillJAndData(const Vector &fea_data,
SparseMatrix &mat,
const bool keep_nbr_block = false) const override;
private:
/** @brief Compute the scatter indices: L-vector to E-vector, the offsets
for the gathering: E-vector to L-vector, and the interpolators from
coarse to fine face for master non-comforming faces.
@param[in] ordering Request a specific element ordering.
@param[in] type Request internal or boundary faces dofs.
*/
void ComputeScatterIndicesAndOffsets(const ElementDofOrdering ordering,
const FaceType type);
/** @brief Compute the gather indices: E-vector to L-vector.
Note: Requires the gather offsets to be computed.
@param[in] ordering Request a specific element ordering.
@param[in] type Request internal or boundary faces dofs.
*/
void ComputeGatherIndices(const ElementDofOrdering ordering,
const FaceType type);
public:
/** @brief Scatter the degrees of freedom, i.e. goes from L-Vector to
face E-Vector. Should only be used with nonconforming faces and when:
L2FaceValues m == L2FaceValues::SingleValued
@param[in] x The L-vector degrees of freedom.
@param[out] y The face E-Vector degrees of freedom with the given format:
(face_dofs x vdim x nf),
where nf is the number of interior or boundary faces
requested by @a type in the constructor.
The face_dofs are ordered according to the given
ElementDofOrdering. */
void SingleValuedNonconformingMult(const Vector& x, Vector& y) const;
/** @brief Scatter the degrees of freedom, i.e. goes from L-Vector to
face E-Vector. Should only be used with nonconforming faces and when:
L2FaceValues m == L2FaceValues::DoubleValued
@param[in] x The L-vector degrees of freedom.
@param[out] y The face E-Vector degrees of freedom with the given format:
(face_dofs x vdim x 2 x nf),
where nf is the number of interior or boundary faces
requested by @a type in the constructor.
The face_dofs are ordered according to the given
ElementDofOrdering. */
void DoubleValuedNonconformingMult(const Vector& x, Vector& y) const override;
};
}
+4 -4
View File
@@ -65,13 +65,13 @@ static void Values2D(const int NE,
MFEM_SHARED double sm0[NBZ][MDQ*MDQ];
MFEM_SHARED double sm1[NBZ][MDQ*MDQ];
kernels::internal::LoadB<MD1,MQ1>(D1D,Q1D,b,sB);
ConstDeviceMatrix B(sB, D1D,Q1D);
DeviceMatrix DD(sm0[tidz], MD1, MD1);
DeviceMatrix DQ(sm1[tidz], MD1, MQ1);
DeviceMatrix QQ(sm0[tidz], MQ1, MQ1);
kernels::internal::LoadB<MD1,MQ1>(D1D,Q1D,b,sB);
for (int c = 0; c < VDIM; c++)
{
kernels::internal::LoadX(e,D1D,c,x,DD);
@@ -126,14 +126,14 @@ static void Values3D(const int NE,
MFEM_SHARED double sm0[MDQ*MDQ*MDQ];
MFEM_SHARED double sm1[MDQ*MDQ*MDQ];
kernels::internal::LoadB<MD1,MQ1>(D1D,Q1D,b,sB);
ConstDeviceMatrix B(sB, D1D,Q1D);
DeviceCube DDD(sm0, MD1,MD1,MD1);
DeviceCube DDQ(sm1, MD1,MD1,MQ1);
DeviceCube DQQ(sm0, MD1,MQ1,MQ1);
DeviceCube QQQ(sm1, MQ1,MQ1,MQ1);
kernels::internal::LoadB<MD1,MQ1>(D1D,Q1D,b,sB);
for (int c = 0; c < VDIM; c++)
{
kernels::internal::LoadX(e,D1D,c,x,DDD);
+12 -9
View File
@@ -21,18 +21,21 @@ namespace mfem
static void GetSigns(const FiniteElementSpace &fes, const FaceType type,
Array<bool> &signs)
{
const int dim = fes.GetMesh()->SpaceDimension();
int e1, e2;
int inf1, inf2;
const Mesh &mesh = *fes.GetMesh();
const int dim = mesh.SpaceDimension();
int face_id;
int f_ind = 0;
for (int f = 0; f < fes.GetNF(); ++f)
for (int f = 0; f < mesh.GetNumFacesWithGhost(); ++f)
{
fes.GetMesh()->GetFaceElements(f, &e1, &e2);
fes.GetMesh()->GetFaceInfos(f, &inf1, &inf2);
face_id = inf1 / 64;
if ( (type==FaceType::Interior && (e2>=0 || (e2<0 && inf2>=0))) ||
(type==FaceType::Boundary && e2<0 && inf2<0) )
Mesh::FaceInformation face = mesh.GetFaceInformation(f);
face_id = face.element[0].local_face_id;
if (face.IsNonconformingCoarse())
{
// We skip nonconforming coarse-fine faces as they are treated
// by the corresponding nonconforming fine-coarse faces.
continue;
}
else if ( face.IsOfFaceType(type) )
{
if (dim==2)
{
+1226 -536
View File
File diff suppressed because it is too large Load Diff
+665 -71
View File
@@ -41,7 +41,7 @@ protected:
const int nedofs;
Array<int> offsets;
Array<int> indices;
Array<int> gatherMap;
Array<int> gather_map;
public:
ElementRestriction(const FiniteElementSpace&, ElementDofOrdering);
@@ -172,125 +172,719 @@ class H1FaceRestriction : public FaceRestriction
{
protected:
const FiniteElementSpace &fes;
const int nf;
const int nf; // Number of faces of the requested type
const int vdim;
const bool byvdim;
const int ndofs;
const int dof;
const int nfdofs;
Array<int> scatter_indices;
Array<int> offsets;
Array<int> gather_indices;
const int face_dofs; // Number of dofs on each face
const int elem_dofs; // Number of dofs in each element
const int nfdofs; // Total number of face E-vector dofs
const int ndofs; // Total number of dofs
Array<int> scatter_indices; // Scattering indices for element 1 on each face
Array<int> gather_offsets; // offsets for the gathering indices of each dof
Array<int> gather_indices; // gathering indices for each dof
public:
/** @brief Constructor for a H1FaceRestriction.
/** @brief Construct an H1FaceRestriction.
@param[in] fes The FiniteElementSpace on which this H1FaceRestriction
operates.
@param[in] ordering The requested output ordering of the
H1FaceRestriction, either Native or Lexicographic.
@param[in] type The requested type of faces on which this operator
extracts the degrees of freedom, either Interior or
Boundary.
@param[in] fes The FiniteElementSpace on which this operates
@param[in] ordering Request a specific element ordering
@param[in] type Request internal or boundary faces dofs
@param[in] build Request the NCL2FaceRestriction to compute the
scatter/gather indices. False should only be used
when inheriting from H1FaceRestriction.
*/
H1FaceRestriction(const FiniteElementSpace& fes,
const ElementDofOrdering ordering,
const FaceType type,
bool build);
public:
/** @brief Construct an H1FaceRestriction.
@param[in] fes The FiniteElementSpace on which this operates
@param[in] ordering Request a specific element ordering
@param[in] type Request internal or boundary faces dofs */
H1FaceRestriction(const FiniteElementSpace& fes,
const ElementDofOrdering ordering,
const FaceType type);
/** @brief Extract the face degrees of freedom from @a x into @a y.
/** @brief Scatter the degrees of freedom, i.e. goes from L-Vector to
face E-Vector.
@param[in] x The L-vector of degrees of freedom.
@param[out] y The degrees of freedom on the face, corresponding to a face
E-vector.
*/
@param[in] x The L-vector degrees of freedom.
@param[out] y The face E-Vector degrees of freedom with the given format:
face_dofs x vdim x nf
where nf is the number of interior or boundary faces
requested by @a type in the constructor.
The face_dofs are ordered according to the given
ElementDofOrdering. */
void Mult(const Vector &x, Vector &y) const override;
/** @brief Add the face degrees of freedom @a x to the element degrees of
freedom @a y.
/** @brief Gather the degrees of freedom, i.e. goes from face E-Vector to
L-Vector.
@param[in] x The face degrees of freedom on the face.
@param[in,out] y The L-vector of degrees of freedom to which we add the
face degrees of freedom.
*/
@param[in] x The face E-Vector degrees of freedom with the given format:
face_dofs x vdim x nf
where nf is the number of interior or boundary faces
requested by @a type in the constructor.
The face_dofs should be ordered according to the given
ElementDofOrdering
@param[in,out] y The L-vector degrees of freedom. */
void AddMultTranspose(const Vector &x, Vector &y) const override;
private:
/** @brief Compute the scatter indices: L-vector to E-vector, and the offsets
for the gathering: E-vector to L-vector.
@param[in] ordering Request a specific element ordering.
@param[in] type Request internal or boundary faces dofs.
*/
void ComputeScatterIndicesAndOffsets(const ElementDofOrdering ordering,
const FaceType type);
/** @brief Compute the gather indices: E-vector to L-vector.
Note: Requires the gather offsets to be computed.
@param[in] ordering Request a specific element ordering.
@param[in] type Request internal or boundary faces dofs.
*/
void ComputeGatherIndices(const ElementDofOrdering ordering,
const FaceType type);
protected:
mutable Array<int> face_map; // Used in the computation of GetFaceDofs
/** @brief Verify that H1FaceRestriction is build from an H1 FESpace.
@param[in] ordering The FESpace element ordering.
*/
void CheckFESpace(const ElementDofOrdering ordering);
/** @brief Set the scattering indices of elem1, and increment the offsets for
the face described by the @a face.
@param[in] face The face information of the current face.
@param[in] face_index The interior/boundary face index.
@param[in] ordering Request a specific element ordering.
*/
void SetFaceDofsScatterIndices(const Mesh::FaceInformation &face,
const int face_index,
const ElementDofOrdering ordering);
/** @brief Set the gathering indices of elem1 for the interior face described
by the @a face.
@param[in] face The face information of the current face.
@param[in] face_index The interior/boundary face index.
@param[in] ordering Request a specific element ordering.
*/
void SetFaceDofsGatherIndices(const Mesh::FaceInformation &face,
const int face_index,
const ElementDofOrdering ordering);
};
/// Operator that extracts Face degrees of freedom on L2 FiniteElementSpaces.
/// Operator that extracts Face degrees of freedom for L2 spaces.
/** Objects of this type are typically created and owned by FiniteElementSpace
objects, see FiniteElementSpace::GetFaceRestriction(). */
class L2FaceRestriction : public FaceRestriction
{
protected:
const FiniteElementSpace &fes;
const int nf;
const int ne;
const int vdim;
const int nf; // Number of faces of the requested type
const int ne; // Number of elements
const int vdim; // vdim
const bool byvdim;
const int ndofs;
const int dof;
const int elemDofs;
const int face_dofs; // Number of dofs on each face
const int elem_dofs; // Number of dofs in each element
const int nfdofs; // Total number of dofs on the faces
const int ndofs; // Total number of dofs
const FaceType type;
const L2FaceValues m;
const int nfdofs;
Array<int> scatter_indices1;
Array<int> scatter_indices2;
Array<int> offsets;
Array<int> gather_indices;
Array<int> scatter_indices1; // Scattering indices for element 1 on each face
Array<int> scatter_indices2; // Scattering indices for element 2 on each face
Array<int> gather_offsets; // offsets for the gathering indices of each dof
Array<int> gather_indices; // gathering indices for each dof
L2FaceRestriction(const FiniteElementSpace&,
const FaceType,
const L2FaceValues m = L2FaceValues::DoubleValued);
/** @brief Constructs an L2FaceRestriction.
@param[in] fes The FiniteElementSpace on which this operates
@param[in] ordering Request a specific ordering
@param[in] type Request internal or boundary faces dofs
@param[in] m Request the face dofs for elem1, or both elem1 and
elem2
@param[in] build Request the NCL2FaceRestriction to compute the
scatter/gather indices. False should only be used
when inheriting from L2FaceRestriction.
*/
L2FaceRestriction(const FiniteElementSpace& fes,
const ElementDofOrdering ordering,
const FaceType type,
const L2FaceValues m,
bool build);
public:
L2FaceRestriction(const FiniteElementSpace&,
const ElementDofOrdering,
const FaceType,
/** @brief Constructs an L2FaceRestriction.
@param[in] fes The FiniteElementSpace on which this operates
@param[in] ordering Request a specific ordering
@param[in] type Request internal or boundary faces dofs
@param[in] m Request the face dofs for elem1, or both elem1 and
elem2 */
L2FaceRestriction(const FiniteElementSpace& fes,
const ElementDofOrdering ordering,
const FaceType type,
const L2FaceValues m = L2FaceValues::DoubleValued);
/** @brief Extract the face degrees of freedom from @a x into @a y.
/** @brief Scatter the degrees of freedom, i.e. goes from L-Vector to
face E-Vector.
@param[in] x The L-vector of degrees of freedom.
@param[out] y The degrees of freedom on the face, corresponding to a face
E-vector.
*/
@param[in] x The L-vector degrees of freedom.
@param[out] y The face E-Vector degrees of freedom with the given format:
if L2FacesValues::DoubleValued (face_dofs x vdim x 2 x nf)
if L2FacesValues::SingleValued (face_dofs x vdim x nf)
where nf is the number of interior or boundary faces
requested by @a type in the constructor.
The face_dofs are ordered according to the given
ElementDofOrdering. */
void Mult(const Vector &x, Vector &y) const override;
/** @brief Add the face degrees of freedom @a x to the element degrees of
freedom @a y.
/** @brief Gather the degrees of freedom, i.e. goes from face E-Vector to
L-Vector.
@param[in] x The face degrees of freedom on the face.
@param[in,out] y The L-vector of degrees of freedom to which we add the
face degrees of freedom.
*/
@param[in] x The face E-Vector degrees of freedom with the given format:
if L2FacesValues::DoubleValued (face_dofs x vdim x 2 x nf)
if L2FacesValues::SingleValued (face_dofs x vdim x nf)
where nf is the number of interior or boundary faces
requested by @a type in the constructor.
The face_dofs should be ordered according to the given
ElementDofOrdering
@param[in,out] y The L-vector degrees of freedom. */
void AddMultTranspose(const Vector &x, Vector &y) const override;
/** Fill the I array of SparseMatrix corresponding to the sparsity pattern
given by this L2FaceRestriction. */
/** @brief Fill the I array of SparseMatrix corresponding to the sparsity
pattern given by this L2FaceRestriction.
@param[in,out] mat The sparse matrix for which we want to initialize the
row offsets.
@param[in] keep_nbr_block When set to true the SparseMatrix will
include the rows (in addition to the columns)
corresponding to face-neighbor dofs. The
default behavior is to disregard those rows. */
virtual void FillI(SparseMatrix &mat, const bool keep_nbr_block = false) const;
/** Fill the J and Data arrays of SparseMatrix corresponding to the sparsity
pattern given by this L2FaceRestriction, and the values of ea_data. */
virtual void FillJAndData(const Vector &ea_data,
/** @brief Fill the J and Data arrays of the SparseMatrix corresponding to
the sparsity pattern given by this L2FaceRestriction, and the values of
fea_data.
@param[in] fea_data The dense matrices representing the local operators
on each face. The format is:
face_dofs x face_dofs x 2 x nf
On each face the first local matrix corresponds to
the contribution of elem1 on elem2, and the second to
the contribution of elem2 on elem1.
@param[in,out] mat The sparse matrix that is getting filled.
@param[in] keep_nbr_block When set to true the SparseMatrix will
include the rows (in addition to the columns)
corresponding to face-neighbor dofs. The
default behavior is to disregard those rows. */
virtual void FillJAndData(const Vector &fea_data,
SparseMatrix &mat,
const bool keep_nbr_block = false) const;
/// This methods adds the DG face matrices to the element matrices.
void AddFaceMatricesToElementMatrices(Vector &fea_data,
Vector &ea_data) const;
/** @brief This methods adds the DG face matrices to the element matrices.
@param[in] fea_data The dense matrices representing the local operators
on each face. The format is:
face_dofs x face_dofs x 2 x nf
On each face the first and second local matrices
correspond to the contributions of elem1 and elem2 on
themselves respectively.
@param[in,out] ea_data The dense matrices representing the element local
contributions for each element to which will be
added the face contributions.
The format is: dofs x dofs x ne, where dofs is the
number of dofs per element and ne the number of
elements. */
virtual void AddFaceMatricesToElementMatrices(const Vector &fea_data,
Vector &ea_data) const;
private:
/** @brief Compute the scatter indices: L-vector to E-vector, and the offsets
for the gathering: E-vector to L-vector.
@param[in] ordering Request a specific element ordering.
@param[in] type Request internal or boundary faces dofs.
*/
void ComputeScatterIndicesAndOffsets(const ElementDofOrdering ordering,
const FaceType type);
/** @brief Compute the gather indices: E-vector to L-vector.
Note: Requires the gather offsets to be computed.
@param[in] ordering Request a specific element ordering.
@param[in] type Request internal or boundary faces dofs.
*/
void ComputeGatherIndices(const ElementDofOrdering ordering,
const FaceType type);
protected:
mutable Array<int> face_map; // Used in the computation of GetFaceDofs
/** @brief Verify that L2FaceRestriction is build from an L2 FESpace.
@param[in] ordering The FESpace element ordering.
*/
void CheckFESpace(const ElementDofOrdering ordering);
/** @brief Set the scattering indices of elem1, and increment the offsets for
the face described by the @a face. The ordering of the face dofs of elem1
is lexicographic relative to elem1.
@param[in] face The face information of the current face.
@param[in] face_index The interior/boundary face index.
*/
void SetFaceDofsScatterIndices1(const Mesh::FaceInformation &face,
const int face_index);
/** @brief Permute and set the scattering indices of elem2, and increment the
offsets for the face described by the @a face. The permutation orders the
dofs of elem2 lexicographically as the ones of elem1.
@param[in] face The face information of the current face.
@param[in] face_index The interior/boundary face index.
*/
void PermuteAndSetFaceDofsScatterIndices2(const Mesh::FaceInformation &face,
const int face_index);
/** @brief Permute and set the scattering indices of elem2 for the shared
face described by the @a face. The permutation orders the dofs of elem2 as
the ones of elem1.
@param[in] face The face information of the current face.
@param[in] face_index The interior/boundary face index.
*/
void PermuteAndSetSharedFaceDofsScatterIndices2(
const Mesh::FaceInformation &face,
const int face_index);
/** @brief Set the scattering indices of elem2 for the boundary face
described by the @a face.
@param[in] face The face information of the current face.
@param[in] face_index The interior/boundary face index.
*/
void SetBoundaryDofsScatterIndices2(const Mesh::FaceInformation &face,
const int face_index);
/** @brief Set the gathering indices of elem1 for the interior face described
by the @a face.
Note: This function modifies the offsets.
@param[in] face The face information of the current face.
@param[in] face_index The interior/boundary face index.
*/
void SetFaceDofsGatherIndices1(const Mesh::FaceInformation &face,
const int face_index);
/** @brief Permute and set the gathering indices of elem2 for the interior
face described by the @a face. The permutation orders the dofs of elem2 as
the ones of elem1.
Note: This function modifies the offsets.
@param[in] face The face information of the current face.
@param[in] face_index The interior/boundary face index.
*/
void PermuteAndSetFaceDofsGatherIndices2(const Mesh::FaceInformation &face,
const int face_index);
public:
/** @brief Scatter the degrees of freedom, i.e. goes from L-Vector to
face E-Vector. Should only be used with conforming faces and when:
m == L2FacesValues::SingleValued
@param[in] x The L-vector degrees of freedom.
@param[out] y The face E-Vector degrees of freedom with the given format:
face_dofs x vdim x nf
where nf is the number of interior or boundary faces
requested by @a type in the constructor.
The face_dofs are ordered according to the given
ElementDofOrdering. */
void SingleValuedConformingMult(const Vector& x, Vector& y) const;
/** @brief Scatter the degrees of freedom, i.e. goes from L-Vector to
face E-Vector. Should only be used with conforming faces and when:
m == L2FacesValues::DoubleValued
@param[in] x The L-vector degrees of freedom.
@param[out] y The face E-Vector degrees of freedom with the given format:
face_dofs x vdim x 2 x nf
where nf is the number of interior or boundary faces
requested by @a type in the constructor.
The face_dofs are ordered according to the given
ElementDofOrdering. */
virtual void DoubleValuedConformingMult(const Vector& x, Vector& y) const;
/** @brief Gather the degrees of freedom, i.e. goes from face E-Vector to
L-Vector. Should only be used with conforming faces and when:
m == L2FacesValues::SingleValued
@param[in] x The face E-Vector degrees of freedom with the given format:
face_dofs x vdim x nf
where nf is the number of interior or boundary faces
requested by @a type in the constructor.
The face_dofs should be ordered according to the given
ElementDofOrdering
@param[in,out] y The L-vector degrees of freedom. */
void SingleValuedConformingAddMultTranspose(const Vector& x, Vector& y) const;
/** @brief Gather the degrees of freedom, i.e. goes from face E-Vector to
L-Vector. Should only be used with conforming faces and when:
m == L2FacesValues::DoubleValued
@param[in] x The face E-Vector degrees of freedom with the given format:
face_dofs x vdim x 2 x nf
where nf is the number of interior or boundary faces
requested by @a type in the constructor.
The face_dofs should be ordered according to the given
ElementDofOrdering
@param[in,out] y The L-vector degrees of freedom. */
void DoubleValuedConformingAddMultTranspose(const Vector& x, Vector& y) const;
};
// Return the face degrees of freedom returned in Lexicographic order.
void GetFaceDofs(const int dim, const int face_id,
const int dof1d, Array<int> &faceMap);
/** This struct stores which side is the master nonconforming side and the
index of the interpolator, see InterpolationManager class below. */
struct InterpConfig
{
uint32_t is_non_conforming : 1;
uint32_t master_side : 1;
uint32_t index : 30;
// Convert from Native ordering to lexicographic ordering
// default constructor, create a conforming face with index 0.
InterpConfig() = default;
// Non-conforming face
InterpConfig(int master_side, int nc_index)
: is_non_conforming(1), master_side(master_side), index(nc_index)
{ }
InterpConfig(const InterpConfig&) = default;
InterpConfig &operator=(const InterpConfig &rhs) = default;
};
/** @brief This class manages the storage and computation of the interpolations
from master (coarse) face to slave (fine) face.
*/
class InterpolationManager
{
protected:
const FiniteElementSpace &fes;
const ElementDofOrdering ordering;
Array<InterpConfig> interp_config; // interpolator index for each face
Vector interpolators; // face_dofs x face_dofs x num_interpolators
int nc_cpt; // Counter for interpolators, and used as index.
/** The interpolators are associated to a key of containing the address of
PointMatrix and a local face identifier. */
using Key = std::pair<const DenseMatrix*,int>;
/// The temporary map used to store the different interpolators.
using Map = std::map<Key, std::pair<int,const DenseMatrix*>>;
Map interp_map; // The temporary map that stores the interpolators.
public:
InterpolationManager() = delete;
/** @brief main constructor.
@param[in] fes The FiniteElementSpace on which this operates
@param[in] ordering Request a specific element ordering.
@param[in] type Request internal or boundary faces dofs
*/
InterpolationManager(const FiniteElementSpace &fes,
ElementDofOrdering ordering,
FaceType type);
/** @brief Register the face with @a face and index @a face_index as a
conforming face for the interpolation of the degrees of freedom.
@param[in] face The face information of the current face.
@param[in] face_index The interior/boundary face index.
*/
void RegisterFaceConformingInterpolation(const Mesh::FaceInformation &face,
int face_index);
/** @brief Register the face with @a face and index @a face_index as a
conforming face for the interpolation of the degrees of freedom.
@param[in] face The face information of the current face.
@param[in] face_index The interior/boundary face index.
*/
void RegisterFaceCoarseToFineInterpolation(const Mesh::FaceInformation &face,
int face_index);
/** @brief Transform the interpolation matrix map into a contiguous memory
structure. */
void LinearizeInterpolatorMapIntoVector();
/// @brief Return the total number of interpolators.
int GetNumInterpolators() const
{
return nc_cpt;
}
/** @brief Return an mfem::Vector containing the interpolators in the
following format: face_dofs x face_dofs x num_interpolators. */
const Vector& GetInterpolators() const
{
return interpolators;
}
/** @brief Return an array containing the interpolation configuration for
each face registered with RegisterFaceConformingInterpolation and
RegisterFaceCoarseToFineInterpolation. */
const Array<InterpConfig>& GetFaceInterpConfig() const
{
return interp_config;
}
private:
/** @brief Returns the interpolation operator from a master (coarse) face to
a slave (fine) face.
@param[in] face The face information of the current face.
@param[in] ptMat The PointMatrix describing the position and orientation
of the fine face in the coarse face. This PointMatrix is
usually obtained from the mesh through the method
GetNCFacesPtMat.
@param[in] ordering Request a specific element ordering.
@return The dense matrix corresponding to the interpolation of the face
degrees of freedom of the master (coarse) face to the slave
(fine) face. */
const DenseMatrix* GetCoarseToFineInterpolation(
const Mesh::FaceInformation &face,
const DenseMatrix* ptMat);
};
/** @brief Operator that extracts face degrees of freedom for L2 nonconforming
spaces.
In order to support face restrictions on nonconforming meshes, this
operator interpolates master (coarse) face degrees of freedom onto the
slave (fine) face. This allows face integrators to treat nonconforming
faces just as regular conforming faces. */
class NCL2FaceRestriction : virtual public L2FaceRestriction
{
protected:
InterpolationManager interpolations;
mutable Vector x_interp;
/** @brief Constructs an NCL2FaceRestriction, this is a specialization of a
L2FaceRestriction for nonconforming meshes.
@param[in] fes The FiniteElementSpace on which this operates
@param[in] ordering Request a specific ordering
@param[in] type Request internal or boundary faces dofs
@param[in] m Request the face dofs for elem1, or both elem1 and
elem2
@param[in] build Request the NCL2FaceRestriction to compute the
scatter/gather indices. False should only be used
when inheriting from NCL2FaceRestriction.
*/
NCL2FaceRestriction(const FiniteElementSpace& fes,
const ElementDofOrdering ordering,
const FaceType type,
const L2FaceValues m,
bool build);
public:
/** @brief Constructs an NCL2FaceRestriction, this is a specialization of a
L2FaceRestriction for nonconforming meshes.
@param[in] fes The FiniteElementSpace on which this operates
@param[in] ordering Request a specific ordering
@param[in] type Request internal or boundary faces dofs
@param[in] m Request the face dofs for elem1, or both elem1 and
elem2
*/
NCL2FaceRestriction(const FiniteElementSpace& fes,
const ElementDofOrdering ordering,
const FaceType type,
const L2FaceValues m = L2FaceValues::DoubleValued);
/** @brief Scatter the degrees of freedom, i.e. goes from L-Vector to
face E-Vector.
@param[in] x The L-vector degrees of freedom.
@param[out] y The face E-Vector degrees of freedom with the given format:
if L2FacesValues::DoubleValued (face_dofs x vdim x 2 x nf),
if L2FacesValues::SingleValued (face_dofs x vdim x nf),
where nf is the number of interior or boundary faces
requested by @a type in the constructor.
The face_dofs are ordered according to the given
ElementDofOrdering. */
void Mult(const Vector &x, Vector &y) const override;
/** @brief Gather the degrees of freedom, i.e. goes from face E-Vector to
L-Vector.
@param[in] x The face E-Vector degrees of freedom with the given format:
if L2FacesValues::DoubleValued (face_dofs x vdim x 2 x nf),
if L2FacesValues::SingleValued (face_dofs x vdim x nf),
where nf is the number of interior or boundary faces
requested by @a type in the constructor.
The face_dofs should be ordered according to the given
ElementDofOrdering
@param[in,out] y The L-vector degrees of freedom. */
void AddMultTranspose(const Vector &x, Vector &y) const override;
/** @brief Fill the I array of SparseMatrix corresponding to the sparsity
pattern given by this NCL2FaceRestriction.
@param[in,out] mat The sparse matrix for which we want to initialize the
row offsets.
@param[in] keep_nbr_block When set to true the SparseMatrix will
include the rows (in addition to the columns)
corresponding to face-neighbor dofs. The
default behavior is to disregard those rows.
@warning This method is not implemented yet. */
void FillI(SparseMatrix &mat,
const bool keep_nbr_block = false) const override;
/** @brief Fill the J and Data arrays of the SparseMatrix corresponding to
the sparsity pattern given by this NCL2FaceRestriction, and the values of
ea_data.
@param[in] fea_data The dense matrices representing the local operators
on each face. The format is:
face_dofs x face_dofs x 2 x nf.
On each face the first local matrix corresponds to
the contribution of elem1 on elem2, and the second to
the contribution of elem2 on elem1.
@param[in,out] mat The sparse matrix that is getting filled.
@param[in] keep_nbr_block When set to true the SparseMatrix will
include the rows (in addition to the columns)
corresponding to face-neighbor dofs. The
default behavior is to disregard those rows.
@warning This method is not implemented yet. */
void FillJAndData(const Vector &fea_data,
SparseMatrix &mat,
const bool keep_nbr_block = false) const override;
/** @brief This methods adds the DG face matrices to the element matrices.
@param[in] fea_data The dense matrices representing the local operators
on each face. The format is:
face_dofs x face_dofs x 2 x nf.
On each face the first and second local matrices
correspond to the contributions of elem1 and elem2 on
themselves respectively.
@param[in,out] ea_data The dense matrices representing the element local
contributions for each element to which will be
added the face contributions.
The format is: dofs x dofs x ne, where dofs is the
number of dofs per element and ne the number of
elements.
@warning This method is not implemented yet. */
void AddFaceMatricesToElementMatrices(const Vector &fea_data,
Vector &ea_data) const override;
private:
/** @brief Compute the scatter indices: L-vector to E-vector, the offsets
for the gathering: E-vector to L-vector, and the interpolators from
coarse to fine face for master non-comforming faces.
@param[in] ordering Request a specific element ordering.
@param[in] type Request internal or boundary faces dofs.
*/
void ComputeScatterIndicesAndOffsets(const ElementDofOrdering ordering,
const FaceType type);
/** @brief Compute the gather indices: E-vector to L-vector.
Note: Requires the gather offsets to be computed.
@param[in] ordering Request a specific element ordering.
@param[in] type Request internal or boundary faces dofs.
*/
void ComputeGatherIndices(const ElementDofOrdering ordering,
const FaceType type);
public:
/** @brief Scatter the degrees of freedom, i.e. goes from L-Vector to
face E-Vector. Should only be used with nonconforming faces and when:
L2FaceValues m == L2FaceValues::DoubleValued
@param[in] x The L-vector degrees of freedom.
@param[out] y The face E-Vector degrees of freedom with the given format:
(face_dofs x vdim x 2 x nf),
where nf is the number of interior or boundary faces
requested by @a type in the constructor.
The face_dofs are ordered according to the given
ElementDofOrdering. */
virtual void DoubleValuedNonconformingMult(const Vector& x, Vector& y) const;
/** @brief Apply a change of basis from fine element basis to coarse element
basis for the coarse face dofs. Should only be used when:
L2FaceValues m == L2FaceValues::SingleValued
@param[in] x The dofs vector that needs coarse dofs to be express in term
of the coarse basis, the result is stored in x_interp.
*/
void SingleValuedNonconformingTransposeInterpolation(const Vector& x) const;
/** @brief Apply a change of basis from fine element basis to coarse element
basis for the coarse face dofs. Should only be used when:
L2FaceValues m == L2FaceValues::DoubleValued
@param[in] x The dofs vector that needs coarse dofs to be express in term
of the coarse basis, the result is stored in x_interp.
*/
void DoubleValuedNonconformingTransposeInterpolation(const Vector& x) const;
};
/** @brief Return the face map that extracts the degrees of freedom for the
requested local face of a quad or hex, returned in Lexicographic order.
@param[in] dim The dimension of the space
@param[in] face_id The local face identifier
@param[in] dof1d The 1D number of degrees of freedom for each dimension
@param[out] face_map The map that maps each face dof to an element dof
*/
void GetFaceDofs(const int dim, const int face_id,
const int dof1d, Array<int> &face_map);
/** @brief Convert a dof face index from Native ordering to lexicographic
ordering for quads and hexes.
@param[in] dim The dimension of the element, 2 for quad, 3 for hex
@param[in] face_id The local face identifier
@param[in] size1d The 1D number of degrees of freedom for each dimension
@param[in] index The native index on the face
@return The lexicographic index on the face
*/
int ToLexOrdering(const int dim, const int face_id, const int size1d,
const int index);
// Permute dofs or quads on a face for e2 to match with the ordering of e1
/** @brief Compute the dof face index of elem2 corresponding to the given dof
face index.
@param[in] dim The dimension of the element, 2 for quad, 3 for hex
@param[in] face_id1 The local face identifier of elem1
@param[in] face_id2 The local face identifier of elem2
@param[in] orientation The orientation of elem2 relative to elem1 on the
face
@param[in] size1d The 1D number of degrees of freedom for each dimension
@param[in] index The dof index on elem1
@return The dof index on elem2 facing the dof on elem1
*/
int PermuteFaceL2(const int dim, const int face_id1,
const int face_id2, const int orientation,
const int size1d, const int index);
}
#endif //MFEM_RESTRICTION
#endif // MFEM_RESTRICTION
+4 -4
View File
@@ -284,7 +284,7 @@ void StaticCondensation::Finalize()
}
void StaticCondensation::EliminateReducedTrueDofs(
const Array<int> &ess_rtdof_list, Matrix::DiagonalPolicy dpolicy)
const Array<int> &ess_rtdof_list_, Matrix::DiagonalPolicy dpolicy)
{
if (!Parallel() || S) // not parallel or not finalized
{
@@ -292,16 +292,16 @@ void StaticCondensation::EliminateReducedTrueDofs(
{
S_e = new SparseMatrix(S->Height());
}
for (int i = 0; i < ess_rtdof_list.Size(); i++)
for (int i = 0; i < ess_rtdof_list_.Size(); i++)
{
S->EliminateRowCol(ess_rtdof_list[i], *S_e, dpolicy);
S->EliminateRowCol(ess_rtdof_list_[i], *S_e, dpolicy);
}
}
else // parallel and finalized
{
#ifdef MFEM_USE_MPI
MFEM_ASSERT(pS_e.Ptr() == NULL, "essential b.c. already eliminated");
pS_e.EliminateRowsCols(pS, ess_rtdof_list);
pS_e.EliminateRowsCols(pS, ess_rtdof_list_);
#endif
}
}
+4 -4
View File
@@ -199,14 +199,14 @@ public:
/** Restrict a list of true FE space dofs to a list of reduced/trace true FE
space dofs. */
void ConvertListToReducedTrueDofs(const Array<int> &ess_tdof_list,
Array<int> &ess_rtdof_list) const
void ConvertListToReducedTrueDofs(const Array<int> &ess_tdof_list_,
Array<int> &ess_rtdof_list_) const
{
Array<int> ess_tdof_marker, ess_rtdof_marker;
FiniteElementSpace::ListToMarker(ess_tdof_list, fes->GetTrueVSize(),
FiniteElementSpace::ListToMarker(ess_tdof_list_, fes->GetTrueVSize(),
ess_tdof_marker);
ConvertMarkerToReducedTrueDofs(ess_tdof_marker, ess_rtdof_marker);
FiniteElementSpace::MarkerToList(ess_rtdof_marker, ess_rtdof_list);
FiniteElementSpace::MarkerToList(ess_rtdof_marker, ess_rtdof_list_);
}
/** Given a solution of the reduced system 'sc_sol' and the RHS 'b' for the
+22 -22
View File
@@ -274,18 +274,18 @@ public:
{
y = 0.0;
solVecLayout_type solVecLayout(this->solVecLayout);
solFESpace solFES(this->solFES);
solVecLayout_type solVecLayoutLoc(this->solVecLayout);
solFESpace solFESLoc(this->solFES);
TTensor3<dofs,vdim,BE,vcomplex_t> xy_dof;
const int NE = mesh.GetNE();
for (int el = 0; el < NE; el += TE)
{
solFES.SetElement(el);
solFESLoc.SetElement(el);
solFES.VectorExtract(solVecLayout, x, xy_dof.layout, xy_dof);
solFES.VectorAssemble(xy_dof.layout, xy_dof, solVecLayout, y);
solFESLoc.VectorExtract(solVecLayoutLoc, x, xy_dof.layout, xy_dof);
solFESLoc.VectorAssemble(xy_dof.layout, xy_dof, solVecLayoutLoc, y);
}
}
@@ -346,8 +346,8 @@ public:
{
typedef TTensor3<dofs,vdim,BE,vcomplex_t> vdof_data_t;
solVecLayout_t solVecLayout(this->solVecLayout);
solFESpace solFES(this->solFES);
solVecLayout_t solVecLayoutLoc(this->solVecLayout);
solFESpace solFESLoc(this->solFES);
const int NE = mesh.GetNE();
// TODO: How do we make sure that this array is aligned properly, AND
@@ -358,8 +358,8 @@ public:
sx.MakeDataOwner();
for (int el = 0; el < NE; el += TE)
{
solFES.SetElement(el);
solFES.VectorExtract(solVecLayout, x, vdof_data_t::layout, vsx);
solFESLoc.SetElement(el);
solFESLoc.VectorExtract(solVecLayoutLoc, x, vdof_data_t::layout, vsx);
vsx += vdof_data_t::size;
}
}
@@ -397,9 +397,9 @@ public:
void AssembleMatrix(SparseMatrix &M) const
{
Trans_t T(mesh, meshEval);
solFESpace solFES(this->solFES);
solShapeEval solEval(this->solEval);
solVecLayout_t solVecLayout(this->solVecLayout);
solFESpace solFESLoc(this->solFES);
solShapeEval solEvalLoc(this->solEval);
solVecLayout_t solVecLayoutLoc(this->solVecLayout);
coeff_eval_t wQ(int_rule, coeff);
const int NE = mesh.GetNE();
@@ -429,12 +429,12 @@ public:
TMatrix<dofs,dofs,vcomplex_t> M_loc;
S_spec::ElementMatrix::Compute(
asm_qpt_data[k].layout, asm_qpt_data[k], M_loc.layout, M_loc,
solEval);
solEvalLoc);
solFES.SetElement(el_k);
solFESLoc.SetElement(el_k);
for (int bi = 0; bi < vdim; bi++)
{
solFES.AssembleBlock(bi, bi, solVecLayout, M_loc, M);
solFESLoc.AssembleBlock(bi, bi, solVecLayoutLoc, M_loc, M);
}
}
}
@@ -445,7 +445,7 @@ public:
void AssembleMatrix(DenseTensor &M) const
{
Trans_t T(mesh, meshEval);
solShapeEval solEval(this->solEval);
solShapeEval solEvalLoc(this->solEval);
coeff_eval_t wQ(int_rule, coeff);
const int NE = mesh.GetNE();
@@ -476,7 +476,7 @@ public:
TMatrix<dofs,dofs,vcomplex_t> M_loc;
S_spec::ElementMatrix::Compute(
asm_qpt_data[k].layout, asm_qpt_data[k], M_loc.layout, M_loc,
solEval);
solEvalLoc);
for (int s = 0; s < SS && el_k+s < NE; s++)
{
@@ -498,7 +498,7 @@ public:
void AssembleBilinearForm(BilinearForm &a) const
{
Trans_t T(mesh, meshEval);
solShapeEval solEval(this->solEval);
solShapeEval solEvalLoc(this->solEval);
coeff_eval_t wQ(int_rule, coeff);
Array<int> vdofs;
@@ -533,7 +533,7 @@ public:
TMatrix<dofs,dofs,vcomplex_t> M_loc;
S_spec::ElementMatrix::Compute(
asm_qpt_data[k].layout, asm_qpt_data[k], M_loc.layout, M_loc,
solEval);
solEvalLoc);
if (dof_map) // switch from tensor-product ordering
{
@@ -600,19 +600,19 @@ public:
// For now, when vdim > 1, assume block-diagonal matrix with the same
// diagonal block for all components.
// M is assumed to be (dof x dof x NE).
solVecLayout_t solVecLayout(this->solVecLayout);
solVecLayout_t solVecLayoutLoc(this->solVecLayout);
const int NE = mesh.GetNE();
for (int el = 0; el < NE; el++)
{
TTensor3<dofs,vdim,1,AutoSIMD<complex_t,1,1> > x_dof, y_dof;
solFES.SetElement(el);
solFES.VectorExtract(solVecLayout, x, x_dof.layout, x_dof);
solFES.VectorExtract(solVecLayoutLoc, x, x_dof.layout, x_dof);
Mult_AB<false>(TMatrix<dofs,dofs>::layout,
M(el).Data(),
x_dof.layout.merge_23(), x_dof,
y_dof.layout.merge_23(), y_dof);
solFES.VectorAssemble(y_dof.layout, y_dof, solVecLayout, y);
solFES.VectorAssemble(y_dof.layout, y_dof, solVecLayoutLoc, y);
}
}
};
+283 -271
View File
File diff suppressed because it is too large Load Diff
+31 -28
View File
@@ -1133,7 +1133,7 @@ protected:
// Evaluation of the discrete target specification on different meshes.
// Owned.
AdaptivityEvaluator *adapt_eval;
AdaptivityEvaluator *adapt_lim_eval;
void SetDiscreteTargetBase(const GridFunction &tspec_);
void SetTspecAtIndex(int idx, const GridFunction &tspec_);
@@ -1156,7 +1156,7 @@ public:
#endif
amr_el(-1), lim_min_size(-0.1),
good_tspec(false), good_tspec_grad(false), good_tspec_hess(false),
adapt_eval(NULL) { }
adapt_lim_eval(NULL) { }
virtual ~DiscreteAdaptTC();
@@ -1232,8 +1232,8 @@ public:
void SetAdaptivityEvaluator(AdaptivityEvaluator *ae)
{
if (adapt_eval) { delete adapt_eval; }
adapt_eval = ae;
if (adapt_lim_eval) { delete adapt_lim_eval; }
adapt_lim_eval = ae;
}
const Vector &GetTspecPert1H() { return tspec_pert1h; }
@@ -1315,15 +1315,15 @@ protected:
int integ_order;
// Weight Coefficient multiplying the quality metric term.
Coefficient *coeff1; // not owned, if NULL -> coeff1 is 1.
Coefficient *metric_coeff; // not owned, if NULL -> metric_coeff is 1.
// Normalization factor for the metric term.
double metric_normal;
// Nodes and weight Coefficient used for "limiting" the TMOP_Integrator.
// These are both NULL when there is no limiting.
// The class doesn't own nodes0 and coeff0.
const GridFunction *nodes0;
Coefficient *coeff0;
// The class doesn't own lim_nodes0 and lim_coeff.
const GridFunction *lim_nodes0;
Coefficient *lim_coeff;
// Limiting reference distance. Not owned.
const GridFunction *lim_dist;
// Limiting function. Owned.
@@ -1332,20 +1332,21 @@ protected:
double lim_normal;
// Adaptive limiting.
const GridFunction *zeta_0; // Not owned.
const GridFunction *adapt_lim_gf0; // Not owned.
#ifdef MFEM_USE_MPI
const ParGridFunction *pzeta_0;
const ParGridFunction *adapt_lim_pgf0;
#endif
GridFunction *zeta; // Owned. Updated by adapt_eval.
Coefficient *coeff_zeta; // Not owned.
AdaptivityEvaluator *adapt_eval; // Not owned.
GridFunction *adapt_lim_gf; // Owned. Updated by adapt_lim_eval.
Coefficient *adapt_lim_coeff; // Not owned.
AdaptivityEvaluator *adapt_lim_eval; // Not owned.
// Surface fitting.
GridFunction *sigma, *sigma_bar; // Owned. Updated by sigma_eval.
const Array<bool> *sigma_marker; // Not owned.
Coefficient *coeff_sigma; // Not owned.
AdaptivityEvaluator *sigma_eval; // Not owned.
double sigma_normal;
GridFunction *surf_fit_gf,
*surf_fit_gf_bar; // Owned, Updated by surf_fit_eval.
const Array<bool> *surf_fit_marker; // Not owned.
Coefficient *surf_fit_coeff; // Not owned.
AdaptivityEvaluator *surf_fit_eval; // Not owned.
double surf_fit_normal;
DiscreteAdaptTC *discr_tc;
@@ -1416,7 +1417,7 @@ protected:
void ComputeNormalizationEnergies(const GridFunction &x,
double &metric_energy, double &lim_energy,
double &sigma_energy);
double &surf_fit_gf_energy);
void AssembleElementVectorExact(const FiniteElement &el,
ElementTransformation &T,
@@ -1471,7 +1472,7 @@ protected:
void DisableLimiting()
{
nodes0 = NULL; coeff0 = NULL; lim_dist = NULL;
lim_nodes0 = NULL; lim_coeff = NULL; lim_dist = NULL;
delete lim_func; lim_func = NULL;
}
@@ -1531,12 +1532,14 @@ public:
TMOP_Integrator(TMOP_QualityMetric *m, TargetConstructor *tc,
TMOP_QualityMetric *hm)
: h_metric(hm), metric(m), targetC(tc), IntegRules(NULL),
integ_order(-1), coeff1(NULL), metric_normal(1.0),
nodes0(NULL), coeff0(NULL),
integ_order(-1), metric_coeff(NULL), metric_normal(1.0),
lim_nodes0(NULL), lim_coeff(NULL),
lim_dist(NULL), lim_func(NULL), lim_normal(1.0),
zeta_0(NULL), zeta(NULL), coeff_zeta(NULL), adapt_eval(NULL),
sigma(NULL), sigma_bar(NULL), sigma_marker(NULL), coeff_sigma(NULL),
sigma_eval(NULL), sigma_normal(1.0),
adapt_lim_gf0(NULL), adapt_lim_gf(NULL), adapt_lim_coeff(NULL),
adapt_lim_eval(NULL),
surf_fit_gf(NULL), surf_fit_gf_bar(NULL), surf_fit_marker(NULL),
surf_fit_coeff(NULL),
surf_fit_eval(NULL), surf_fit_normal(1.0),
discr_tc(dynamic_cast<DiscreteAdaptTC *>(tc)),
fdflag(false), dxscale(1.0e3), fd_call_flag(false), exact_action(false)
{ PA.enabled = false; }
@@ -1548,7 +1551,7 @@ public:
/// Release the device memory of large PA allocations. This will copy device
/// memory back to the host before releasing.
void ReleasePADeviceMemory();
void ReleasePADeviceMemory(bool copy_to_host = true);
/// Prescribe a set of integration rules; relevant for mixed meshes.
/** This function has priority over SetIntRule(), if both are called. */
@@ -1564,7 +1567,7 @@ public:
Note that the Coefficient is evaluated in the physical configuration and
not in the target configuration which may be undefined. */
void SetCoefficient(Coefficient &w1) { coeff1 = &w1; }
void SetCoefficient(Coefficient &w1) { metric_coeff = &w1; }
/** @brief Limiting of the mesh displacements (general version).
@@ -1631,7 +1634,7 @@ public:
void GetSurfaceFittingErrors(double &err_avg, double &err_max);
/// Update the original/reference nodes used for limiting.
void SetLimitingNodes(const GridFunction &n0) { nodes0 = &n0; }
void SetLimitingNodes(const GridFunction &n0) { lim_nodes0 = &n0; }
/** @brief Computes the integral of W(Jacobian(Trt)) over a target zone.
@param[in] el Type of FiniteElement.
+21 -21
View File
@@ -38,13 +38,13 @@ void TMOP_Integrator::AssembleGradPA(const Vector &xe,
if (PA.dim == 2)
{
AssembleGradPA_2D(xe);
if (coeff0) { AssembleGradPA_C0_2D(xe); }
if (lim_coeff) { AssembleGradPA_C0_2D(xe); }
}
if (PA.dim == 3)
{
AssembleGradPA_3D(xe);
if (coeff0) { AssembleGradPA_C0_3D(xe); }
if (lim_coeff) { AssembleGradPA_C0_3D(xe); }
}
}
@@ -53,8 +53,8 @@ void TMOP_Integrator::AssemblePA_Limiting()
const MemoryType mt = (pa_mt == MemoryType::DEFAULT) ?
Device::GetDeviceMemoryType() : pa_mt;
// Return immediately if limiting is not enabled
if (coeff0 == nullptr) { return; }
MFEM_VERIFY(nodes0, "internal error");
if (lim_coeff == nullptr) { return; }
MFEM_VERIFY(lim_nodes0, "internal error");
MFEM_VERIFY(PA.enabled, "AssemblePA_Limiting but PA is not enabled!");
MFEM_VERIFY(lim_func, "No TMOP_LimiterFunction specification!")
@@ -68,14 +68,14 @@ void TMOP_Integrator::AssemblePA_Limiting()
const ElementDofOrdering ordering = ElementDofOrdering::LEXICOGRAPHIC;
// H0 for coeff0, (dim x dim) Q-vector
// H0 for lim_coeff, (dim x dim) Q-vector
PA.H0.UseDevice(true);
PA.H0.SetSize(PA.dim * PA.dim * PA.nq * NE, mt);
// coeff0 -> PA.C0 (Q-vector)
// lim_coeff -> PA.C0 (Q-vector)
PA.C0.UseDevice(true);
if (ConstantCoefficient* cQ =
dynamic_cast<ConstantCoefficient*>(coeff0))
dynamic_cast<ConstantCoefficient*>(lim_coeff))
{
PA.C0.SetSize(1, Device::GetMemoryType());
PA.C0.HostWrite();
@@ -90,17 +90,17 @@ void TMOP_Integrator::AssemblePA_Limiting()
ElementTransformation& T = *fes->GetElementTransformation(e);
for (int q = 0; q < ir.GetNPoints(); ++q)
{
C0(q,e) = coeff0->Eval(T, ir.IntPoint(q));
C0(q,e) = lim_coeff->Eval(T, ir.IntPoint(q));
}
}
}
// nodes0 -> PA.X0 (E-vector)
MFEM_VERIFY(nodes0->FESpace() == fes, "");
// lim_nodes0 -> PA.X0 (E-vector)
MFEM_VERIFY(lim_nodes0->FESpace() == fes, "");
const Operator *n0_R = fes->GetElementRestriction(ordering);
PA.X0.SetSize(n0_R->Height(), Device::GetMemoryType());
PA.X0.UseDevice(true);
n0_R->Mult(*nodes0, PA.X0);
n0_R->Mult(*lim_nodes0, PA.X0);
// Limiting distances: lim_dist -> PA.LD (E-vector)
// TODO: remove the hack for the case lim_dist == NULL.
@@ -217,8 +217,8 @@ void TMOP_Integrator::AssemblePA(const FiniteElementSpace &fes)
PA.Jtr_needs_update = true;
PA.Jtr_debug_grad = false;
// Limiting: coeff0 -> PA.C0, nodes0 -> PA.X0, lim_dist -> PA.LD, PA.H0
if (coeff0) { AssemblePA_Limiting(); }
// Limiting: lim_coeff -> PA.C0, lim_nodes0 -> PA.X0, lim_dist -> PA.LD, PA.H0
if (lim_coeff) { AssemblePA_Limiting(); }
}
void TMOP_Integrator::AssembleGradDiagonalPA(Vector &de) const
@@ -236,13 +236,13 @@ void TMOP_Integrator::AssembleGradDiagonalPA(Vector &de) const
if (PA.dim == 2)
{
AssembleDiagonalPA_2D(de);
if (coeff0) { AssembleDiagonalPA_C0_2D(de); }
if (lim_coeff) { AssembleDiagonalPA_C0_2D(de); }
}
if (PA.dim == 3)
{
AssembleDiagonalPA_3D(de);
if (coeff0) { AssembleDiagonalPA_C0_3D(de); }
if (lim_coeff) { AssembleDiagonalPA_C0_3D(de); }
}
}
@@ -258,13 +258,13 @@ void TMOP_Integrator::AddMultPA(const Vector &xe, Vector &ye) const
if (PA.dim == 2)
{
AddMultPA_2D(xe,ye);
if (coeff0) { AddMultPA_C0_2D(xe,ye); }
if (lim_coeff) { AddMultPA_C0_2D(xe,ye); }
}
if (PA.dim == 3)
{
AddMultPA_3D(xe,ye);
if (coeff0) { AddMultPA_C0_3D(xe,ye); }
if (lim_coeff) { AddMultPA_C0_3D(xe,ye); }
}
}
@@ -283,13 +283,13 @@ void TMOP_Integrator::AddMultGradPA(const Vector &re, Vector &ce) const
if (PA.dim == 2)
{
AddMultGradPA_2D(re,ce);
if (coeff0) { AddMultGradPA_C0_2D(re,ce); }
if (lim_coeff) { AddMultGradPA_C0_2D(re,ce); }
}
if (PA.dim == 3)
{
AddMultGradPA_3D(re,ce);
if (coeff0) { AddMultGradPA_C0_3D(re,ce); }
if (lim_coeff) { AddMultGradPA_C0_3D(re,ce); }
}
}
@@ -307,13 +307,13 @@ double TMOP_Integrator::GetLocalStateEnergyPA(const Vector &xe) const
if (PA.dim == 2)
{
energy = GetLocalStateEnergyPA_2D(xe);
if (coeff0) { energy += GetLocalStateEnergyPA_C0_2D(xe); }
if (lim_coeff) { energy += GetLocalStateEnergyPA_C0_2D(xe); }
}
if (PA.dim == 3)
{
energy = GetLocalStateEnergyPA_3D(xe);
if (coeff0) { energy += GetLocalStateEnergyPA_C0_3D(xe); }
if (lim_coeff) { energy += GetLocalStateEnergyPA_C0_3D(xe); }
}
return energy;
+3 -3
View File
@@ -181,9 +181,9 @@ template<int T_D1D, int T_Q1D, int T_MAX> return_t kernel(__VA_ARGS__)
if (K##kernel.Find(id)) { return K##kernel.At(id)(__VA_ARGS__,0,0); }\
else {\
constexpr int T_MAX = 4;\
const int D1D = (id>>4)&0xF, Q1D = id&0xF;\
MFEM_VERIFY(D1D <= MAX_D1D && Q1D <= MAX_Q1D, "Max size error!");\
return kernel<0,0,T_MAX>(__VA_ARGS__,D1D,Q1D); }
const int d1d = (id>>4)&0xF, q1d = id&0xF;\
MFEM_VERIFY(d1d <= MAX_D1D && q1d <= MAX_Q1D, "Max size error!");\
return kernel<0,0,T_MAX>(__VA_ARGS__,d1d,q1d); }
} // namespace kernels
+2 -1
View File
@@ -55,6 +55,8 @@ MFEM_REGISTER_TMOP_KERNELS(void, DatcSize,
MFEM_SHARED double sm0[MDQ*MDQ*MDQ];
MFEM_SHARED double sm1[MDQ*MDQ*MDQ];
kernels::internal::LoadB<MD1,MQ1>(D1D,Q1D,b,sB);
ConstDeviceMatrix B(sB, D1D, Q1D);
DeviceCube DDD(sm0, MD1,MD1,MD1);
DeviceCube DDQ(sm1, MD1,MD1,MQ1);
@@ -88,7 +90,6 @@ MFEM_REGISTER_TMOP_KERNELS(void, DatcSize,
}
min = min_size[0];
kernels::internal::LoadB<MD1,MQ1>(D1D,Q1D,b,sB);
kernels::internal::EvalX(D1D,Q1D,B,DDD,DDQ);
kernels::internal::EvalY(D1D,Q1D,B,DDQ,DQQ);
kernels::internal::EvalZ(D1D,Q1D,B,DQQ,QQQ);
+3 -3
View File
@@ -97,9 +97,9 @@ MFEM_REGISTER_TMOP_KERNELS(void, AssembleDiagonalPA_Kernel_2D,
const double *Jtr = &J(0,0,qx,qy,e);
// Jrt = Jtr^{-1}
double j[4];
ConstDeviceMatrix Jrt(j,2,2);
kernels::CalcInverse<2>(Jtr, j);
double jrt_data[4];
ConstDeviceMatrix Jrt(jrt_data,2,2);
kernels::CalcInverse<2>(Jtr, jrt_data);
const double gg = G(qy,dy) * G(qy,dy);
const double gb = G(qy,dy) * B(qy,dy);
+4 -4
View File
@@ -68,8 +68,8 @@ MFEM_REGISTER_TMOP_KERNELS(void, AddMultGradPA_Kernel_C0_2D,
double Xh[2];
kernels::internal::PullEval<MQ1,NBZ>(Q1D,qx,qy,QQ,Xh);
double B[4];
DeviceMatrix H(B,2,2);
double H_data[4];
DeviceMatrix H(H_data,2,2);
for (int i = 0; i < DIM; i++)
{
for (int j = 0; j < DIM; j++)
@@ -78,9 +78,9 @@ MFEM_REGISTER_TMOP_KERNELS(void, AddMultGradPA_Kernel_C0_2D,
}
}
// p2 = B . Xh
// p2 = H . Xh
double p2[2];
kernels::Mult(2,2,B,Xh,p2);
kernels::Mult(2,2,H_data,Xh,p2);
kernels::internal::PushEval<MQ1,NBZ>(Q1D,qx,qy,p2,QQ);
}
}
+4 -4
View File
@@ -70,8 +70,8 @@ MFEM_REGISTER_TMOP_KERNELS(void, AddMultGradPA_Kernel_C0_3D,
double Xh[3];
kernels::internal::PullEval<MQ1>(Q1D,qx,qy,qz,QQQ,Xh);
double B[9];
DeviceMatrix H(B,3,3);
double H_data[9];
DeviceMatrix H(H_data,3,3);
for (int i = 0; i < DIM; i++)
{
for (int j = 0; j < DIM; j++)
@@ -80,9 +80,9 @@ MFEM_REGISTER_TMOP_KERNELS(void, AddMultGradPA_Kernel_C0_3D,
}
}
// p2 = B . Xh
// p2 = H . Xh
double p2[3];
kernels::Mult(3,3,B,Xh,p2);
kernels::Mult(3,3,H_data,Xh,p2);
kernels::internal::PushEval<MQ1>(Q1D,qx,qy,qz,p2,QQQ);
}
}
+1 -2
View File
@@ -55,6 +55,7 @@ MFEM_REGISTER_TMOP_KERNELS(void, SetupGradPA_Kernel_C0_3D,
constexpr int MDQ = (MQ1 > MD1) ? MQ1 : MD1;
MFEM_SHARED double sBLD[MQ1*MD1];
kernels::internal::LoadB<MD1,MQ1>(D1D,Q1D,bld,sBLD);
ConstDeviceMatrix BLD(sBLD, D1D, Q1D);
MFEM_SHARED double sm0[MDQ*MDQ*MDQ];
@@ -66,8 +67,6 @@ MFEM_REGISTER_TMOP_KERNELS(void, SetupGradPA_Kernel_C0_3D,
kernels::internal::LoadX(e,D1D,LD,DDD);
kernels::internal::LoadB<MD1,MQ1>(D1D,Q1D,bld,sBLD);
kernels::internal::EvalX(D1D,Q1D,BLD,DDD,DDQ);
kernels::internal::EvalY(D1D,Q1D,BLD,DDQ,DQQ);
kernels::internal::EvalZ(D1D,Q1D,BLD,DQQ,QQQ);
+1 -1
View File
@@ -62,6 +62,7 @@ MFEM_REGISTER_TMOP_KERNELS(void, AddMultPA_Kernel_C0_3D,
MFEM_SHARED double B[MQ1*MD1];
MFEM_SHARED double sBLD[MQ1*MD1];
kernels::internal::LoadB<MD1,MQ1>(D1D,Q1D,bld,sBLD);
ConstDeviceMatrix BLD(sBLD, D1D, Q1D);
MFEM_SHARED double sm0[MDQ*MDQ*MDQ];
@@ -86,7 +87,6 @@ MFEM_REGISTER_TMOP_KERNELS(void, AddMultPA_Kernel_C0_3D,
kernels::internal::LoadX<MD1>(e,D1D,X1,DDD1);
kernels::internal::LoadB<MD1,MQ1>(D1D,Q1D,b,B);
kernels::internal::LoadB<MD1,MQ1>(D1D,Q1D,bld,sBLD);
kernels::internal::EvalX(D1D,Q1D,BLD,DDD,DDQ);
kernels::internal::EvalY(D1D,Q1D,BLD,DDQ,DQQ);
+1 -1
View File
@@ -63,6 +63,7 @@ MFEM_REGISTER_TMOP_KERNELS(double, EnergyPA_C0_3D,
MFEM_SHARED double B[MQ1*MD1];
MFEM_SHARED double sBLD[MQ1*MD1];
kernels::internal::LoadB<MD1,MQ1>(D1D,Q1D,bld,sBLD);
ConstDeviceMatrix BLD(sBLD, D1D, Q1D);
MFEM_SHARED double sm0[MDQ*MDQ*MDQ];
@@ -87,7 +88,6 @@ MFEM_REGISTER_TMOP_KERNELS(double, EnergyPA_C0_3D,
kernels::internal::LoadX<MD1>(e,D1D,X1,DDD1);
kernels::internal::LoadB<MD1,MQ1>(D1D,Q1D,b,B);
kernels::internal::LoadB<MD1,MQ1>(D1D,Q1D,bld,sBLD);
kernels::internal::EvalX(D1D,Q1D,BLD,DDD,DDQ);
kernels::internal::EvalY(D1D,Q1D,BLD,DDQ,DQQ);
+10 -10
View File
@@ -837,26 +837,26 @@ void TMOPHRSolver::ParUpdate()
}
#endif
void TMOPHRSolver::UpdateNonlinearFormAndBC(Mesh *mesh, NonlinearForm *nlf)
void TMOPHRSolver::UpdateNonlinearFormAndBC(Mesh *mesh_, NonlinearForm *nlf_)
{
const FiniteElementSpace &fes = *mesh->GetNodalFESpace();
const FiniteElementSpace &fes = *mesh_->GetNodalFESpace();
// Update Nonlinear form and Set Essential BC
nlf->Update();
nlf_->Update();
const int dim = fes.GetFE(0)->GetDim();
if (move_bnd == false)
{
Array<int> ess_bdr(mesh->bdr_attributes.Max());
Array<int> ess_bdr(mesh_->bdr_attributes.Max());
ess_bdr = 1;
nlf->SetEssentialBC(ess_bdr);
nlf_->SetEssentialBC(ess_bdr);
}
else
{
const int nd = fes.GetBE(0)->GetDof();
int n = 0;
for (int i = 0; i < mesh->GetNBE(); i++)
for (int i = 0; i < mesh_->GetNBE(); i++)
{
const int attr = mesh->GetBdrElement(i)->GetAttribute();
const int attr = mesh_->GetBdrElement(i)->GetAttribute();
MFEM_VERIFY(!(dim == 2 && attr == 3),
"Boundary attribute 3 must be used only for 3D meshes. "
"Adjust the attributes (1/2/3/4 for fixed x/y/z/all "
@@ -866,9 +866,9 @@ void TMOPHRSolver::UpdateNonlinearFormAndBC(Mesh *mesh, NonlinearForm *nlf)
}
Array<int> ess_vdofs(n), vdofs;
n = 0;
for (int i = 0; i < mesh->GetNBE(); i++)
for (int i = 0; i < mesh_->GetNBE(); i++)
{
const int attr = mesh->GetBdrElement(i)->GetAttribute();
const int attr = mesh_->GetBdrElement(i)->GetAttribute();
fes.GetBdrElementVDofs(i, vdofs);
if (attr == 1) // Fix x components.
{
@@ -891,7 +891,7 @@ void TMOPHRSolver::UpdateNonlinearFormAndBC(Mesh *mesh, NonlinearForm *nlf)
{ ess_vdofs[n++] = vdofs[j]; }
}
}
nlf->SetEssentialVDofs(ess_vdofs);
nlf_->SetEssentialVDofs(ess_vdofs);
}
}
+16 -10
View File
@@ -444,15 +444,19 @@ double TMOPNewtonSolver::ComputeScalingFactor(const Vector &x,
if (untangling == false && min_detT_out < 0.0)
{
// No untangling, and detJ got negative -- no good.
if (print_level >= 0)
{ mfem::out << "Scale = " << scale << " Neg det(J) found.\n"; }
if (print_options.iterations)
{
mfem::out << "Scale = " << scale << " Neg det(J) found.\n";
}
scale *= detJ_factor; continue;
}
if (untangling == true && min_detT_out < *min_det_ptr)
{
// Untangling, and detJ got even more negative -- no good.
if (print_level >= 0)
{ mfem::out << "Scale = " << scale << " Neg det(J) decreased.\n"; }
if (print_options.iterations)
{
mfem::out << "Scale = " << scale << " Neg det(J) decreased.\n";
}
scale *= detJ_factor; continue;
}
@@ -477,7 +481,7 @@ double TMOPNewtonSolver::ComputeScalingFactor(const Vector &x,
if (energy_out > energy_in + 0.2*fabs(energy_in) ||
std::isnan(energy_out) != 0)
{
if (print_level >= 0)
if (print_options.iterations)
{
mfem::out << "Scale = " << scale << " Increasing energy: "
<< energy_in << " --> " << energy_out << '\n';
@@ -492,7 +496,7 @@ double TMOPNewtonSolver::ComputeScalingFactor(const Vector &x,
if (norm_out > 1.2*norm_in)
{
if (print_level >= 0)
if (print_options.iterations)
{
mfem::out << "Scale = " << scale << " Norm increased: "
<< norm_in << " --> " << norm_out << '\n';
@@ -508,13 +512,15 @@ double TMOPNewtonSolver::ComputeScalingFactor(const Vector &x,
if (min_detT_out > 0.0)
{
*min_det_ptr = 0.0;
if (print_level >= 0)
if (print_options.summary || print_options.iterations ||
print_options.first_and_last)
{ mfem::out << "The mesh has been untangled at the used points!\n"; }
}
else { *min_det_ptr = untangle_factor * min_detT_out; }
}
if (print_level >= 0)
if (print_options.summary || print_options.iterations ||
print_options.first_and_last)
{
if (untangling)
{
@@ -568,9 +574,9 @@ void TMOPNewtonSolver::ProcessNewState(const Vector &x) const
if (parallel)
{
#ifdef MFEM_USE_MPI
const ParNonlinearForm *nlf =
const ParNonlinearForm *pnlf =
dynamic_cast<const ParNonlinearForm *>(oper);
const ParFiniteElementSpace *pfesc = nlf->ParFESpace();
const ParFiniteElementSpace *pfesc = pnlf->ParFESpace();
Vector x_loc(pfesc->GetVSize());
pfesc->GetProlongationMatrix()->Mult(x, x_loc);
for (int i = 0; i < integs.Size(); i++)
+61 -17
View File
@@ -903,7 +903,8 @@ TransferOperator::TransferOperator(const FiniteElementSpace& lFESpace_,
const FiniteElementSpace& hFESpace_)
: Operator(hFESpace_.GetVSize(), lFESpace_.GetVSize())
{
if (lFESpace_.FEColl() == hFESpace_.FEColl())
bool isvar_order = lFESpace_.IsVariableOrder() || hFESpace_.IsVariableOrder();
if (lFESpace_.FEColl() == hFESpace_.FEColl() && !isvar_order)
{
OperatorPtr P(Operator::ANY_TYPE);
hFESpace_.GetTransferOperator(lFESpace_, P);
@@ -912,8 +913,11 @@ TransferOperator::TransferOperator(const FiniteElementSpace& lFESpace_,
}
else if (lFESpace_.GetMesh()->GetNE() > 0
&& hFESpace_.GetMesh()->GetNE() > 0
&& lFESpace_.GetVDim() == 1
&& hFESpace_.GetVDim() == 1
&& dynamic_cast<const TensorBasisElement*>(lFESpace_.GetFE(0))
&& dynamic_cast<const TensorBasisElement*>(hFESpace_.GetFE(0))
&& !isvar_order
&& (hFESpace_.FEColl()->GetContType() ==
mfem::FiniteElementCollection::CONTINUOUS ||
hFESpace_.FEColl()->GetContType() ==
@@ -945,6 +949,7 @@ PRefinementTransferOperator::PRefinementTransferOperator(
: Operator(hFESpace_.GetVSize(), lFESpace_.GetVSize()), lFESpace(lFESpace_),
hFESpace(hFESpace_)
{
isvar_order = lFESpace_.IsVariableOrder() || hFESpace_.IsVariableOrder();
}
PRefinementTransferOperator::~PRefinementTransferOperator() {}
@@ -969,7 +974,7 @@ void PRefinementTransferOperator::Mult(const Vector& x, Vector& y) const
DofTransformation * doftrans_l = lFESpace.GetElementDofs(i, l_dofs);
const Geometry::Type geom = mesh->GetElementBaseGeometry(i);
if (geom != cached_geom)
if (geom != cached_geom || isvar_order)
{
h_fe = hFESpace.GetFE(i);
l_fe = lFESpace.GetFE(i);
@@ -1026,7 +1031,7 @@ void PRefinementTransferOperator::MultTranspose(const Vector& x,
DofTransformation * doftrans_l = lFESpace.GetElementDofs(i, l_dofs);
const Geometry::Type geom = mesh->GetElementBaseGeometry(i);
if (geom != cached_geom)
if (geom != cached_geom || isvar_order)
{
h_fe = hFESpace.GetFE(i);
l_fe = lFESpace.GetFE(i);
@@ -1424,20 +1429,36 @@ void TensorProductPRefinementTransferOperator::MultTranspose(const Vector& x,
elem_restrict_lex_l->MultTranspose(localL, y);
}
#ifdef MFEM_USE_MPI
TrueTransferOperator::TrueTransferOperator(const
ParFiniteElementSpace& lFESpace_,
const ParFiniteElementSpace& hFESpace_)
TrueTransferOperator::TrueTransferOperator(const FiniteElementSpace& lFESpace_,
const FiniteElementSpace& hFESpace_)
: Operator(hFESpace_.GetTrueVSize(), lFESpace_.GetTrueVSize()),
lFESpace(lFESpace_),
hFESpace(hFESpace_)
{
localTransferOperator = new TransferOperator(lFESpace_, hFESpace_);
tmpL.SetSize(lFESpace_.GetVSize());
tmpH.SetSize(hFESpace_.GetVSize());
P = lFESpace.GetProlongationMatrix();
R = hFESpace.IsVariableOrder() ? hFESpace.GetHpRestrictionMatrix() :
hFESpace.GetRestrictionMatrix();
hFESpace.GetRestrictionMatrix()->BuildTranspose();
// P and R can be both null
// P can be null and R not null
// If P is not null it is assumed that R is not null as well
if (P) { MFEM_VERIFY(R, "Both P and R have to be not NULL") }
if (P)
{
tmpL.SetSize(lFESpace_.GetVSize());
tmpH.SetSize(hFESpace_.GetVSize());
R->EnsureMultTranspose();
}
// P can be null and R not null
else if (R)
{
tmpH.SetSize(hFESpace_.GetVSize());
R->EnsureMultTranspose();
}
}
TrueTransferOperator::~TrueTransferOperator()
@@ -1447,17 +1468,40 @@ TrueTransferOperator::~TrueTransferOperator()
void TrueTransferOperator::Mult(const Vector& x, Vector& y) const
{
lFESpace.GetProlongationMatrix()->Mult(x, tmpL);
localTransferOperator->Mult(tmpL, tmpH);
hFESpace.GetRestrictionMatrix()->Mult(tmpH, y);
if (P)
{
P->Mult(x, tmpL);
localTransferOperator->Mult(tmpL, tmpH);
R->Mult(tmpH, y);
}
else if (R)
{
localTransferOperator->Mult(x, tmpH);
R->Mult(tmpH, y);
}
else
{
localTransferOperator->Mult(x, y);
}
}
void TrueTransferOperator::MultTranspose(const Vector& x, Vector& y) const
{
hFESpace.GetRestrictionMatrix()->MultTranspose(x, tmpH);
localTransferOperator->MultTranspose(tmpH, tmpL);
lFESpace.GetProlongationMatrix()->MultTranspose(tmpL, y);
if (P)
{
R->MultTranspose(x, tmpH);
localTransferOperator->MultTranspose(tmpH, tmpL);
P->MultTranspose(tmpL, y);
}
else if (R)
{
R->MultTranspose(x, tmpH);
localTransferOperator->MultTranspose(tmpH, y);
}
else
{
localTransferOperator->MultTranspose(x, y);
}
}
#endif
} // namespace mfem

Some files were not shown because too many files have changed in this diff Show More