A simple recursive method is proposed for the computation of the solution to the bilinear matrix equation. Algorithms are presented for both continuous and discrete time bilinear matrix equations. The method is based on an extension of the Astrom-Jury-Agniel algorithm. The proposed technique is illustrated by numerical examples and is compared in terms of efficiency against the Bartels-Stewart method.