Related papers: Complexity of Linear Operators

Computing the simulation preorder of a given Kripke structure (i.e., a directed graph with $n$ labeled vertices) has crucial applications in model checking of temporal logic. It amounts to solving a specific two-players reachability game,…

Linear-scaling electronic-structure techniques, also called O(N) techniques, rely heavily on the multiplication of sparse matrices, where the sparsity arises from spatial cut-offs. In order to treat very large systems, the calculations must…

We develop techniques to study the correlation functions of "large operators" whose bare dimension grows parametrically with N, in SO(N) gauge theory. We build the operators from a single complex matrix. For these operators, the large N…

Let $\Omega$ be an operator semigroup with generator $A$ in a sequentially complete locally convex topological vector space $E$. For a semigroup with generator $A+D$, where $D$ is a bounded linear operator on $E$, two integral equations are…

In this paper we construct quantum algorithms for matrix products over several algebraic structures called semirings, including the (max,min)-matrix product, the distance matrix product and the Boolean matrix product. In particular, we…

We study linear operators $T$ on Banach spaces for which there exists a $C_0$-semigroup $(T(t))_{t\geq 0}$ such that $T=T(1)$. We present a necessary condition in terms of the spectral value 0 and give classes of examples where this can or…

For a linearly recurrent vector sequence P[n+1] = A(n) * P[n], consider the problem of calculating either the n-th term P[n] or L<=n arbitrary terms P[n_1],...,P[n_L], both for the case of constant coefficients A(n)=A and for a matrix A(n)…

Can linear systems be solved faster than matrix multiplication? While there has been remarkable progress for the special cases of graph structured linear systems, in the general setting, the bit complexity of solving an $n \times n$ linear…

We develop an algorithm that computes strongly continuous semigroups on infinite-dimensional Hilbert spaces with explicit error control. Given a generator $A$, a time $t>0$, an arbitrary initial vector $u_0$ and an error tolerance…

Let $\mathbb{A}= \begin{pmatrix} A & 0 \\ 0 & A \\ \end{pmatrix} $ be a $2\times2$ diagonal operator matrix whose each diagonal entry is a bounded positive (semidefinite) linear operator $A$ acting on a complex Hilbert space $\mathcal{H}$.…

We develop a finite-dimensional, symmetric matrix framework associated with the Riemann zeta function for complex arguments s with Real(s) unequal 1/2.

The class of quasiseparable matrices is defined by a pair of bounds, called the quasiseparable orders, on the ranks of the maximal sub-matrices entirely located in their strictly lower and upper triangular parts. These arise naturally in…

Let ($\mathcal{H}, \langle . , .\rangle )$ be a complex Hilbert space and $A$ be a positive bounded linear operator on it. Let $w_A(T)$ be the $A$-numerical radius and $\|T\|_A$ be the $A$-operator seminorm of an operator $T$ acting on the…

Understanding the singular value spectrum of a matrix $A \in \mathbb{R}^{n \times n}$ is a fundamental task in countless applications. In matrix multiplication time, it is possible to perform a full SVD and directly compute the singular…

We introduce the numerical spectrum $\sigma_n(A)\subset \mathbb{C}$ of an (unbounded) linear operator $A$ on a Banach space $X$ and study its properties. Our definition is closely related to the numerical range $W(A)$ of $A$ and always…

This is part of an ongoing project to find a general algebraic framework for semiring theory. The structure theory of semirings is quite challenging, largely because of the lack of negation, and such basic properties such as unique…

For a given bounded positive (semidefinite) linear operator $A$ on a complex Hilbert space $\big(\mathcal{H}, \langle \cdot\mid \cdot\rangle \big)$, we consider the semi-Hilbertian space $\big(\mathcal{H}, \langle \cdot\mid \cdot\rangle_A…

We study a Faulty Congested Clique model, in which an adversary may fail nodes in the network throughout the computation. We show that any task of $O(n\log{n})$-bit input per node can be solved in roughly $n$ rounds, where $n$ is the size…

Memoryless computation is a novel means of computing any function of a set of registers by updating one register at a time while using no memory. We aim to emulate how computations are performed on modern cores, since they typically involve…

The matrix chain problem consists in finding the parenthesization of a matrix product $M := A_1 A_2 \cdots A_n$ that minimizes the number of scalar operations. In practical applications, however, one frequently encounters more complicated…