Related papers: Fast Machine-Precision Spectral Likelihoods for St…

In this paper, we develop and study algorithms for approximately solving the linear algebraic systems: $\mathcal{A}_h^\alpha u_h = f_h$, $ 0< \alpha <1$, for $u_h, f_h \in V_h$ with $V_h$ a finite element approximation space. Such problems…

Toeplitz matrices for the study of the fractional Laplacian on a bounded interval. In this work we get a deep link between (--$\Delta$) $\alpha$ ]0,1[ the fractional Laplacian on the interval ]0, 1[ and T N ($\Phi$ $\alpha$) the Toeplitz…

We consider the problem of reconstructing a rank-$k$ $n \times n$ matrix $M$ from a sampling of its entries. Under a certain incoherence assumption on $M$ and for the case when both the rank and the condition number of $M$ are bounded, it…

We present a new technique for computing Hilbert series of N=1 supersymmetric QCD in four dimensions with unitary and special unitary gauge groups. We show that the Hilbert series of this theory can be written in terms of determinants of…

We study the problem of computationally efficient robust estimation of the covariance/scatter matrix of elliptical distributions -- that is, affine transformations of spherically symmetric distributions -- under the strong contamination…

The large-$N$ limit of $O(N)$-symmetric bosonic field theories, or $U(N)$-symmetric fermionic field theories, is amenable to a saddle point approximation. As a result, there is a family of closely related algorithms for efficient lattice…

We present an efficient and scalable algorithm for performing matrix-vector multiplications ("matvecs") for block Toeplitz matrices. Such matrices, which are shift-invariant with respect to their blocks, arise in the context of solving…

Consider the ensembles of real symmetric Toeplitz matrices and real symmetric Hankel matrices whose entries are i.i.d. random variables chosen from a fixed probability distribution p of mean 0, variance 1, and finite higher moments.…

We give an efficient algorithm which can obtain a relative error approximation to the spectral norm of a matrix, combining the power iteration method with some techniques from matrix reconstruction which use random sampling.

Motivated by applications to multi-antenna wireless networks, we propose a distributed and asynchronous algorithm for stochastic semidefinite programming. This algorithm is a stochastic approximation of a continous- time matrix exponential…

In this paper, we consider the problem of seriation of a permuted structured matrix based on noisy observations. The entries of the matrix relate to an expected quantification of interaction between two objects: the higher the value, the…

In this paper we describe a new algorithm called Fast Adaptive Sequencing Technique (FAST) for maximizing a monotone submodular function under a cardinality constraint $k$ whose approximation ratio is arbitrarily close to $1-1/e$, is…

This article is about finding the limit set for banded Toeplitz matrices. Our main result is a new approach to approximate the limit set $\Lambda(b)$ where $b$ is the symbol of the banded Toeplitz matrix. The new approach is geometrical and…

We consider the problem of counting the copies of a length-$k$ pattern $\sigma$ in a sequence $f \colon [n] \to \mathbb{R}$, where a copy is a subset of indices $i_1 < \ldots < i_k \in [n]$ such that $f(i_j) < f(i_\ell)$ if and only if…

The girth of a graph, i.e. the length of its shortest cycle, is a fundamental graph parameter. Unfortunately all known algorithms for computing, even approximately, the girth and girth-related structures in directed weighted $m$-edge and…

We represent low dimensional quantum mechanical Hamiltonians by moderately sized finite matrices that reproduce the lowest O(10) boundstate energies and wave functions to machine precision. The method extends also to Hamiltonians that are…

Matrix sketching, aimed at approximating a matrix $\boldsymbol{A} \in \mathbb{R}^{N\times d}$ consisting of vector streams of length $N$ with a smaller sketching matrix $\boldsymbol{B} \in \mathbb{R}^{\ell\times d}, \ell \ll N$, has…

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…

This article introduces a nonparametric approach to spectral analysis of a high-dimensional multivariate nonstationary time series. The procedure is based on a novel frequency-domain factor model that provides a flexible yet parsimonious…

This article deals with the limiting spectral distributions (LSD) of symmetric Toeplitz and Hankel matrices with dependent entries. For any fixed positive integer $m$, we consider these $n \times n$ matrices with entries $\{Y^{(m)}_j /…