Recently a variant of the additive Schwarz (AS) preconditioner, the restricted additive Schwarz (RAS) preconditioner has been introduced, and numerical experiments showed that RAS converges faster and requires less communication than AS. We show in this paper how RAS, which is defined at the matrix level, can be interpreted as an iteration at the continuous level of the underlying problem. This interpretation reveals why RAS converges faster than classical AS.