Related papers: Truly Sub-Nyquist Generalized Eigenvalue Method wi…
This paper considers the sparse eigenvalue problem, which is to extract dominant (largest) sparse eigenvectors with at most $k$ non-zero components. We propose a simple yet effective solution called truncated power method that can…
We propose a novel error analysis framework for scaled generalized Laguerre and generalized Hermite approximations.This framework can be regarded as an analogue of the Nyquist-Shannon sampling theorem: It characterizes the spatial and…
In this paper, we propose oversampling strategies in the Generalized Multiscale Finite Element Method (GMsFEM) framework. The GMsFEM, which has been recently introduced in [12], allows solving multiscale parameter-dependent problems at a…
We derive a compressive sampling method for acoustic field reconstruction using field measurements on a predefined spherical grid that has theoretically guaranteed relations between signal sparsity, measurement number, and reconstruction…
We consider synthetic aperture radar imaging of a region containing point-like targets. Measurements are the set of frequency responses to scattering by the targets taken over a collection of individual spatial locations along the flight…
Quantum waveform estimation, in which quantum sensors sample entire time series, promises to revolutionize the sensing of weak and stochastic signals, such as the biomagnetic impulses emitted by firing neurons. For long duration signals…
Random pulse sequences are a powerful method for qubit noise spectroscopy, enabling efficient reconstruction of sparse noise spectra. Here, we advance this method in two complementary directions. First, we extend the method using a…
Surface-enhanced Raman scattering (SERS) combines analyte-specificity and single-molecule sensitivity, but its potential is limited by slow readout where sophisticated nanosensors are analysed in a serial fashion, one particle at a time. We…
This paper discusses sample allocation problem (SAP) in frequency-domain Compressive Sampling (CS) of time-domain signals. An analysis that is relied on two fundamental CS principles; the Uniform Random Sampling (URS) and the Uncertainty…
Quantum subspace diagonalization and quantum Krylov algorithms offer a feasible, pre- or early-fault tolerant alternative to quantum phase estimation for using quantum computers to estimate the low-lying spectra of quantum systems. However,…
We present a quantum algorithm to compute the entanglement spectrum of arbitrary quantum states. The interesting universal part of the entanglement spectrum is typically contained in the largest eigenvalues of the density matrix which can…
In this paper we study the problem of computing wavelet coefficients of compactly supported functions from their Fourier samples. For this, we use the recently introduced framework of generalized sampling. Our first result demonstrates that…
Data saving capability of "Compressed sensing (sampling)" in signal discretization is disputed and found to be far below the theoretical upper bound defined by the signal sparsity. On a simple and intuitive example, it is demonstrated that,…
Cognitive Radio requires efficient and reliable spectrum sensing of wideband signals. In order to cope with the sampling rate bottleneck, new sampling methods have been proposed that sample below the Nyquist rate. However, such techniques…
This paper demonstrates how new principles of compressed sensing, namely asymptotic incoherence, asymptotic sparsity and multilevel sampling, can be utilised to better understand underlying phenomena in practical compressed sensing and…
We propose to reduce the original well-posed problem of compressive sensing to weighted-MAX-SAT. Compressive sensing is a novel randomized data acquisition approach that linearly samples sparse or compressible signals at a rate much below…
The central idea of compressed sensing is to exploit the fact that most signals of interest are sparse in some domain and use this to reduce the number of measurements to encode. However, if the sparsity of the input signal is not precisely…
In compressed sensing, it is often desirable to consider signals possessing additional structure beyond sparsity. One such structured signal model - which forms the focus of this paper - is the local sparsity in levels class. This class has…
Compressive Sensing (CS) theory shows that a signal can be decoded from many fewer measurements than suggested by the Nyquist sampling theory, when the signal is sparse in some domain. Most of conventional CS recovery approaches, however,…
In this paper, the generalized finite element method (GFEM) for solving second order elliptic equations with rough coefficients is studied. New optimal local approximation spaces for GFEMs based on local eigenvalue problems involving a…