Details:
Title | Certified sparse linear system solving | Author(s) | Thom Mulders | Type | Article in Journal | Abstract | A 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. | Keywords | Sparse matrix, Linear system, Diophantine system, Wiede mann, Preconditioning, Finite field, Principal ideal domain, Minimal solution | ISSN | 0747-7171 |
URL |
http://www.sciencedirect.com/science/article/pii/S0747717104000616 |
Language | English | Journal | Journal of Symbolic Computation | Volume | 38 | Number | 5 | Pages | 1343 - 1373 | Year | 2004 | Edition | 0 | Translation |
No | Refereed |
No |
|