I o efficient algorithms for matrix computations

Abstract

Algorithms for large data sets unlike in core algorithms have to keep the bulk of their data in the secondary memory which typically is much slower than the main memory In designing these out of core algorithms the goal is therefore to minimise the number of I Os executed The literature is rich in efficient out of core algorithms for matrix computation But very few of them are designed on the external memory model of Aggarwal and Vitter and as such attempt to quantify their performances