A Krylov multisplitting algorithm for solving linear systems of equations

It is shown that the Krylov subspace methods can be efficiently implemented by dividing the work into tasks that generate search directions and a single task that minimizes over the resulting subspace, which leads to high utilization with a minimum of synchronization.