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
-
Bootstrap aggregating
Ensemble method within machine learning
Nº Q799897 ★
Not listed
-
Knuth–Morris–Pratt algorithm
String searching algorithm
Nº Q45285 ★★
Not listed
-
S
Sequential quadratic programming
Optimization algorithm
Nº Q4373881 ★
Not listed
-
N
Nagle's algorithm
Algorithm
Nº Q668945 ★
Not listed
-
Interior-point method
Algorithms for solving convex optimization problems
Nº Q461992 ★
Not listed
-
Nelder–Mead method
Numerical optimization algorithm
Nº Q1253278 ★★
Not listed
-
G
General number field sieve
Integer factorization algorithm
Nº Q140770 ★
Not listed
-
Elementary arithmetic
Collective term for the four mathematical operations of addition, subtraction, multiplication and division
Nº Q7214750 ★★★
Not listed
-
P
Pollard's rho algorithm
Algorithm
Nº Q946489 ★
Not listed
-
R
Rayleigh–Ritz method
Method for approximating eigenvalues
Nº Q852247 ★
Not listed
-
R
Ramer–Douglas–Peucker algorithm
Line simplification algorithm
Nº Q1251950 ★★★
Not listed
-
Schönhage–Strassen algorithm
Multiplication algorithm
Nº Q1938391 ★
Not listed
-
Logarithm
Inverse of the exponential function, which maps products to sums
Nº Q11197 ★★★★
Not listed
-
Thompson sampling
Heuristic for choosing actions that addresses the exploration-exploitation dilemma in the multi-armed bandit problem
Nº Q7795822 ★★
Not listed
-
P
Polynomial arithmetic
A branch of algebra dealing with properties of polynomials
Nº Q1238474 ★
Not listed
-
Computable set
Set where an algorithm can take a number as an input and can decide whether the number belongs to the set
Nº Q877945 ★★
Not listed
-
Algebraic number theory
Major branch of number theory
Nº Q613048 ★★
Not listed
-
Calculus ratiocinator
Theoretical universal logical calculation framework
Nº Q577001 ★
Not listed