A generalized sylvester identity and fraction-free random Gaussian elimination

Authors
Mulders, T
Citation
T. Mulders, A generalized sylvester identity and fraction-free random Gaussian elimination, J SYMB COMP, 31(4), 2001, pp. 447-460
Citations number
8
Categorie Soggetti
Engineering Mathematics
Journal title
JOURNAL OF SYMBOLIC COMPUTATION
ISSN journal
07477171 → ACNP
Volume
31
Issue
4
Year of publication
2001
Pages
447 - 460
Database
ISI
SICI code
0747-7171(200104)31:4<447:AGSIAF>2.0.ZU;2-M
Abstract
Sylvester's identity is a well-known identity that can be used to prove tha t certain Gaussian elimination algorithms are fraction free. In this paper we will generalize Sylvester's identity and use it to prove that certain ra ndom Gaussian elimination algorithms are fraction free. This can be used to yield fraction free algorithms for solving Ax = b (x greater than or equal to 0) and for the simplex method in linear programming. (C) 2001 Academic Press.