Exact Reconstruction of Extended Exponential Sums using Rational Approximation of their Fourier Coefficients
Nadiia Derevianko, Gerlind Plonka

TL;DR
This paper introduces a stable, rational approximation-based method for reconstructing extended exponential sums from Fourier coefficients, accurately recovering all parameters including frequencies, multiplicities, and coefficients.
Contribution
It presents a novel recovery procedure that uses rational approximation of Fourier coefficients to reconstruct extended exponential sums with high stability and automatic detection of the number of terms.
Findings
Requires at most 2N+2 Fourier coefficients for exact recovery
Automatically detects the number of sum terms and their parameters
Provides a stable alternative to Prony's method
Abstract
In this paper we derive a new recovery procedure for the reconstruction of extended exponential sums of the form , where the frequency parameters are pairwise distinct. For the reconstruction we employ a finite set of classical Fourier coefficients of with regard to a finite interval with . Our method requires at most Fourier coefficients to recover all parameters of , where denotes the order of . The recovery is based on the observation that for the terms of possess Fourier coefficients with rational structure. We employ a recently proposed stable iterative rational approximation algorithm in [12].…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
