Matrix presentation and operations have been examined for a long time. In the conventional approach, the primary objetive is the minimization of the number of operations required by the algorith. Here, our aim is minimizing the number the page swaps between the main and the external memory in paged memory system. a carefully designed matrix algorithm can lead to substantial saving in the number of page faults especially when a small part of the total matrix can be held in the main memory at one time.