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
-
★★
Conjugate gradient method
Method to compute systems of linear equations whose matrix is symmetric positive-definite
-
R★
Risch algorithm
Algorithm used to compute integrals of functions, especially used in computer algebra systems
-
A★★
Autoregressive conditional heteroskedasticity
Time series model
-
S★
Sherman–Morrison formula
Formula computing the inverse of the sum of a matrix with the outer product of two vectors
-
S★
Sequent calculus
Style of formal logical argumentation
-
★★
Strassen algorithm
First subcubic matrix multiplication algorithm
-
P★
Pledge algorithm
-
★★
DPLL algorithm
Algorithm for solving the CNF-SAT problem
-
C★
Cochran's theorem
Theorem used to justify the appearance of chi-squared distributions in ANOVA
-
e★★
enumeration
Determination of the number of elements in a set
-
H★
Hermite–Lindemann theorem
-
P★
Primitive element theorem
Field theory theorem
-
B★★
Byte-pair encoding
Algorithm for data compression and tokenization that iteratively replaces the most frequent pairs of consecutive bytes or symbols with a new representation
-
★★★
Trachtenberg system
System of rapid mental calculation
-
★★
System of equations
Finite set of equations to be solved simultaneously (as a logical conjunction), possibly for multiple unknowns
-
M★
Midy's theorem
Theorem
-
S★★★
Shor's algorithm
Quantum algorithm for integer factorization
-
★★★★
Algebra
Part of mathematics in which letters and other symbols are used to represent numbers and quantities in formulae and equations