Related papers: The Lanczos Algorithm Under Few Iterations: Concen…

We present randomized algorithms for estimating the trace and deter- minant of Hermitian positive semi-definite matrices. The algorithms are based on subspace iteration, and access the matrix only through matrix vector products. We analyse…

We develop and analyze efficient "coordinate-wise" methods for finding the leading eigenvector, where each step involves only a vector-vector product. We establish global convergence with overall runtime guarantees that are at least as good…

We consider linear regression in the high-dimensional regime where the number of observations $n$ is smaller than the number of parameters $p$. A very successful approach in this setting uses $\ell_1$-penalized least squares (a.k.a. the…

We reformulate the Lanczos algorithm for quantum wave function propagation in terms of variational principle. By including some basis states of previous time steps into the variational subspace, the resultant accuracy increases by several…

Randomized trace estimation is a popular and well studied technique that approximates the trace of a large-scale matrix $B$ by computing the average of $x^T Bx$ for many samples of a random vector $X$. Often, $B$ is symmetric positive…

Let $A\colon H\rightarrow H$ be a normal operator on an infinite-dimensional separable Hilbert space $H$ and let $S\subseteq H$ be a finite subset such that $\{A^nx\}_{n\geq 0,\,x\in S}$ can be rescaled to form a frame for $H$. That is,…

We consider Jacobi matrices $J$ whose parameters have the power asymptotics $\rho_n=n^{\beta_1} \left( x_0 + \frac{x_1}{n} + {\rm O}(n^{-1-\epsilon})\right)$ and $q_n=n^{\beta_2} \left( y_0 + \frac{y_1}{n} + {\rm O}(n^{-1-\epsilon})\right)$…

For an arbitrary Hermitian period-$T$ Jacobi operator, we assume a perturbation by a Wigner-von Neumann type potential to devise subordinate solutions to the formal spectral equation for a (possibly infinite) real set, $S$, of the spectral…

We find and discuss asymptotic formulas for orthonormal polynomials $P_{n}(z)$ with recurrence coefficients $a_{n}, b_{n}$. Our main goal is to consider the case where off-diagonal elements $a_{n}\to\infty$ as $n\to\infty$. Formulas…

We consider the following constrained Rayleigh quotient optimization problem (CRQopt) $$ \min_{x\in \mathbb{R}^n} x^{T}Ax\,\,\mbox{subject to}\,\, x^{T}x=1\,\mbox{and}\,C^{T}x=b, $$ where $A$ is an $n\times n$ real symmetric matrix and $C$…

Let ${\mathcal S}_m$ be the set of all $m\times m$ density matrices (Hermitian positively semi-definite matrices of unit trace). Consider a problem of estimation of an unknown density matrix $\rho\in {\mathcal S}_m$ based on outcomes of $n$…

A theory is presented for a novel recursion method for O(N) ab initio tight-binding calculations. A long-standing problem of generalizing the recursion method to a non-orthogonal basis, which is a crucial step to make the recursion method…

Consider an n x n Hermitian random matrix with, above the diagonal, independent entries with alpha-stable symmetric distribution and 0 < alpha < 2. We establish new bounds on the rate of convergence of the empirical spectral distribution of…

We investigate the large $n$ behavior of Jacobi polynomials with varying parameters $P_{n}^{(an+\alpha,\,bn+\beta)}(1-2\lambda^{2})$ for $a,b >-1$ and $\lambda\in(0,\,1)$. This is a well-studied topic in the literature but some of the…

We study resonances for Jacobi operators on the half lattice with matrix valued coefficient and finitely supported perturbations. We describe a forbidden domain, the geometry of resonances and their asymptotics when the main coefficient of…

In this paper we study the common distance between points and the behavior of a constant length step discrete random walk on finite area hyperbolic surfaces. We show that if the second smallest eigenvalue of the Laplacian is at least 1/4,…

We present randomized algorithms for estimating the log-determinant of regularized symmetric positive semi-definite matrices. The algorithms access the matrix only through matrix vector products, and are based on the introduction of a…

For a broad class of unitary ensembles of random matrices we demonstrate the universal nature of the Janossy densities of eigenvalues near the spectral edge, providing a different formulation of the probability distributions of the limiting…

The Lovasz Local Lemma is a seminal result in probabilistic combinatorics. It gives a sufficient condition on a probability space and a collection of events for the existence of an outcome that simultaneously avoids all of those events.…

Building on a previously introduced block Lanczos method, we demonstrate how to approximate any operator function of the form Trf (A) when the argument A is given as a Hermitian matrix product operator. This gives access to quantities that,…