On the numerical integration of Walsh series by number-theoretic methods

In analogy to the theory of good lattice points for the numerical integration of rapidly converging Fourier series, a theory for the fast numerical integration of Walsh series is developed. The basis for this theory is provided by a class of very well-distributed point sets in the s-dimensional unit cube, the so-called (t, m, s)-nets.

[1]  I. Sobol.  On the distribution of points in a cube and the approximate evaluation of integrals , 1967 .

[2]  Lauwerens Kuipers,et al.  Uniform distribution of sequences , 1974 .

[3]  H. Niederreiter.  Low-discrepancy and low-dispersion sequences , 1988 .

[4]  Lionel Giles,et al.  Translated From the Chinese , 2022 .

[5]  H. Niederreiter.  Dyadic fractions with small partial quotients , 1986 .

[6]  H. Niederreiter.  Existence of good lattice points in the sense of Hlawka , 1978 .

[7]  Gerhard Larcher.  Nets obtained from rational functions over finite fields , 1993 .

[8]  E. Hlawka.  Zur angenäherten Berechnung mehrfacher Integrale , 1962 .

[9]  K Niederdrenk,et al.  Die endliche Fourier-und Walshtransformation mit einer Einf?uhrung in die Bildverarbeitung , 1982 .

[10]  H. Niederreiter.  Point sets and sequences with small discrepancy , 1987 .

[11]  H. Niederreiter.  Pseudo-random numbers and optimal coefficients☆ , 1977 .

[12]  H. Niederreiter,et al.  Good parameters for a class of node sets in quasi-Monte Carlo integration , 1993 .

[13]  S. K. Zaremba,et al.  La Méthode des “Bons Treillis” pour le Calcul des Intégrales Multiples , 1972 .

[14]  H. E. Chrestenson.  A class of generalized Walsh functions , 1955 .

[15]  H. Keng,et al.  Applications of number theory to numerical analysis , 1981 .

[16]  I. F. Sharygin,et al.  A lower estimate for the error of quadrature formulae for certain classes of functions , 1963 .

[17]  Harald Niederreiter,et al.  Low-discrepancy point sets obtained by digital constructions over finite fields , 1992 .