PhaseJumps: fast computation of zeros from planar grid samples

We consider complex-valued functions on the complex plane and the task of computing their zeros from samples taken along a finite grid. We introduce PhaseJumps, an algorithm based on comparing changes in the complex phase and local oscillations among grid neighboring points. The algorithm is applicable to possibly non-analytic input functions, and also computes the direction of phase winding around zeros. PhaseJumps provides a first effective means to compute the zeros of the short-time Fourier transform of an analog signal with respect to a general analyzing window, and makes certain recent signal processing insights more widely applicable, overcoming previous constraints to analytic transformations. We study the performance of (a variant of) PhaseJumps under a stochastic input model motivated by signal processing applications and show that the input instances that may cause the algorithm to fail are fragile, in the sense that they are regularized by additive noise (smoothed analysis). Precisely, given samples of a function on a grid with spacing $δ$, we show that our algorithm computes zeros with accuracy $\sqrtδ$ in the Wasserstein metric with failure probability $O\big(\log^2(\tfrac{1}δ) δ\big)$, while numerical experiments suggests even better performance.

Source: arXiv:2603.13158v1 - http://arxiv.org/abs/2603.13158v1 PDF: https://arxiv.org/pdf/2603.13158v1 Original Link: http://arxiv.org/abs/2603.13158v1