A method and structure for executing a matrix algorithm requiring an order of N.sup.3 operations including data reformatting operations, where N is a dimension of an operand of said algorithm on a computer, includes initially reformatting data for at least one matrix used in the matrix algorithm into a data structure stored in a memory, such that stride one data is presented for all submatrices used as operands involved in the matrix algorithm in a format required by the matrix algorithm with substantially no further data re-formatting beyond an order N data re-formatting required for executing the algorithm.
U.S. GOVERNMENT RIGHTS IN THE INVENTION
 This invention was made with Government support under Contract No. B517552, awarded by the United States Department of Energy. The Government has certain rights in this invention.