Discontinuous Galerkin method on three-dimensional tetrahedral grids. The use of template metaprogramming of the C++ language


如何引用文章

全文:

开放存取 开放存取
受限制的访问 ##reader.subscriptionAccessGranted##
受限制的访问 订阅存取

详细

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.

作者简介

M. Krasnov

Keldysh Institute for Applied Mathematics

编辑信件的主要联系方式.
Email: kmm@kiam.ru
俄罗斯联邦, Miusskaya pl., 4, Moscow, 125047

M. Ladonkina

Keldysh Institute for Applied Mathematics

Email: kmm@kiam.ru
俄罗斯联邦, Miusskaya pl., 4, Moscow, 125047

补充文件

附件文件
动作
1. JATS XML

版权所有 © Pleiades Publishing, Ltd., 2017