Related papers: On an estimate in the subspace perturbation proble…
Let A(x) be a holomorphic family of bounded self-adjoint operators on a separable Hilbert space H and let A(x)_n be the orthogonal compressions of A(x) to the span of first n elements of an orthonormal basis of H. The problem considered…
We present distributed algorithms that can be used by multiple agents to align their estimates with a particular value over a network with time-varying connectivity. Our framework is general in that this value can represent a consensus…
For a purely imaginary sign-definite perturbation of a self-adjoint operator, we obtain exponential representations for the perturbation determinant in both upper and lower half-planes and derive respective trace formulas.
We consider a second order self-adjoint operator in a domain which can be bounded or unbounded. The boundary is partitioned into two parts with Dirichlet boundary condition on one of them, and Neumann condition on the other. We assume that…
The decomposition or approximation of a linear operator on a matrix space as a sum of Kronecker products plays an important role in matrix equations and low-rank modeling. The approximation problem in Frobenius norm admits a well-known…
The authors study the spectral theory of self-adjoint operators that are subject to certain types of perturbations. An iterative introduction of infinitely many randomly coupled rank-one perturbations is one of our settings. Spectral…
This work investigates the parameter estimation performance of super-resolution line spectral estimation using atomic norm minimization. The focus is on analyzing the algorithm's accuracy of inferring the frequencies and complex magnitudes…
We overview the recent results on the shift of the spectrum and norm bounds for variation of spectral subspaces of a Hermitian operator under an additive Hermitian perturbation. Along with the known results, we present a new subspace…
In this paper we develop certain aspects of perturbation theory for self-adjoint operators subject to small variations of their domains. We use the abstract theory of boundary triplets to quantify such perturbations and give the second…
Compressed Sensing suggests that the required number of samples for reconstructing a signal can be greatly reduced if it is sparse in a known discrete basis, yet many real-world signals are sparse in a continuous dictionary. One example is…
Meaningful comparison between sets of observations often necessitates alignment or registration between them, and the resulting optimization problems range in complexity from those admitting simple closed-form solutions to those requiring…
Singular Spectrum Analysis and many other subspace-based methods of signal processing are implicitly relying on the assumption of close proximity of unperturbed and perturbed signal subspaces extracted by the Singular Value Decomposition of…
We prove that the set of orthogonal projections on a Hilbert space equipped with the length metric is $\frac\pi2$-geodesic. As an application, we consider the problem of variation of spectral subspaces for bounded linear self-adjoint…
In this technical note, we deal with a spectrum approximation problem arising in THREE-like multivariate spectral estimation approaches. The solution to the problem minimizes a suitable divergence index with respect to an a priori spectral…
Motivated by recent work on atomic norms in inverse problems, we propose a new approach to line spectral estimation that provides theoretical guarantees for the mean-squared-error (MSE) performance in the presence of noise and without…
The line spectral estimation problem consists in recovering the frequencies of a complex valued time signal that is assumed to be sparse in the spectral domain from its discrete observations. Unlike the gridding required by the classical…
We consider the problem of how to compute eigenvalues of a self-adjoint operator when a direct application of the Galerkin (finite-section) method is unreliable. The last two decades have seen the development of the so-called quadratic…
We consider the problem of estimating the spectral norm of a matrix using only matrix-vector products. We propose a new Counterbalance estimator that provides upper bounds on the norm and derive probabilistic guarantees on its…
This paper focuses on random projection operators when the subspace of projection is estimated. We derive non-asymptotic upper bounds on the error between the projection onto the estimated subspace and the projection onto the underlying…
For a given self-adjoint operator $A$ with discrete spectrum, we completely characterize possible eigenvalues of its rank-one perturbations~$B$ and discuss the inverse problem of reconstructing $B$ from its spectrum.