Classification,+Comparison+and+contrast+-+Version+2

Classification: **(Matrixes or A matrix)** Matrix can be divided in a lot of groups depending on their properties, __it ´ s__ **do not use contractions** __dificult__ to create disjoint **is the next part supposed to continue here??? Otherwise it does not make sense.** __Partition__ of the matrix set. **Capitalize!!** __t__ he first two big groups we can talk about are the singular and nonsingular matrix **ES** , __singular matrix are those__ **agreement singular and plural all together....** w **H** ich has an inverse, and non-singular are those __who__ **Who is only for people** don ´ t.

Inside the singular matrix subset we can find a lot of subgroups such as: - Upper triangular matrix. -Lower triangular matrix. -Diagonal matrix, among others.

Inside the non-singular matrix we can find the following subsets: - The matrix wich has left inverse. - The matrix wich has right inverse. - Those who don ´ t have __ethir__ of them. (remenber that invertible matrix must have right and left inverse).

Comparing __this__ two subsets of the matrix spaces can ilustrate the real __diference__ between them:

-For example diagonal matrix from a computational point of view are easy to operate with, since they are mostly formed by 0, in the case of the non-singular matrix usually before using any kind of operations in them the computer must check its size since you __dont__ have __garatie__ of its elements using any properties over them can result in a lot of computational time.

-From a teorical point of view there are many __case__ in __wich__ you __dont__ really have to know the exact solution of a system of equation, you just have to know that there exist, if you have the __garatie__ that the matrix is invertible you know that the system has __an__ unique solution, in the set of the non-singular matrix you can ´ t say for certain if the system has a solution.