A parallel algorithm design approach in which the data is divided into pieces and then computations are associated with the data. This contrasts to 'functional decomposition', in which tasks or computations are divided first, then data is associated to them.

Domain decomposition methods are employed in the solution of partial differential equations, frequently on parallel computers, by subdividing the problem domain and solving each piece individually.