论文信息 - Certified sparse linear system solving

Certified sparse linear system solving

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.

Thom Mulders | T. Mulders

[1] Mark Giesbrecht,et al. Efficient parallel solution of sparse systems of linear diophantine equations , 1997, PASCO '97.

[2] Douglas H. Wiedemann. Solving sparse linear equations over finite fields , 1986, IEEE Trans. Inf. Theory.

[3] B. D. Saunders,et al. Efficient matrix preconditioners for black box linear algebra , 2002 .

[4] B. David Saunders,et al. Certifying inconsistency of sparse linear systems , 1997, SIGS.

[5] Charles R. Johnson,et al. Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[6] Erich Kaltofen,et al. On Wiedemann's Method of Solving Sparse Linear Systems , 1991, AAECC.

[7] Arne Storjohann,et al. Certified dense linear system solving , 2004, J. Symb. Comput..