Efficient compilation of a class of variational forms
From MaRDI portal
Publication:3549178
DOI10.1145/1268769.1268771zbMATH Open1365.65257arXiv1205.3014OpenAlexW3124077114WikidataQ113310652 ScholiaQ113310652MaRDI QIDQ3549178FDOQ3549178
Authors: Robert C. Kirby, Anders Logg 
Publication date: 21 December 2008
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Abstract: We investigate the compilation of general multilinear variational forms over affines simplices and prove a representation theorem for the representation of the element tensor (element stiffness matrix) as the contraction of a constant reference tensor and a geometry tensor that accounts for geometry and variable coefficients. Based on this representation theorem, we design an algorithm for efficient pretabulation of the reference tensor. The new algorithm has been implemented in the FEniCS Form Compiler (FFC) and improves on a previous loop-based implementation by several orders of magnitude, thus shortening compile-times and development cycles for users of FFC.
Full work available at URL: https://arxiv.org/abs/1205.3014
Cited In (5)
- TSFC: A Structure-Preserving Form Compiler
- Automating the finite element method
- A general approach to transforming finite elements
- ConvPDE-UQ: convolutional neural networks with quantified uncertainty for heterogeneous elliptic partial differential equations on varied domains
- Automated FEM discretizations for the Stokes equation
This page was built for publication: Efficient compilation of a class of variational forms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549178)
