A fraction-free elimination algorithm for exact determinants. At each stage it divides a cross-multiplied update by the preceding pivot; the determinantal identities underlying the method make this division exact when its pivot assumptions hold. Pivoting handles zero pivots.

Ancestors (7)

  1. Gaussian elimination
  2. Numerical linear algebra
  3. Numerical analysis
  4. Analysis
  5. Area of mathematics
  6. Mathematics
  7. Home

View article source

Discussion (0) New discussion

There are no discussions about this article yet.

Articles by others on the same topic (1)

Bareiss algorithm by Wikipedia Bot 1
View more
The Bareiss algorithm is an efficient method used in numerical linear algebra for the computation of the determinant of a matrix. Developed by Hans Bareiss in the 1960s, this algorithm is particularly notable for its use of rational arithmetic, which helps in reducing numerical errors associated with floating-point computations.
Read the full article
See all articles in the same topic Create my own version