A partial matrix over a field F is a matrix whose entries are either an element of F or an indeterminate and with each indeterminate only appearing once. A completion is an assignment of values in F to all indeterminates. Given a partial matrix, through elementary row operations and column permutation it can be decomposed into a block matrix of the formwhere W is wide (has more columns than rows), S is square, T is tall (has more rows than columns), and these three blocks have at least one completion with full rank. And importantly, each one of the blocks W, S and T is unique up to elementary row operations and column permutation whenever S is required to be as large as possible. When this is the case W * * 0 S * 0 0 T will be called a WST-decomposition. With this decomposition it is trivial to compute maximum rank of a completion of the original partial matrix: rows(W) + rows(S) + cols(T). In fact we introduce the WST-decomposition for a broader class of matrices: the ACI-matrices.