We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
This paper focuses on the fundamental aspects of super-resolution, particularly addressing the stability of super-resolution and the estimation of two-point resolution. Our first major contribution is the introduction of two location-amplitude identities that characterize the relationships between locations and amplitudes of true and recovered sources in the one-dimensional super-resolution problem. These identities facilitate direct derivations of the super-resolution capabilities for recovering the number, location, and amplitude of sources, significantly advancing existing estimations to levels of practical relevance. As a natural extension, we establish the stability of a specific $l_{0}$ minimization algorithm in the super-resolution problem.
The second crucial contribution of this paper is the theoretical proof of a two-point resolution limit in multi-dimensional spaces. The resolution limit is expressed as
$$\begin{align*}\mathscr R = \frac{4\arcsin \left(\left(\frac{\sigma}{m_{\min}}\right)^{\frac{1}{2}} \right)}{\Omega} \end{align*}$$
for ${\frac {\sigma }{m_{\min }}}{\leqslant }{\frac {1}{2}}$, where ${\frac {\sigma }{m_{\min }}}$ represents the inverse of the signal-to-noise ratio (${\mathrm {SNR}}$) and $\Omega $ is the cutoff frequency. It also demonstrates that for resolving two point sources, the resolution can exceed the Rayleigh limit ${\frac {\pi }{\Omega }}$ when the signal-to-noise ratio (SNR) exceeds $2$. Moreover, we find a tractable algorithm that achieves the resolution ${\mathscr {R}}$ when distinguishing two sources.
We prove Lp norm convergence for (appropriate truncations of) the Fourier series arising from the Dirichlet Laplacian eigenfunctions on three types of triangular domains in $\mathbb{R}^2$: (i) the 45-90-45 triangle, (ii) the equilateral triangle and (iii) the hemiequilateral triangle (i.e. half an equilateral triangle cut along its height). The limitations of our argument to these three types are discussed in light of Lamé’s Theorem and the image method.
We study approximations for the Lévy area of Brownian motion which are based on the Fourier series expansion and a polynomial expansion of the associated Brownian bridge. Comparing the asymptotic convergence rates of the Lévy area approximations, we see that the approximation resulting from the polynomial expansion of the Brownian bridge is more accurate than the Kloeden–Platen–Wright approximation, whilst still only using independent normal random vectors. We then link the asymptotic convergence rates of these approximations to the limiting fluctuations for the corresponding series expansions of the Brownian bridge. Moreover, and of interest in its own right, the analysis we use to identify the fluctuation processes for the Karhunen–Loève and Fourier series expansions of the Brownian bridge is extended to give a stand-alone derivation of the values of the Riemann zeta function at even positive integers.
For functions in
$C^k(\mathbb {R})$
which commute with a translation, we prove a theorem on approximation by entire functions which commute with the same translation, with a requirement that the values of the entire function and its derivatives on a specified countable set belong to specified dense sets. Using this theorem, we show that if A and B are countable dense subsets of the unit circle
$T\subseteq \mathbb {C}$
with
$1\notin A$
,
$1\notin B$
, then there is an analytic function
$h\colon \mathbb {C}\setminus \{0\}\to \mathbb {C}$
that restricts to an order isomorphism of the arc
$T\setminus \{1\}$
onto itself and satisfies
$h(A)=B$
and
$h'(z)\not =0$
when
$z\in T$
. This answers a question of P. M. Gauthier.
We obtain estimates on the uniform convergence rate of the Birkhoff average of a continuous observable over torus translations and affine skew product toral transformations. The convergence rate depends explicitly on the modulus of continuity of the observable and on the arithmetic properties of the frequency defining the transformation. Furthermore, we show that for the one-dimensional torus translation, these estimates are nearly optimal.
The theory of reproducing kernel Hilbert spaces is applied to a minimization problem with prescribed nodes. We re-prove and generalize some results previously obtained by Gunawan et al. [2,3], and also discuss the Hölder continuity of the solution to the problem.
Given a piecewise smooth function, it is possible to construct a global expansion in some complete orthogonal basis, such as the Fourier basis. However, the local discontinuities of the function will destroy the convergence of global approximations, even in regions for which the underlying function is analytic. The global expansions are contaminated by the presence of a local discontinuity, and the result is that the partial sums are oscillatory and feature non-uniform convergence. This characteristic behavior is called the Gibbs phenomenon. However, David Gottlieb and Chi-Wang Shu showed that these slowly and non-uniformly convergent global approximations retain within them high order information which can be recovered with suitable postprocessing. In this paper we review the history of the Gibbs phenomenon and the story of its resolution.
Recommend this
Email your librarian or administrator to recommend adding this to your organisation's collection.