Efficient Compilation of a Class of Variational Forms
arXiv:1205.3014 · doi:10.1145/1268769.1268771
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.
ACM Transactions on Mathematical Software 33(3), 20 pages (2007)
References in corpus (3)
Cited by in corpus (11)
- Automated derivation of the adjoint of high-level transient finite element programs
- Optimisations for quadrature representations of finite element tensors through automated code generation
- Automating the Finite Element Method
- TSFC: a structure-preserving form compiler
- Automated code generation for discontinuous Galerkin methods
- A FEniCS-Based Programming Framework for Modeling Turbulent Flow by the Reynolds-Averaged Navier-Stokes Equations
- An algorithm for the optimization of finite element integration loops
- Benchmarking Domain-Specific Compiler Optimizations for Variational Forms
- Algorithms and Data Structures for Multi-Adaptive Time-Stepping
- Quasi-3D Thermal Simulation of Quench Propagation in Superconducting Magnets
- Quasi-3D Magneto-Thermal Quench Simulation Scheme for Superconducting Accelerator Magnets