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
-
C
Computational complexity
Measure of the amount of resources needed to run an algorithm or solve a computational problem
Nº Q5157286 ★★★
Not listed
-
Algorism
Mathematical technique for arithmetic
Nº Q864014 ★
Not listed
-
H
Halley's method
Method of numerically finding roots of a function
Nº Q1476051 ★
Not listed
-
Heron's method
Heron's method of calculating a square root
Nº Q20725439 ★★★
Not listed
-
R
Robinson arithmetic
Finitely axiomatized fragment of first-order Peano arithmetic that is recursively incompletable (in the sense of Gödel’s incompleteness theorems) and essentially undecidable
Nº Q928884 ★
Not listed
-
Dirichlet convolution
Convolution operation defined on complex‐valued functions over positive integers
Nº Q6453184 ★
Not listed
-
H
Heun's method
The numerical procedure for solving ordinary differential equations with a given initial value created by Karl Heun.
Nº Q1531998 ★
Not listed
-
Fundamental theorem of algebra
Every polynomial has a real or complex root
Nº Q192760 ★★★★★
Not listed
-
Crank–Nicolson method
Finite difference method for numerically solving parabolic differential equations
Nº Q588725 ★
Not listed
-
C
Carothers equation
Equation
Nº Q900716 ★
Not listed
-
E
Erdős conjecture on arithmetic progressions
Characterization of large sets
Nº Q1991239 ★
Not listed
-
Rectangle method
Numerical integration method
Nº Q645754 ★★
Not listed
-
ID3 algorithm
Decision tree algorithm
Nº Q1653378 ★
Not listed
-
W
Waring's problem
Problem in number theory
Nº Q657903 ★
Not listed
-
Frobenius method
Method for solving ordinary differential equations
Nº Q1340153 ★★
Not listed
-
N
Non-negative matrix factorization
Algorithms for matrix decomposition
Nº Q10843505 ★
Not listed
-
Covariance
Measure of the joint variability of two random variables
Nº Q201984 ★★★
Not listed
-
Q
QR decomposition
Matrix decomposition
Nº Q653242 ★★★
Not listed