Counting A Mode
Gaussian Elimination Given: A system of n linear equations in n unknowns with an arbitrary coefficient matrix. – Transform: An equivalent system of n linear equations in n unknowns with an upper triangular coefficient matrix. – Conquer: Solve the latter by substitutions starting with the last equation and moving up to the first one. Time Complexity is O(n3)
Gaussian elimination is to transform a system of n linear equations with n unknowns to an equivalent system (i.e., a system with the same solution as the original one) with an upper- triangular coefficient matrix, a matrix with all zeros below its main diagonal
Gaussian Elimination
● Exchanging two equations of the system
● Replacing an equation with its nonzero multiple
● Replacing an equation with a sum or difference of this equation and some multiple of another equation