## The Gauss-Jordan Method of Finding the Inverse

### Introduction

In order to find the inverse of matrices larger that 2x2, we need a better method. If A is invertible and of size n×n, then we can find the matrix by the following method:

- Set up a matrix [A|I], a n×2n matrix where the left half is A and the right half is the identity matrix size n.
- Perform elementary row operations to reduce the left side to the identity matrix, while also performing those same operations on the right side.
- If A is invertible, when the left side is reduced to the identity matrix, the right side will be A
^{-1}. If the left side cannot be reduced to I, then A is not invertible.

Let's see an example of this below:

### References & Resources

- http://algebra.nipissingu.ca/tutorials/matrices.html

#### Latest Post

- Dependency injection
- Directives and Pipes
- Data binding
- HTTP Get vs. Post
- Node.js is everywhere
- MongoDB root user
- Combine JavaScript and CSS
- Inline Small JavaScript and CSS
- Minify JavaScript and CSS
- Defer Parsing of JavaScript
- Prefer Async Script Loading
- Components, Bootstrap and DOM
- What is HEAD in git?
- Show the changes in Git.
- What is AngularJS 2?
- Confidence Interval for a Population Mean
- Accuracy vs. Precision
- Sampling Distribution
- Working with the Normal Distribution
- Standardized score - Z score
- Percentile
- Evaluating the Normal Distribution
- What is Nodejs? Advantages and disadvantage?
- How do I debug Nodejs applications?
- Sync directory search using fs.readdirSync