bookmark this page - make qweas your homepage | ||
Help Center - What's New - Newsletter - Press | ||
Get Buttons - Link to Us - Feedback - Contact Us |
Home | Download | Store | New Releases | Most Popular | Editor Picks | Special Prices | Rate | News | FAQ |
|
Inverse Matrices 1.03 - User Guide and FAQScreenshots - More Details
The extended Gauss-Jordan algorithmThe Gauss-Jordan algorithm with the extensions used by the program is illustrated below. We denote by aij the entry in a matrix located in the i-th row and the j-th column.Suppose that we want to find the inverse matrix of a 3x3 matrix (the other cases are similar). First we reduce the entered common fractions. For example, 3/3 reduces to 1 and 3/6 reduces to 1/2. Then we reduce the block matrix to reduced row echelon form by using the elementary row operations. If during the reduction process we arrive at a block matrix such that all entries in a row (or a column) of the left part of the block matrix are 0's, we conclude that the left part of the block matrix cannot be reduced to the identity matrix. We make conclusion that the given matrix has no inverse matrix. First we canonize the first column by using a11, then we canonize the second one by using a22 and so on. Frequently Asked Questions - Inverse Matrices
Screenshots - More Details |
Search -
Download -
Store -
Directory -
Service -
Developer Center
© 2006 Qweas Home - Privacy Policy - Terms of Use - Site Map - About Qweas |