A superfast direct inversion method for the nonuniform discrete Fourier transform
<|reference_start|>A superfast direct inversion method for the nonuniform discrete Fourier transform: A direct solver is introduced for solving overdetermined linear systems involving nonuniform discrete Fourier transform matrices. Such a matrices can be transformed into a Cauchy-like form that has hierarchical low rank structure. The rank structure of this matrix is explained, and it is shown that the ranks of the relevant submatrices grow only logarithmically with the number of columns of the matrix. A fast rank-structured hierarchical approximation method based on this analysis is developed, along with a hierarchical least-squares solver for these and related systems. This result is a direct method for inverting nonuniform discrete transforms with a complexity that is nearly linear with respect to the degrees of freedom in the problem. This solver is benchmarked against various iterative and direct solvers in the setting of inverting the one-dimensional type-II (or forward) transform,for a range of condition numbers and problem sizes (up to $4\times 10^6$ by $2\times 10^6$). These experiments demonstrate that this method is especially useful for large ill-conditioned problems with multiple right-hand sides.<|reference_end|>
@article{wilber2024a,
    title={A superfast direct inversion method for the nonuniform discrete Fourier
  transform},
    author={Heather Wilber, Ethan N. Epperly, Alex H. Barnett},
    journal={arXiv preprint arXiv:2404.13223},
    year={2024},
    archivePrefix={arXiv},
    eprint={2404.13223},
    primaryClass={math.NA cs.NA}
}