In mathematics, the 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). The method can also be used to compute the determinant of matrices with (approximated) real entries, avoiding the introduction any round-off errors beyond those already present in the input.
During the execution of Bareiss algorithm, every integer that is computed is the determinant of a submatrix of the input matrix. This allows, using Hadamard inequality, to bound the size of these integers. Otherwise, Bareiss algorithm may be viewed as a variant of Gaussian elimination and needs roughly the same number of arithmetic operations.
It follows that, for an n × n matrix of maximum (absolute) value 2L for each entry, the Bareiss algorithm runs in O(n3) elementary operations with an O(n n/2 2nL) bound on the absolute value of intermediate values needed. Its computational complexity is thus O(n5L2 (log(n)2 + L2)) when using elementary arithmetic or O(n4L (log(n) + L) log(log(n) + L))) by using fast multiplication.
The general Bareiss algorithm is distinct from the Bareiss algorithm for Toeplitz matrices.
- Bareiss, Erwin H. (1968), Sylvester's Identity and multistep integer-preserving Gaussian elimination, Mathematics of Computation 22 (102): 565–578, doi:10.2307/2004533.
|This algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it.|