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
-
L★
Lagrange equation
Equation
-
★★
Picard–Lindelöf theorem
Theorem on existence and uniqueness of solutions to first-order equations with given initial conditions
-
★★★
Square root of 2
Unique positive real number which when multiplied by itself gives 2
-
C★★
Characteristic (algebra)
In a field or a ring, the smallest positive integer, if any, such that the sum of n ones equals 0; zero otherwise
-
★★★
Euclidean algorithm
Algorithm for computing greatest common divisors
-
H★★
Hilbert's tenth problem
Mathematics problem
-
★
Rijndael
Cryptographic algorithm
-
s★★
sum-product method
Factoring by grouping
-
★★
Cooley–Tukey FFT algorithm
Fast Fourier Transform algorithm
-
★
Eisenstein integer
Complex number whose mapping on a coordinate plane produces a triangular lattice
-
★★★★
Arithmetic
Elementary branch of mathematics
-
t★
théorème porte-manteau
-
S★
Space complexity
Amount of memory space that an algorithm uses as a function of the input's size
-
F★★
Ferrari's method
-
★★★
Merge sort
Worst-case optimal stable divide and conquer comparison sorting algorithm
-
★★
Kruskal–Wallis test
Non-parametric method for testing whether samples originate from the same distribution
-
P★
Powerset construction
Method for converting a nondeterministic finite automaton into a deterministic one
-
★★★
Sieve of Eratosthenes
Ancient algorithm for generating prime numbers