The linear and space-invariant convolution

of a matrix

with the kernel (impulse response, point spread function) matrix

is modeled as a linear matrix equation of the form

. Under periodicity assumptions on matrix

analytical and numerical solution methods of the 2-D inverse filtering problem are presented jointly with an analysis of the computational complexity and convergence conditions. As a consequence of this new matrix approach, the discrete Fourier transform (DFT) method is derived as a particular case of more powerful algebraic operators to solve general matrix equations.