Publication View

An Explicit Construction of Gauss-Jordan Elimination Matrix (2009)

Abstract
A constructive approach to get the reduced row echelon form of a given matrix $A$ is presented. It has been shown that after the $k$th step of the Gauss-Jordan procedure, each entry $a^k_{ij}(ij; j > k)$ in the new matrix $A^k$ can always be expressed as a ratio of two determinants whose entries are from the original matrix $A$. The new method also gives a more general generalization of Cramer's rule than existing methods.

Publication details
Download http://arxiv.org/abs/0907.5038
Repository arXiv (United States)
Keywords Computer Science - Symbolic Computation, Computer Science - Numerical Analysis
Type text