To the top

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

Tell a friend about this page
Print version

Benchmarking domain-speci… - University of Gothenburg, Sweden Till startsida
To content Read more about how we use cookies on

Benchmarking domain-specific compiler optimizations for variational forms

Journal article
Authors R.C. Kirby
Anders Logg
Published in ACM Transactions on Mathematical Software
Volume 35
Issue 2
ISSN 0098-3500
Publication year 2008
Published at Department of Mathematical Sciences, Mathematics
Language en
Keywords Compiler , Complexity-reducing relations , FErari , FFC , Finite element method , Optimization , Variational form
Subject categories Mathematics, Computational Mathematics


We examine the effect of using complexity-reducing relations [Kirby et al. 2006] to generate optimized code for the evaluation of finite-element variational forms. The optimizations are implemented in a prototype code named FErari, which has been integrated as an optimizing backend to the FEniCS form compiler, FFC [Kirby and Logg 2006; 2007]. In some cases, FErari provides very little speedup, while in other cases we obtain reduced local operation counts by a factor of as much as 7.9 and speedups for the assembly of the global sparse matrix by as much as a factor of 2.8 (see Figure 9). © 2008 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?