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.
Nº Q4860404 ★
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
-
M
Minimax
Decision rule used for minimizing the possible loss for a worst case scenario
Nº Q751319 ★★★
Not listed
-
G
Gauss Jordan elimination
Algorithm
Nº Q1195020 ★★
Not listed
-
C
Cayley transform
Mathematical operation
Nº Q2778065 ★
Not listed
-
F
Frank–Wolfe algorithm
Optimization algorithm
Nº Q2020318 ★
Not listed
-
A
Arity
Fixed number of arguments or operands that a function or operation requires
Nº Q1315869 ★★
Not listed
-
C
Cauchy–Kovalevskaya theorem
Local existence and uniqueness theorem for analytic partial differential equations associated with Cauchy initial value problems
Nº Q1614464 ★
Not listed
-
Naive Bayes classifier
Classification algorithm
Nº Q812530 ★★
Not listed
-
C
Chapman–Kolmogorov equation
Equation
Nº Q722882 ★
Not listed
-
E
Erdős-Sárközy-Szemerédi conjecture
Theorem
Nº Q139818983 ★
Not listed
-
t
théorème de complétude
Nº Q3527186 ★
Not listed
-
Method of complements
Method of subtraction
Nº Q4741052 ★
Not listed
-
Goormaghtigh conjecture
Conjecture
Nº Q593203 ★
Not listed
-
E (mathematical constant)
Mathematical constant; limit of (1 + 1/n)^n as n approaches infinity; transcendental number approximately equal 2.718281828
Nº Q82435 ★★★★★
Not listed
-
Extended Euclidean algorithm
Algorithm for computing the coefficients of Bézout's Identity
Nº Q1362750 ★★
Not listed
-
Xiaolin Wu's line algorithm
First line algorithm with antialiasing
Nº Q2835867 ★
Not listed
-
L
Law of total variance
Theorem
Nº Q1055879 ★★
Not listed
-
Calculus of variations
Differential calculus on function spaces
Nº Q216861 ★★★
Not listed
-
E
Ergodic theorem
Mathematical theorem by George David Birkhoff
Nº Q2735874 ★
Not listed