A variational mollification approach to circular deconvolution

Abstract

We propose a variational mollification approach to circular deconvolution based on the reconstruction of a mollified target object rather than the exact solution itself. The method is formulated as a convex variational problem whose solution admits an explicit Fourier representation. We establish the consistency of the proposed reconstruction as the target resolution increases and derive convergence rates for deterministic data perturbations. For ordinary smooth kernels, the method achieves the classical order-optimal algebraic convergence rates under Besov-Nikolskii smoothness assumptions, while for supersmooth kernels it attains the corresponding order-optimal logarithmic rates. Numerical experiments on synthetic and wind-direction data illustrate the effectiveness of the proposed approach and confirm the theoretical predictions.

22 pages, 2 figures