Linear Algebra: Gaussian Elimination

in mathematics •  7 years ago 


Now that we know RREF and REF for a given matrix, and how we can apply elementary row operations, the next step is to develop a procedure to obtain either RREF or REF from a starting matrix.

The Gaussian Elimination procedure I will show you here will reduce a given matrix to its Row Echelon Form. This elimination procedure is advantageous when we have small linear systems in which we can use backwards-substitution to solve (more on this later). It's downside? It is not a unique form. This means that we could get two different REFs for a given starting matrix!


▶️ DTube
▶️ IPFS
Authors get paid when people like you upvote their post.
If you enjoyed what you read here, create your account today and start earning FREE STEEM!
Sort Order:  

Congratulations @pencentre! You received a personal award!

1 Year on Steemit

Click here to view your Board

Do not miss the last post from @steemitboard:

SteemWhales has officially moved to SteemitBoard Ranking
SteemitBoard - Witness Update

Support SteemitBoard's project! Vote for its witness and get one more award!

Congratulations @pencentre! You received a personal award!

Happy Birthday! - You are on the Steem blockchain for 2 years!

You can view your badges on your Steem Board and compare to others on the Steem Ranking

Vote for @Steemitboard as a witness to get one more award and increased upvotes!