This article describes haggies, a program for the generation of optimised
programs for the efficient numerical evaluation of mathematical expressions. It
uses a multivariate Horner-scheme and Common Subexpression Elimination to
reduce the overall number of operations. The package can serve as a back-end
for virtually any general purpose computer algebra program. Built-in type
inference that allows to deal with non-standard data types in strongly typed
languages and a very flexible, pattern-based output specification ensure that
haggies can produce code for a large variety of programming languages. We
currently use haggies as part of an automated package for the calculation of
one-loop scattering amplitudes in quantum field theories. The examples in this
articles, however, demonstrate that its use is not restricted to the field of
high energy physics.
%0 Journal Article
%1 Reiter2009Optimising
%A Reiter, Thomas
%D 2009
%K pheno, tools
%T Optimising Code Generation with haggies
%U http://arxiv.org/abs/0907.3714
%X This article describes haggies, a program for the generation of optimised
programs for the efficient numerical evaluation of mathematical expressions. It
uses a multivariate Horner-scheme and Common Subexpression Elimination to
reduce the overall number of operations. The package can serve as a back-end
for virtually any general purpose computer algebra program. Built-in type
inference that allows to deal with non-standard data types in strongly typed
languages and a very flexible, pattern-based output specification ensure that
haggies can produce code for a large variety of programming languages. We
currently use haggies as part of an automated package for the calculation of
one-loop scattering amplitudes in quantum field theories. The examples in this
articles, however, demonstrate that its use is not restricted to the field of
high energy physics.
@article{Reiter2009Optimising,
abstract = {{This article describes haggies, a program for the generation of optimised
programs for the efficient numerical evaluation of mathematical expressions. It
uses a multivariate Horner-scheme and Common Subexpression Elimination to
reduce the overall number of operations. The package can serve as a back-end
for virtually any general purpose computer algebra program. Built-in type
inference that allows to deal with non-standard data types in strongly typed
languages and a very flexible, pattern-based output specification ensure that
haggies can produce code for a large variety of programming languages. We
currently use haggies as part of an automated package for the calculation of
one-loop scattering amplitudes in quantum field theories. The examples in this
articles, however, demonstrate that its use is not restricted to the field of
high energy physics.}},
added-at = {2019-02-23T22:09:48.000+0100},
archiveprefix = {arXiv},
author = {Reiter, Thomas},
biburl = {https://www.bibsonomy.org/bibtex/29ca68d079556d55cfe215cae11f2587a/cmcneile},
citeulike-article-id = {5223439},
citeulike-linkout-0 = {http://arxiv.org/abs/0907.3714},
citeulike-linkout-1 = {http://arxiv.org/pdf/0907.3714},
comment = {Looks like a useful tool for evaluating complicated expressions.},
day = 21,
eprint = {0907.3714},
interhash = {9f5c5d2434869095b06369b8348ec496},
intrahash = {9ca68d079556d55cfe215cae11f2587a},
keywords = {pheno, tools},
month = jul,
posted-at = {2009-07-22 11:07:40},
priority = {2},
timestamp = {2019-02-23T22:15:27.000+0100},
title = {{Optimising Code Generation with haggies}},
url = {http://arxiv.org/abs/0907.3714},
year = 2009
}