We examine the effect of using complexity-reducing relations 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. In some cases, FErari provides very little speedup, while in other cases, we obtain reduced local operation counts of a factor of as much as 7.9 and speedups for the assembly of the global sparse matrix of as much as a factor of 2.8.
@article{arxiv.1205.3027,
title = {Benchmarking Domain-Specific Compiler Optimizations for Variational Forms},
author = {Robert C. Kirby and Anders Logg},
journal= {arXiv preprint arXiv:1205.3027},
year = {2012}
}
Comments
ACM Transactions on Mathematical Software 35(2), 18 pages (2008)