A stability analysis is carried out for a new family of implicit-explicit finite-element algorithms. The analysis shows that unconditional stability may be achieved for the implicit finite elements and that the critical time step of the explicit elements governs for the system.