Optimizations for quadrature representations of finite element tensors through automated code generation

From MaRDI portal
Publication:2989090

DOI10.1145/1644001.1644009zbMATH Open1364.65063arXiv1104.0199OpenAlexW1979836673WikidataQ113310512 ScholiaQ113310512MaRDI QIDQ2989090FDOQ2989090


Authors: Kristian B. Ølgaard, Garth N. Wells Edit this on Wikidata


Publication date: 19 May 2017

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

Abstract: We examine aspects of the computation of finite element matrices and vectors which are made possible by automated code generation. Given a variational form in a syntax which resembles standard mathematical notation, the low-level computer code for building finite element tensors, typically matrices, vectors and scalars, can be generated automatically via a form compiler. In particular, the generation of code for computing finite element matrices using a quadrature approach is addressed. For quadrature representations, a number of optimisation strategies which are made possible by automated code generation are presented. The relative performance of two different automatically generated representations of finite element matrices is examined, with a particular emphasis on complicated variational forms. It is shown that approaches which perform best for simple forms are not tractable for more complicated problems in terms of run time performance, the time required to generate the code or the size of the generated code. The approach and optimisations elaborated here are effective for a range of variational forms.


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




Recommendations





Cited In (23)





This page was built for publication: Optimizations for quadrature representations of finite element tensors through automated code generation

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