Performance Comparison of Function Evaluation Methods

Details Performance Comparison of Function Evaluation Methods Performance Comparison of Function Evaluation Methods

2002-06-06

arxiv.org/abs/cs/0206010v2

Computer Science

Symbolic Computation

Main conclusion of this paper is wrong due to a bug in the test code; see "Important warning" at the beginning of the paper

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Performance Comparison of Function Evaluation Methods does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Performance Comparison of Function Evaluation Methods, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Performance Comparison of Function Evaluation Methods will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-435667