Efficient compilation of a class of variational forms

DOI10.1145/1268769.1268771MaRDI QIDQ3549178zbMATH OpenOpenAlexWikidataFDO

Authors Robert C. Kirby, Anders Logg

Publication date 21 December 2008

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

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

Mathematics Subject Classification ID

Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30)

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.

Cited in

(5)

• Automating the finite element method
• Automated FEM discretizations for the Stokes equation
• A general approach to transforming finite elements
• ConvPDE-UQ: convolutional neural networks with quantified uncertainty for heterogeneous elliptic partial differential equations on varied domains
• TSFC: A Structure-Preserving Form Compiler

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)