AbstractWe present a fast algorithm for solving m X n systems of linear equations A x = c with at most two variables per equation. The algorithm makes use of a linear-time algorithm for constructing a spanning forest of an undirected graph, and it requires 5m + 2n – 2 arithmetic operations in the worst case
In this thesis we study iterative algorithms with simple sublinear time update steps, and we show ho...
. We present a new algorithm which computes a partial approximate solution for a system of equations...
Given complex numbers w1,..,wn, we define the weight w(X) of a set X of 0-1 vectors as the sum of ov...
An algorithm for the solution of linear systems of equations where the coefficient matrix is diagona...
AbstractWe present a regular algorithm for solving linear systems over the finite field GF(2) from t...
We present an improved algorithm for solving symmetrically diagonally dominant linear systems. On in...
ABSTRACT. Tridiagonal linear systems of equations can be solved on conventional serial machines in a...
In this paper, we present a simple combinatorial algorithm that solves symmetric diagonally dominant...
Let A, B be two arbitrary mnnn , matrices. We present a parallel algorithm to solve the dense line...
Several mesh-based techniques in computer graphics such as shape deformation, mesh editing, animatio...
AbstractAn algorithm for solving m×n systems of (max,+)-linear equations is presented. The systems h...
Abstract1Several algorithms are known that solve a system of m linear inequalities in n variables us...
Linear system solving is a main workhorse in applied mathematics. Recently, theoretical computer sci...
AbstractWe present an algorithm which computes a minimal length solution of a system of two linear d...
AbstractIn this paper we present two efficient algorithms for the parallel solution of n × n dense l...
In this thesis we study iterative algorithms with simple sublinear time update steps, and we show ho...
. We present a new algorithm which computes a partial approximate solution for a system of equations...
Given complex numbers w1,..,wn, we define the weight w(X) of a set X of 0-1 vectors as the sum of ov...
An algorithm for the solution of linear systems of equations where the coefficient matrix is diagona...
AbstractWe present a regular algorithm for solving linear systems over the finite field GF(2) from t...
We present an improved algorithm for solving symmetrically diagonally dominant linear systems. On in...
ABSTRACT. Tridiagonal linear systems of equations can be solved on conventional serial machines in a...
In this paper, we present a simple combinatorial algorithm that solves symmetric diagonally dominant...
Let A, B be two arbitrary mnnn , matrices. We present a parallel algorithm to solve the dense line...
Several mesh-based techniques in computer graphics such as shape deformation, mesh editing, animatio...
AbstractAn algorithm for solving m×n systems of (max,+)-linear equations is presented. The systems h...
Abstract1Several algorithms are known that solve a system of m linear inequalities in n variables us...
Linear system solving is a main workhorse in applied mathematics. Recently, theoretical computer sci...
AbstractWe present an algorithm which computes a minimal length solution of a system of two linear d...
AbstractIn this paper we present two efficient algorithms for the parallel solution of n × n dense l...
In this thesis we study iterative algorithms with simple sublinear time update steps, and we show ho...
. We present a new algorithm which computes a partial approximate solution for a system of equations...
Given complex numbers w1,..,wn, we define the weight w(X) of a set X of 0-1 vectors as the sum of ov...
DOI
Add to ORKG