L∞-Approximation Using Lattice Rules

In the preceding chapters, we have seen how (rank-1) lattice rules can be used for numerical integration, in particular in Korobov and Sobolev spaces. Moreover, we have outlined how we can efficiently construct the generating vectors of such (good) lattice rules, e.g., by the CBC algorithm.