A numerical approximation algorithm that allows longer time steps than an explicit method and is less computationally onerous than a fully implicit method. Algorithms can usually be designed using this compromise method that both allow the longer time step and don't sacrifice numerical accuracy.