An algorithm for the optimization of finite element integration loops

From MaRDI portal
Publication:3133595

DOI10.1145/3054944zbMATH Open1380.65381arXiv1604.05872OpenAlexW3121682852WikidataQ113310139 ScholiaQ113310139MaRDI QIDQ3133595FDOQ3133595

Paul H. J. Kelly, Fabio Luporini, D. A. Ham

Publication date: 5 February 2018

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Abstract: We present an algorithm for the optimization of a class of finite element integration loop nests. This algorithm, which exploits fundamental mathematical properties of finite element operators, is proven to achieve a locally optimal operation count. In specified circumstances the optimum achieved is global. Extensive numerical experiments demonstrate significant performance improvements over the state of the art in finite element code generation in almost all cases. This validates the effectiveness of the algorithm presented here, and illustrates its limitations.


Full work available at URL: https://arxiv.org/abs/1604.05872




Recommendations





Cited In (18)

Uses Software





This page was built for publication: An algorithm for the optimization of finite element integration loops

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3133595)