Efficient algorithms for computing the $L_2$-discrepancy
Open Access
- 1 July 1996
- journal article
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 65 (216) , 1621-1633
- https://doi.org/10.1090/s0025-5718-96-00756-9
Abstract
The -discrepancy is a quantitative measure of precision for multivariate quadrature rules. It can be computed explicitly. Previously known algorithms needed operations, where is the number of nodes. In this paper we present algorithms which require operations.Keywords
This publication has 7 references indexed in Scilit:
- Average Case Complexity of Multivariate Integration for Smooth FunctionsJournal of Complexity, 1993
- Random Number Generation and Quasi-Monte Carlo MethodsPublished by Society for Industrial & Applied Mathematics (SIAM) ,1992
- Average case complexity of multivariate integrationBulletin of the American Mathematical Society, 1991
- On irregularities of distribution, IVActa Arithmetica, 1980
- Computational Investigations of Low-Discrepancy Point Sets**This work received financial support from National Science Foundation Grants GB-16665 and GJ171 and National Aeronautics and Space Administration Grant NGL 50-002-001.Published by Elsevier ,1972
- Note on irregularities of distributionMathematika, 1956
- On irregularities of distributionMathematika, 1954