A system of linear equations is a collection of twoor more linear equations involving the same set of variables. The word system indicates that the equations are to be considered collectively, rather than individually. In mathematics, the theory of linear systems is the basis and fundamental part of linear algebra, a subject which is used in most part of modern mathematics. Computational algorithms for finding the solutions are an important part of numerical linear algebra, and play a prominent role in engineering, physics,chemistry,computer science, and economics. While system of three or four equations can be readily solved by hand but the system is large number of equation it has to take a number steps solve the equations and it will take lot of time and memory space. Matrix is the one of completely different approach to solve the large set of linear equation. Matrix can be solved twice as fast with the linear equation. In this paper we have given a Matrix Representation Theorem (MRT), Rank theorem. This idea is to start with an initial approximation to the solution and to change this approximation in several steps to bring it closer to the true solution. Once the approximation is sufficiently accurate, this is taken to be the solution to the system.
Volume 11 | 08-Special Issue
Pages: 488-496