This chapter is devoted to the notion of partial matrix multiplication. First, we present a particular partial matrix multiplication algorithm. Then we show a general methodology that allows to transform any partial matrix multiplication algorithm into a total (in practice, simply the classical) one. We also review recent specialised optimisation results, interestingly published later than the methods presented in this chapter, necessary to construct the fastest possible transformation.