@conference {15789,
	title = {Preconditioning parallel multisplittings for solving linear systems of equations},
	booktitle = {Proceedings of the 6th international conference on Supercomputing},
	series = {ICS {\textquoteright}92},
	year = {1992},
	month = {1992///},
	pages = {478 - 484},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {We consider the practical implementation of Krylov subspace methods (conjugate gradients, GMRES, etc.) for parallel computers in the case where the preconditioning matrix is a multisplitting. The algorithm can be efficiently implemented by dividing the work into tasks that generate search directions and a single task that minimizes over the resulting subspace. Each task is assigned to a subset of processors. It is not necessary for the minimization task to send information to the direction generating tasks, and this leads to high utilization with a minimum of synchronization. We study the convergence properties of various forms of the algorithm.},
	isbn = {0-89791-485-6},
	doi = {10.1145/143369.143454},
	url = {http://doi.acm.org/10.1145/143369.143454},
	author = {Huang,Chiou-Ming and O{\textquoteright}Leary, Dianne P.}
}
