Common · Knowledge
Bareiss algorithm
Algorithm for calculating determinants
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 of any round-off errors beyond those already present in the input.
From Wikipedia
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 of any round-off errors beyond those already present in the input.
Text: Wikipédia, CC BY-SA 4.0. ·
Related cards
-
D★
Dodgson condensation
Method of computing determinants
-
★
Arithmetic geometry
Branch of algebraic geometry focused on problems in number theory
-
K★
Knuth's Algorithm X
Algorithm for exact cover problem
-
★★★
Simplex algorithm
Algorithm
-
J★
Johnson's algorithm
Algorithm to find shortest paths between all pairs of vertices in a sparse, edge-weighted (possibly negatively), directed graph; uses the Bellman–Ford algorithm to remove negative weights and Dijkstra’s algorithm on the rest
-
★
Bron–Kerbosch algorithm
A recursive backtracking algorithm for finding maximal cliques in an undirected graph