We normally eliminate the diagonal element and the associated variable.
For systems with non-zero diagonals, it should work well most of the time except when the diagonal element is non-zero but its absolute value is very small. This can cause numerical loss of accuracy in the final solution.
There are algorithms which would interchange rows to create a strong diagonal, thereby minimizing numerical inaccuracies.
When using the elimination method does it matter which variable you choose to eliminate? How do you write the solution to represent the point if intersection?
I guess it doesnt matter
2 answers
ain't nobody understand what you just said