Samplet compression for conditionally positive definite kernels and universal Kriging
A samplet-based framework for the efficient numerical solution of saddle-point systems arising from conditionally positive definite (CPD) kernel approximation in general and universal Kriging in particular, which achieves O(N log N) cost for the assembly and the storage of the saddle-point system.