Mathematics of Computation · 1994 · 21 citations · 6 references
ComputingComputer ScienceInformation TheoryRepresentation TheoryTheory Of ComputationApproximation MethodsConvergence AnalysisNumber-theoretic ProofsNumerical Integration Fundamentals
We will prove the following theorem on Walsh series, and we will derive from this theorem an effective and constructive method for the numerical integration of Walsh series by number-theoretic methods.Further, concrete computer calculations are given.Theorem.For base b > 2, dimension s > 1, and o > 1, c > 0 {b, s N; c, a e R), let i,E~(c) be the class of all functions f: [0, l)s - C which are representable by absolutely convergent Walsh series to base b with Walsh coefficients W(h\,... ,hs) with the following property: \W(h\,... , hs)\ < c ' (Ai hs)~a for all h\, ... ,hs, where h := max(l, |A|).We show that if f i"(c), then f lhE~~h{c 2hsa) for all h > 2, provided that a > 1 + /,, where fc-*5i+:02logsin I 4 + f j"2*+Tj J 2h -log2The "exponent" a -h is best possible for all h , and /?/, is monotonically increasing with 1 log sin H
6
Low-discrepancy and low-dispersion sequences
Harald Niederreiter · Journal of Number Theory · 1988 · 487 citations