Efficient algorithms for computing the $L_2$-discrepancy

Abstract

The L 2-discrepancy is a quantitative measure of precision for mul-tivariate quadrature rules. It can be computed explicitly. Previously known algorithms needed O(m 2) operations, where m is the number of nodes. In this paper we present algorithms which require O(m(log m) d) operations.