Sampling and reconstruction in reproducing kernel subspaces of mixed Lebesgue spaces

In this paper, we study the sampling and average sampling problems in a reproducing kernel subspace of mixed Lebesgue space. Let V be an image of \(L^{p,q}({\mathbb {R}}^{d+1})\) under idempotent integral operator defined by a kernel K satisfying certain decay and regularity conditions. Then, we prove that every f in V can be reconstructed uniquely and stably from its samples as well as from its average samples taken on a sufficiently small \(\gamma \)-dense set. Further, we derive iterative reconstruction algorithms for reconstruction of f in V from its samples and average samples. We also obtain the error estimates in iterative reconstruction algorithm from noisy samples and iterative noise.