A Superfast Direct Solver for Type-III Inverse Nonuniform Discrete Fourier Transform

TL;DR

This paper introduces a superfast direct inversion method for type-III NUDFT that leverages matrix decompositions to achieve quasi-linear complexity, enabling high-accuracy solutions and efficient preconditioning.

Contribution

It presents a novel matrix decomposition approach for type-III NUDFT, enabling fast inversion with theoretical error bounds and practical efficiency.

Findings

Achieves quasi-linear complexity for type-III NUDFT inversion.

Provides an error bound for the approximation under specific sample distributions.

Demonstrates high accuracy and efficiency through numerical experiments.

Abstract

The nonuniform discrete Fourier transform (NUDFT) and its inverse are widely used in various fields of scientific computing. In this article, we propose a novel superfast direct inversion method for type-III NUDFT. The proposed method approximates the type-III NUDFT matrix as a product of a type-II NUDFT matrix and an HSS matrix, where the type-II NUDFT matrix is further decomposed into the product of an HSS matrix and an uniform discrete Fourier transform (DFT) matrix as in [Wilber, Epperly, and Barnett, SIAM Journal on Scientific Computing, 47(3):A1702-A1732, 2025]. This decomposition enables both the forward application and the backward inversion to be accomplished with quasi-linear complexity. The fast inversion can serve as a high-accuracy direct solver or as an efficient preconditioner. Additionally, we provide an error bound for the approximation under specific sample distributions. Numerical results are presented to verify the relevant theoretical properties and demonstrate the efficiency of the proposed methods.