Fast component-by-component construction of lattice algorithms for multivariate approximation with POD and SPOD weights

by   Ronald Cools, et al.

In a recent paper by the same authors, we provided a theoretical foundation for the component-by-component (CBC) construction of lattice algorithms for multivariate L_2 approximation in the worst case setting, for functions in a periodic space with general weight parameters. The construction led to an error bound that achieves the best possible rate of convergence for lattice algorithms. Previously available literature covered only weights of a simple form commonly known as product weights. In this paper we address the computational aspect of the construction. We develop fast CBC construction of lattice algorithms for special forms of weight parameters, including the so-called POD weights and SPOD weights which arise from PDE applications, making the lattice algorithms truly applicable in practice. With d denoting the dimension and n the number of lattice points, we show that the construction cost is O(d nlog(n) + d^2log(d) n) for POD weights, and O(d nlog(n) + d^3σ^2 n) for SPOD weights of degree σ> 2. The resulting lattice generating vectors can be used in other lattice-based approximation algorithms, including kernel methods or splines.


page 1

page 2

page 3

page 4


Lattice algorithms for multivariate approximation in periodic spaces with general weight parameters

This paper provides the theoretical foundation for the construction of l...

Constructing Embedded Lattice-based Algorithms for Multivariate Function Approximation with a Composite Number of Points

We approximate d-variate periodic functions in weighted Korobov spaces w...

A fast probabilistic component-by-component construction of exactly integrating rank-1 lattices and applications

Several more and more efficient component–by–component (CBC) constructio...

Digit-by-digit and component-by-component constructions of lattice rules for periodic functions with unknown smoothness

Lattice rules are among the most prominently studied quasi-Monte Carlo m...

A note on the CBC-DBD construction of lattice rules with general positive weights

Lattice rules are among the most prominently studied quasi-Monte Carlo m...

Component-by-component construction of randomized rank-1 lattice rules achieving almost the optimal randomized error rate

We study a randomized quadrature algorithm to approximate the integral o...

Refinability of splines from lattice Voronoi cells

Splines can be constructed by convolving the indicator function of the V...