I will present some recently developed algorithms for solving fundamental matrix problems in Computational Algebra. The algorithms not only have very good asymptotic complexity, but perform extremely well in practice (they have been implemented within Magma). Emphasis will be on matrices over finite fields, the integers and the rationals, and I will present a very new fast algorithm for computing the Hermite Normal Form of an integer matrix.