Imperial College London
Portrait Picture

ProfessorDavidHam

Faculty of Natural Sciences, Department of Mathematics

Professor of Computational Mathematics
 
 
 
//

Contact

 

+44 (0)20 7594 5003david.ham Website CV

 
 
//

Location

 

753Huxley BuildingSouth Kensington Campus

//

Summary

 

Publications

Citation

BibTex format

@article{Homolya:2018,
author = {Homolya, M and Mitchell, L and Luporini, F and Ham, DA},
journal = {SIAM Journal on Scientific Computing},
title = {TSFC: a structure-preserving form compiler},
url = {http://arxiv.org/abs/1705.03667v1},
year = {2018}
}
Download

RIS format (EndNote, RefMan)

TY  - JOUR
AB  - A form compiler takes a high-level description of the weak form of partialdifferential equations and produces low-level code that carries out the finiteelement assembly. In this paper we present the Two-Stage Form Compiler (TSFC),a new form compiler with the main motivation to maintain the structure of theinput expression as long as possible. This facilitates the application ofoptimizations at the highest possible level of abstraction. TSFC features anovel, structure-preserving method for separating the contributions of a formto the subblocks of the local tensor in discontinuous Galerkin problems. Thisenables us to preserve the tensor structure of expressions longer through thecompilation process than other form compilers. This is also achieved in part bya two-stage approach that cleanly separates the lowering of finite elementconstructs to tensor algebra in the first stage, from the scheduling of thosetensor operations in the second stage. TSFC also efficiently traversescomplicated expressions, and experimental evaluation demonstrates goodcompile-time performance even for highly complex forms.
AU  - Homolya,M
AU  - Mitchell,L
AU  - Luporini,F
AU  - Ham,DA
PY  - 2018///
SN  - 1064-8275
TI  - TSFC: a structure-preserving form compiler
T2  - SIAM Journal on Scientific Computing
UR  - http://arxiv.org/abs/1705.03667v1
UR  - http://hdl.handle.net/10044/1/53434
ER  -
Download