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
-
J★
Jacobi's formula
Formula for the derivative of the determinant of a matrix
-
M★
Method of undetermined coefficients
Approach for finding solutions of nonhomogeneous ordinary differential equations
-
L★★
Lanczos algorithm
Numerical method for find eigenvalues
-
★
Von Mises distribution
Continuous probability distribution on the circle
-
R★
Riemannian metric
Positive-definite metric tensor
-
★★★
Algorithmics
Study of algorithms and data structures
-
H★★
Hartree–Fock method
Method of approximation for the determination of the wave function and the energy of a quantum many-body system in a stationary state
-
K★
Kabsch algorithm
Type of algorithm
-
★★
Möbius function
Multiplicative function in number theory
-
J★★
Jacobi method
Iterative method used to solve a linear system of equations
-
★
Walsh function
Concept in mathematics
-
L★
Leibniz formula for determinants
Mathematics formula
-
★★
Rule of Sarrus
Mnemonic rule for evaluating the determinant of 3x3 matrices
-
E★★
Exponentiation by squaring
Algorithm
-
★
Odd–even sort
Sorting algorithm that repeatedly compares all odd/even indexed pairs of adjacent elements in the list, swapping misordered pairs
-
E★★
Exponential backoff
Rate-seeking algorithm
-
N★
Neuroevolution of augmenting topologies
Genetic algorithm for the generation of evolving artificial neural networks developed by Ken Stanley in 2002
-
l★★
lemme des noyaux