The Bareiss algorithm, named after Erwin Bareiss, is a mathematical algorithm for calculating the determinant or the echelon form of a matrix with integer entries using only integer arithmetic, guaranteeing that any division performed is exact with no remainder. The method can also be applied to matrices with approximated real entries, avoiding the introduction of round-off errors beyond those already present in the input.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.