Abstract
Sylvester’s identity is a well-known identity that can be used to prove that certain Gaussian elimination algorithms are fraction free. In this paper we will generalize Sylvester’s identity and use it to prove that certain random Gaussian elimination algorithms are fraction free. This can be used to yield fraction free algorithms for solving Ax=b(x≥ 0) and for the simplex method in linear programming.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
