To the top

Page Manager: Webmaster
Last update: 9/11/2012 3:13 PM

Tell a friend about this page
Print version

Efficient compilation of … - University of Gothenburg, Sweden Till startsida
To content Read more about how we use cookies on

Efficient compilation of a class of variational forms

Journal article
Authors R.C. Kirby
Anders Logg
Published in ACM Transactions on Mathematical Software
Volume 33
Issue 3
ISSN 0098-3500
Publication year 2007
Published at Department of Mathematical Sciences, Mathematics
Language en
Keywords Automation , BLAS , Compiler , Finite element , Granularity , Loop hoisting , Monomials , Variational form
Subject categories Mathematics, Computational Mathematics


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. © 2007 ACM.

Page Manager: Webmaster|Last update: 9/11/2012

The University of Gothenburg uses cookies to provide you with the best possible user experience. By continuing on this website, you approve of our use of cookies.  What are cookies?