We propose a new decomposition method for large-scale linear programming. This method dualizes an (arbitrary) subset of the constraints and then maximizes the resulting dual functional by dual ascent.

In this paper, we present an accelerated simulation approach on waveform relaxation using Krylov subspace for a large time-dependent system composed of some subsystems. This approach first allows ...