That depends on what you are doing (I have no idea about your application). But a priori filling with zeros does imo make sense. A $n\times m$ matrix can be understood as a linear map $\mathbb R^m\to \mathbb R^n$. Here you have $n=13. You have two options now which eventually should give the same result.
First you realise that you can perform row and column operations to reduce your matrix to a non-trivial $13\times 13$ matrix and a $13\times 3$ block of zeros. This means that you split the bigger $\mathbb R^m$ into two subspaces, one of dimension $3$ which is mapped to $0$ and one of dimension $13$ which still maps surjectively on the image of the original linear map. All information is then concentrated in the $13\times 13$ block and this should give you some information.
Or you fill the matrix with zeros to get a $16\times 16$ matrix. This corresponds to changing your target space where the additional dimensions are not hit by your map. The image will then still live in a $13$-dimensional subspace of $\mathbb R^{16}$. But diagonalising will give you a nontrivial $13\times 13$ block in the $16\times 16$ matrix again. This will look like the $13\times 13$ block as above.
Edit: Just a comment on a possible application (I still don't get it, and won't without spending a lot more time on it, whcih I won't;P ). All row and column operations perform base changes on the source or the target. This somehow assumes that all dimensions have equal rights. So if all dimensions correspond to positions for example, then changing the base will just correspond to a coordinate change. If some dimensions correspond to positions and some, say, to velocities you will end up with mixed expressions after changing your base. This might or might not make sense.