Performance Comparison of Function Evaluation Methods
<|reference_start|>Performance Comparison of Function Evaluation Methods: We perform a comparison of the performance and efficiency of four different function evaluation methods: black-box functions, binary trees, $n$-ary trees and string parsing. The test consists in evaluating 8 different functions of two variables $x,y$ over 5000 floating point values of the pair $(x,y)$. The outcome of the test indicates that the $n$-ary tree representation of algebraic expressions is the fastest method, closely followed by black-box function method, then by binary trees and lastly by string parsing.<|reference_end|>
@article{liberti2002performance,
    title={Performance Comparison of Function Evaluation Methods},
    author={Leo Liberti},
    journal={arXiv preprint arXiv:cs/0206010},
    year={2002},
    archivePrefix={arXiv},
    eprint={cs/0206010},
    primaryClass={cs.SC cs.NA}
}