#
Bareiss algorithm
^{en}

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. The method can also be used to compute the determinant of matrices with 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 value 2ᴸ for each entry, the Bareiss algorithm runs in O elementary operations with an O bound on the absolute value of intermediate values needed. Its computational complexity is thus O when using elementary arithmetic or O by using fast multiplication. [ - ]

# Freebase Commons Metaweb System Types /type

- -

- Bareiss algorithm

- /wikipedia/es_id/671647
- /wikipedia/es/Metodo_Montante
- /wikipedia/es_title/M$00E9todo_Montante
- /wikipedia/es/M$00E9todo_Montante
- /wikipedia/en/Bareiss_algorithm
- /wikipedia/en_id/17919686
- /wikipedia/en/Bareiss_Algorithm
- /en/bareiss_algorithm
- /wikipedia/en/Montante$0027s_method
- /wikipedia/en_title/Bareiss_algorithm
- /wikipedia/pl/Metoda_Montantego
- /wikipedia/uk_title/$041C$0435$0442$043E$0434_$041C$043E$043D$0442$0430$043D$0442$0435
- /wikipedia/uk/$041C$0435$0442$043E$0434_$041C$043E$043D$0442$0430$043D$0442$0435
- /wikipedia/pl_title/Algorytm_Bareissa
- /wikipedia/uk_id/855142
- /wikipedia/pl_id/2326496
- /wikipedia/pl/Algorytm_Bareissa

- -