Live briefing
Everything about Bareiss algorithm
Algorithm for determinants of integers
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. 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. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Bareiss algorithmA 5-minute orientation
- Pick up a classic book: Fast algorithms and fast arithmetic in linear algebra (computational complexity)The most-reprinted book on the subject
- Read the landmark paper: On the Stability of the Bareiss and Related Toeplitz Factorization AlgorithmsCited 51 times
- Go sideways: Gaussian eliminationA closely related topic
- Go sideways: DeterminantA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
On the Stability of the Bareiss and Related Toeplitz Factorization Algorithms
A look-ahead Bareiss algorithm for general Toeplitz matrices
Algorithme de Bareiss, algorithme des sous-résultants
From Bareiss' algorithm to the stable computation of partial correlations
A BSP Bareiss Algorithm for Toeplitz Systems
📚 Books worth reading
- 📕Fast algorithms and fast arithmetic in linear algebra (computational complexity)Erwin H Bareiss · 1972
- 📕Fast algorithms and fast arithmetic in linear algebra (computational complexity)Erwin H. Bareiss, Donald Mazukelli · 1972
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Gaussian elimination In mathematics, Gaussian elimination, also known as row reduction, is an algorithm for solving systems of linear equations. It consists of a sequence of…
- Determinant In mathematics, the determinant is a scalar-valued function of the entries of a square matrix that has many properties which make it fundamental for the…
- Computational complexity of matrix multiplication Unsolved problem in computer science What is the fastest algorithm for matrix multiplication? More unsolved problems in computer science In theoretical…
- List of things named after James Joseph Sylvester The mathematician J. J. Sylvester was known for his ability to coin new names and new notation for mathematical objects, not based on his own name. Nevertheless…
- Strassen algorithm In linear algebra, the Strassen algorithm, named after Volker Strassen, is an algorithm for matrix multiplication. It is faster than the standard matrix…
- Matrix multiplication In mathematics, specifically in linear algebra, matrix multiplication is a binary operation that produces a matrix from two matrices. For matrix multiplication…
- Cramer's rule In linear algebra, Cramer's rule is an explicit formula for the solution of a system of linear equations with as many equations as unknowns, valid whenever…
- Computational complexity of mathematical operations The following tables list the computational complexity of various algorithms for common mathematical operations. Here, complexity refers to the time complexity…