Related papers: The Trace Problem for Toeplitz Matrices and Operat…
For some kernel matrices, low-rank approximations can be quickly obtained via analytic techniques. One important class of analytic methods that has received attention in recent years is based on the use of proxy points. Accuracy analysis…
Trace and extreme eigenvalues of a product of truncated Toeplitz matrices. The singular case. In a first theorem we give an asymptotic expansion of Tr (T_N (f_1) T_N^{-1}(f_2)) where f1 ({\theta}) = |1 - e^{i {\theta}} | ^{2{{\alpha}1}c1…
We present some results concerning the almost sure behaviour of the operator norm or random Toeplitz matrices, including the law of large numbers for the norm, normalized by its expectation (in the i.i.d. case). As tools we present some…
Truncated Toeplitz operators are compressions of Toeplitz operators on model spaces; they have received much attention in the last years. This survey article presents several recent results, which relate boundedness, compactness, and…
We study a class of rotation invariant determinantal ensembles in the complex plane; examples include the eigenvalues of Gaussian random matrices and the roots of certain families of random polynomials. The main result is a criteria for a…
Process mining leverages event data extracted from IT systems to generate insights into the business processes of organizations. Such insights benefit from explicitly considering the frequency of behavior in business processes, which is…
We revisit the shift-and-invert Arnoldi method proposed in [S. Lee, H. Pang, and H. Sun. {\it Shift-invert Arnoldi approximation to the Toeplitz matrix exponential}, SIAM J. Sci. Comput., 32: 774--792, 2010] for numerical approximation to…
How to construct a suitable measurement matrix is still an open question in compressed sensing. A significant part of the recent work is that the measurement matrices are not completely random on the entries but exhibit considerable…
In this paper a new method for computation of higher order corrections to the saddle point approximation of the Feynman path integral is discussed. The saddle point approximation leads to local Schr\"odinger problems around classical…
Toeplitz operators are fundamental and ubiquitous in signal processing and information theory as models for linear, time-invariant (LTI) systems. Due to the fact that any practical system can access only signals of finite duration,…
In several applications, one must estimate a real-valued (symmetric) Toeplitz covariance matrix, typically shifted by the conjugated diagonal matrices of phase progression and phase "calibration" errors. Unlike the Hermitian Toeplitz…
We consider the use of randomised forward models and log-likelihoods within the Bayesian approach to inverse problems. Such random approximations to the exact forward model or log-likelihood arise naturally when a computationally expensive…
A trace formula for Toeplitz operators was proved by Boutet de Monvel and Guillemin in the setting of general Toeplitz structures. Here we give a local version of this result for a class of Toeplitz operators related to continuous groups of…
A new approach to problems of the Uncertainty Principle in Harmonic Analysis, based on the use of Toeplitz operators, has brought progress to some of the classical problems in the area. The goal of this paper is to develop and systematize…
The purpose of this paper is to compute the asymptotics of determinants of finite sections of operators that are trace class perturbations of Toeplitz operators. For example, we consider the asymptotics in the case where the matrices are of…
In this paper, we provide explicit formulas for the exact inverses of the symmetric tridiagonal near-Toeplitz matrices characterized by weak diagonal dominance in the Toeplitz part. Furthermore, these findings extend to scenarios where the…
In the past decades, multigrid methods for linear systems having multilevel Toeplitz coefficient matrices with scalar entries have been largely studied. On the other hand, only few papers have investigated the case of block entries, where…
Given a text $T$ of length $n$ and a pattern $P$ of length $m$, the approximate pattern matching problem asks for computation of a particular \emph{distance} function between $P$ and every $m$-substring of $T$. We consider a…
This paper studies the problem of maximizing the sum of traces of matrix quadratic forms on a product of Stiefel manifolds. This orthogonal trace-sum maximization (OTSM) problem generalizes many interesting problems such as generalized…
We study the sample complexity of estimating the covariance matrix $T$ of a distribution $\mathcal{D}$ over $d$-dimensional vectors, under the assumption that $T$ is Toeplitz. This assumption arises in many signal processing problems, where…