Jump to main content
Nonequispaced fast Fourier transform
Least squares
Nonequispaced fast Fourier transform  

Least squares

Let N=(N1,,Nd)2Nd. For given samples (xj,yj)Td×C,j=0,,M1, the index set INd:={N12,,N121}××{Nd2,,Nd21}, of frequencies, we construct a d-variate trigonometric polynomial f(x):=kINdf^ke2πikx such that f(xj)yj,j=0,,M1. Turning this into matrix vector notation, we aim to solve the system of linear equations (1)Af^y for the unknown vector of Fourier coefficients f^:=(f^k)kINdCNd. We denote the vector of the given sample values by y:=(yj)j=0,,M1CM and the nonequispaced Fourier matrix by A:=(e2πikxj)j=0,,M1;kINdCM×Nd. For |INd|<M, the linear system (1) is over-determined, so that in general the given data y will be only approximated up to a residual r:=yAf^. In order to compensate for clusters in the sampling set X, it is useful to incorporate weights wj>0 and to consider the weighted approximation problem (2)yAf^W2=j=0M1wj|yjf(xj)|2f^min, where W:=diag(wj)j=0,,M1. This library of C functions computes approximations of (2) with the CGNR method.


The algorithms are implemented by Stefan Kunis in ./solver. Related paper are

  • Kunis, S. and Potts, D.
    Stability Results for Scattered Data Interpolation by Trigonometric Polynomials.
    SIAM J. Sci. Comput. 29, 1403 - 1419,   (full paper ps, pdf)   2007