Related papers: Complexity of Linear Operators

Let $\mathcal L$ be a set of $n$ lines in the plane, and let $C$ be a convex curve in the plane, like a circle or a parabola. The "zone" of $C$ in $\mathcal L$, denoted $\mathcal Z(C,\mathcal L)$, is defined as the set of all cells in the…

Consider the approximate sparse recovery problem: given Ax, where A is a known m-by-n dimensional matrix and x is an unknown (approximately) sparse n-dimensional vector, recover an approximation to x. The goal is to design the matrix A such…

Let R be a complete discrete valuation ring, S=R[[u]] and n a positive integer. The aim of this paper is to explain how to compute efficiently usual operations such as sum and intersection of sub-S-modules of S^d. As S is not principal, it…

We develop several efficient algorithms for the classical \emph{Matrix Scaling} problem, which is used in many diverse areas, from preconditioning linear systems to approximation of the permanent. On an input $n\times n$ matrix $A$, this…

We multiply two $n \times n$ matrices $S,T$ over semirings in the Congested Clique model, where $n$ fully connected nodes communicate synchronously using $O(\log n)$-bit messages, within $O(nz(S)^{1/3} nz(T)^{1/3}/n + 1)$ rounds of…

Efficiently processing basic linear algebra subroutines is of great importance for a wide range of computational problems. In this paper, we consider techniques to implement matrix functions on a quantum computer, which are composed of…

Thus far, sparse representations have been exploited largely in the context of robustly estimating functions in a noisy environment from a few measurements. In this context, the existence of a basis in which the signal class under…

We consider the multiplicative complexity of Boolean functions with multiple bits of output, studying how large a multiplicative complexity is necessary and sufficient to provide a desired nonlinearity. For so-called $\Sigma\Pi\Sigma$…

In an earlier paper, we showed that a large class of fast recursive matrix multiplication algorithms is stable in a normwise sense, and that in fact if multiplication of $n$-by-$n$ matrices can be done by any algorithm in $O(n^{\omega +…

The weak operator topology closed operator algebra on $L^2(R)$ generated by the one-parameter semigroups for translation, dilation and multiplication by $exp(i\lambda x), \lambda \geq 0$, is shown to be a reflexive operator algebra, in the…

In this paper we study a series of vertex operator algebras of integer level associated to the affine Lie algebra $A_{\ell}^{(1)}$. These vertex operator algebras are constructed by using the explicit construction of certain singular…

We calculate convergent 3-loop Feynman diagrams containing a single massive loop equipped with twist $\tau =2$ local operator insertions corresponding to spin $N$. They contribute to the massive operator matrix elements in QCD describing…

This paper establishes new upper bounds for the $A$-numerical radius of operator matrices in semi-Hilbertian spaces by leveraging the $A$-Buzano inequality and developing refined techniques for operator matrices. We present several sharp…

Min-plus matrix multiplication is used in many problems operating on distances in graphs or solvable by dynamic programming. Assuming the APSP hypothesis, there is no subcubic-time algorithm for the min-plus product of two general $n\times…

Solving linear systems of equations is a common problem that arises both on its own and as a subroutine in more complex problems: given a matrix A and a vector b, find a vector x such that Ax=b. We consider the case where one doesn't need…

An operator system $\cl S$ with unit $e$, can be viewed as an Archimedean order unit space $(\cl S,\cl S^+,e)$. Using this Archimedean order unit space, for a fixed $k\in \bb N$ we construct a super k-minimal operator system OMIN$_k(\cl S)$…

We investigate the dividing line between classical and quantum computational power in estimating properties of matrix functions. More precisely, we study the computational complexity of two primitive problems: given a function $f$ and a…

We introduce a formal operational semantics that describes the fused execution of variable contraction problems, which compute indexed arithmetic over a semiring and generalize sparse and dense tensor algebra, relational algebra, and graph…

The computation of matrix functions is a well-studied problem. Of special importance are the exponential and the logarithm of a matrix, where the latter also raises existence and uniqueness questions. This is particularly relevant in the…

Matrix-vector multiplication is one of the most fundamental computing primitives. Given a matrix $A\in\mathbb{F}^{N\times N}$ and a vector $b$, it is known that in the worst case $\Theta(N^2)$ operations over $\mathbb{F}$ are needed to…