Discontinuous Galerkin method on three-dimensional tetrahedral grids. The use of template metaprogramming of the C++ language
| Autor: | M. M. Krasnov, Marina E. Ladonkina |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
Speedup
Computational complexity theory Computer science Computation 010102 general mathematics 020207 software engineering 02 engineering and technology 01 natural sciences Computational science Expression templates Reduction (complexity) Template Discontinuous Galerkin method 0202 electrical engineering electronic engineering information engineering Template metaprogramming 0101 mathematics Algorithm Software |
| Zdroj: | Programming and Computer Software. 43:172-183 |
| ISSN: | 1608-3261 0361-7688 |
| DOI: | 10.1134/s0361768817030082 |
| Popis: | Many mathematical physics problems have great computational complexity, especially when they are solved on large-scale three-dimensional grids. The discontinuous Galerkin method is just an example of this kind. Therefore, reduction of the amount of computation is very a topical task. One of the possible ways to reduce the amount of computation is to move some of the computations to the compilation stage. With the appearance of templates, C++ provides such an opportunity. The paper demonstrates the use of template metaprogramming to speed up computations in the discontinuous Galerkin method. In addition, template metaprogramming sometimes simplifies the algorithm at the expense of its generalization. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink