2000 character limit reached
Sampling and Galerkin reconstruction in reproducing kernel spaces (1410.1828v1)
Published 7 Oct 2014 in cs.IT, math.IT, and math.NA
Abstract: In this paper, we consider sampling in a reproducing kernel subspace of $Lp$. We introduce a pre-reconstruction operator associated with a sampling scheme and propose a Galerkin reconstruction in general Banach space setting. We show that the proposed Galerkin method provides a quasi-optimal approximation, and the corresponding Galerkin equations could be solved by an iterative approximation-projection algorithm. We also present detailed analysis and numerical simulations of the Galerkin method for reconstructing signals with finite rate of innovation.