Performance Comparison of Function Evaluation Methods
Fuente:
arXiv
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2002
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866918162754174976 |
|---|---|
| author | Liberti, Leo |
| author_facet | Liberti, Leo |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_cs_0206010 |
| institution | arXiv |
| publishDate | 2002 |
| record_format | arxiv |
| spellingShingle | Performance Comparison of Function Evaluation Methods Liberti, Leo Symbolic Computation Numerical Analysis I.1.3 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. |
| title | Performance Comparison of Function Evaluation Methods |
| topic | Symbolic Computation Numerical Analysis I.1.3 |
| url | https://arxiv.org/abs/cs/0206010 |