5,350 research outputs found
On stable reconstructions from nonuniform Fourier measurements
We consider the problem of recovering a compactly-supported function from a
finite collection of pointwise samples of its Fourier transform taking
nonuniformly. First, we show that under suitable conditions on the sampling
frequencies - specifically, their density and bandwidth - it is possible to
recover any such function in a stable and accurate manner in any given
finite-dimensional subspace; in particular, one which is well suited for
approximating . In practice, this is carried out using so-called nonuniform
generalized sampling (NUGS). Second, we consider approximation spaces in one
dimension consisting of compactly supported wavelets. We prove that a linear
scaling of the dimension of the space with the sampling bandwidth is both
necessary and sufficient for stable and accurate recovery. Thus wavelets are up
to constant factors optimal spaces for reconstruction
Weighted frames of exponentials and stable recovery of multidimensional functions from nonuniform Fourier samples
In this paper, we consider the problem of recovering a compactly supported
multivariate function from a collection of pointwise samples of its Fourier
transform taken nonuniformly. We do this by using the concept of weighted
Fourier frames. A seminal result of Beurling shows that sample points give rise
to a classical Fourier frame provided they are relatively separated and of
sufficient density. However, this result does not allow for arbitrary
clustering of sample points, as is often the case in practice. Whilst keeping
the density condition sharp and dimension independent, our first result removes
the separation condition and shows that density alone suffices. However, this
result does not lead to estimates for the frame bounds. A known result of
Groechenig provides explicit estimates, but only subject to a density condition
that deteriorates linearly with dimension. In our second result we improve
these bounds by reducing the dimension dependence. In particular, we provide
explicit frame bounds which are dimensionless for functions having compact
support contained in a sphere. Next, we demonstrate how our two main results
give new insight into a reconstruction algorithm---based on the existing
generalized sampling framework---that allows for stable and quasi-optimal
reconstruction in any particular basis from a finite collection of samples.
Finally, we construct sufficiently dense sampling schemes that are often used
in practice---jittered, radial and spiral sampling schemes---and provide
several examples illustrating the effectiveness of our approach when tested on
these schemes
On the Solvability Complexity Index, the n-pseudospectrum and approximations of spectra of operators
We show that it is possible to compute spectra and pseudospectra of linear operators on separable Hilbert spaces given their matrix elements. The core in the theory is pseudospectral analysis and in particular the n-pseudospectrum and the residual pseudospectrum. We also introduce a new classification tool for spectral problems, namely, the Solvability Complexity Index. This index is an indicator of the "difficultness" of different computational spectral problems
- …