Related papers: Fast linear algebra is stable

We present a method for computing stable models of normal logic programs, i.e., logic programs extended with negation, in the presence of predicates with arbitrary terms. Such programs need not have a finite grounding, so traditional…

An algebraic algorithm is developed for computation of invariants ('generalized Casimir operators') of general Lie algebras over the real or complex number field. Its main tools are the Cartan's method of moving frames and the knowledge of…

Solving linear systems of equations is a frequently encountered problem in machine learning and optimisation. Given a matrix $A$ and a vector $\mathbf b$ the task is to find the vector $\mathbf x$ such that $A \mathbf x = \mathbf b$. We…

We establish sharp regularity estimates for solutions to $Lu=f$ in $\Omega\subset\mathbb R^n$, being $L$ the generator of any stable and symmetric L\'evy process. Such nonlocal operators $L$ depend on a finite measure on $S^{n-1}$, called…

Let $A \in \{0,1\}^{n \times n}$ be a matrix with $z$ zeroes and $u$ ones and $x$ be an $n$-dimensional vector of formal variables over a semigroup $(S, \circ)$. How many semigroup operations are required to compute the linear operator…

We present a general framework for designing efficient algorithms for unsupervised learning problems, such as mixtures of Gaussians and subspace clustering. Our framework is based on a meta algorithm that learns arithmetic circuits in the…

Using Koszmider's strongly unbounded functions, we show the following consistency result: Suppose that $\kappa,\lambda$ are infinite cardinals such that $\kappa^{+++} \leq \lambda$, $\kappa^{<\kappa}=\kappa$ and $2^{\kappa}= \kappa^+$, and…

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…

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)…

What is the time complexity of matrix multiplication of sparse integer matrices with $m_{in}$ nonzeros in the input and $m_{out}$ nonzeros in the output? This paper provides improved upper bounds for this question for almost any choice of…

In our recent work on iterative computation in hardware, we showed that arbitrary-precision solvers can perform more favorably than their traditional arithmetic equivalents when the latter's precisions are either under- or over-budgeted for…

We prove the existence of explicit linear multistep methods of any order with positive coefficients. Our approach is based on formulating a linear programming problem and establishing infeasibility of the dual problem. This yields a number…

We study the awake complexity of graph problems that belong to the class O-LOCAL, which includes a subset of problems solvable by sequential greedy algorithms, such as $(\Delta+1)$-coloring and maximal independent set. It is known from…

Maxmin-$\omega$ dynamical systems were previously introduced as an ``all-in-one package'' that can yield a solely min-plus, a solely max-plus, or a max-min-plus dynamical system by varying a parameter $\omega\in(0,1]$. With such systems in…

It is well known that, using fast algorithms for polynomial multiplication and division, evaluation of a polynomial $F \in \mathbb{C}[x]$ of degree $n$ at $n$ complex-valued points can be done with $\tilde{O}(n)$ exact field operations in…

We investigate linear maps between matrix algebras that remain positive under tensor powers, i.e., under tensoring with $n$ copies of themselves. Completely positive and completely co-positive maps are trivial examples of this kind. We show…

We present a new algorithm for solving an eigenvalue problem for a real symmetric matrix which is a rank-one modification of a diagonal matrix. The algorithm computes each eigenvalue and all components of the corresponding eigenvector with…

Let $\Theta=(\theta_{j,k})_{3\times 3}$ be a non-degenerate real skew-symmetric $3\times 3$ matrix, where $\theta_{j,k}\in [0,1).$ For any $\varepsilon>0$, we prove that there exists $\delta>0$ satisfying the following: if $v_1,v_2,v_3$ are…

This paper proposes uni-orthogonal and bi-orthogonal nonnegative matrix factorization algorithms with robust convergence proofs. We design the algorithms based on the work of Lee and Seung [1], and derive the converged versions by utilizing…

Here is a sample of the results proved in this paper: Let $f:{\bf R}\to {\bf R}$ be a continuous function, let $\rho>0$ and let $\omega:[0,\rho[\to [0,+\infty[$ be a continuous increasing function such that $\lim_{\xi\to…