In this paper, estimations of the lower solution bounds for the discrete algebraic Lyapunov Equation (the DALE) are addressed. By utilizing linear algebraic techniques, several new lower solution bounds of the DALE are presented. We also propose numerical algorithms to develop sharper solution bounds. The obtained bounds can give a supplement to those appeared in the literature.