%0 Journal Article %J Technical Reports of the Computer Science Department %D 2010 %T Random sampling for estimating the performance of fast summations %A Srinivasan,Balaji Vasan %A Duraiswami, Ramani %K Technical Report %X Summation of functions of N source points evaluated at M target pointsoccurs commonly in many applications. To scale these approaches for large datasets, many fast algorithms have been proposed. In this technical report, we propose a Chernoff bound based efficient approach to test the performance of a fast summation algorithms providing a probabilistic accuracy. We further validate and use our approach in separate comparisons. %B Technical Reports of the Computer Science Department %8 2010/10/18/ %G eng %U http://drum.lib.umd.edu/handle/1903/10976