Matrix inversion using decomposition Why do I need $LU$, $QR$ and other matrix decomposition tech to find the inverse of a matrix?
Please if possible provide a ref for the answer.
Thanks in advance

There are two reasons:
1) computational efficiency - number of elementary operations required,
2) numerical stability - exact digits in the results.
The Cramer method, as taught in high school, requires an awfully high number of operations (more than N!, which is huge, O(N^N)). Never use it for N>3.
Other approaches, such a the Jacobi or Gauss methods are much better in this respect, taking "only" O(N³) operations. This is close to optimal, even though the theoretical complexity of matrix inversion is known to be lower (the best estimate is O(N^2.373...)).
The theoretical algorithms are reserved to really big arrays (or are just impractical), but it would be foolish not to use an efficient O(N³) method.
Also, depending on the properties of the algorithms and the condition of the matrices, accuracy can range from poor to excellent. For instance, Gaussian elimination is way better with partial or total pivoting than without. This is an advanced topic which is hard to summarize here.
You can find more information in the books Numerical Recipes (Teukolsy & al.), or Matrix Computations (G. Golub & al.).
It can also be worth to take a look at the manuals of the linear algebra packages available (such as LAPACK, LINPACK... http://en.wikipedia.org/wiki/Comparison_of_linear_algebra_libraries) and check the recommendations on the algorithms to use in different situations.
