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.
Facts
Time Complexity
Time Complexity (category) Connections
In Field
Source Bareiss algorithm (Wikipedia)
Sources
1. Wikidata: Bareiss Algorithm
- Wikidata Q4860404, class allow-list match (w-wdresolver-0926)
- Bareiss algorithm: avoids O(n!) naive cofactor blowup, runs in O(n^3)
View the SourceBareiss algorithm (Wikipedia)
In Field: Computational Science, Lead sentenceQuote, In Field: Computational Science, Lead sentence
Bareiss algorithm, named after Erwin Bareiss, is an algorithm to calculate the determinant or the echelon form of a matrix with integer entries using only integer arithmetic; any divisions that are performed are guaranteed to be exact (there is no remainder).
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.