AbstractA Las Vegas randomized algorithm for solving sparse linear systems over principal ideal domains is described. The algorithm returns a minimal-denominator solution accompanied by a certificate for its minimality or, if no solution exists, a certificate for the inconsistency of the system. The algorithm works for domains of any size, without need of ring extensions
A multi-level method for the solution of sparse linear systems is introduced. The definition of the ...
AbstractUsing predicate logic, the concept of a linear problem is formalized. The class of linear pr...
A vector with at most k nonzeros is called k-sparse. We show that enumerating the support vectors of...
AbstractA Las Vegas randomized algorithm for solving sparse linear systems over principal ideal doma...
AbstractA randomized algorithm is given for solving a system of linear equations over a principal id...
In (Wiedemann, 1986) an algorithm is described for solving sparse lin- ear systems over nite elds. W...
The following problems related to linear systems are studied: finding a diophantine solution; findin...
We consider the problem of approximate solution ex of a linear system Ax = b over the reals, such th...
this paper is to remove this possibility of error with about the same cost. The principle new idea r...
Abstract. Numerical linear algebra and combinatorial optimization are vast subjects; as is their int...
We give a new theoretical tool to solve sparse systems with finitely many solutions. It is based on ...
International audienceComputational problem certificates are additional data structures for each out...
AbstractWe consider the problem of approximate solution x̄ of of a linear system Ax = b over the rea...
SIGLEAvailable from British Library Document Supply Centre- DSC:4335.26205(HPL--92-167) / BLDSC - Br...
Large sparse linear system of equations arise in many areas of science and engineering. Although, th...
A multi-level method for the solution of sparse linear systems is introduced. The definition of the ...
AbstractUsing predicate logic, the concept of a linear problem is formalized. The class of linear pr...
A vector with at most k nonzeros is called k-sparse. We show that enumerating the support vectors of...
AbstractA Las Vegas randomized algorithm for solving sparse linear systems over principal ideal doma...
AbstractA randomized algorithm is given for solving a system of linear equations over a principal id...
In (Wiedemann, 1986) an algorithm is described for solving sparse lin- ear systems over nite elds. W...
The following problems related to linear systems are studied: finding a diophantine solution; findin...
We consider the problem of approximate solution ex of a linear system Ax = b over the reals, such th...
this paper is to remove this possibility of error with about the same cost. The principle new idea r...
Abstract. Numerical linear algebra and combinatorial optimization are vast subjects; as is their int...
We give a new theoretical tool to solve sparse systems with finitely many solutions. It is based on ...
International audienceComputational problem certificates are additional data structures for each out...
AbstractWe consider the problem of approximate solution x̄ of of a linear system Ax = b over the rea...
SIGLEAvailable from British Library Document Supply Centre- DSC:4335.26205(HPL--92-167) / BLDSC - Br...
Large sparse linear system of equations arise in many areas of science and engineering. Although, th...
A multi-level method for the solution of sparse linear systems is introduced. The definition of the ...
AbstractUsing predicate logic, the concept of a linear problem is formalized. The class of linear pr...
A vector with at most k nonzeros is called k-sparse. We show that enumerating the support vectors of...
DOI
Add to ORKG