Mario Blaum, John L. Fan, et al.
IEEE International Symposium on Information Theory - Proceedings
We study a class of methods for accelerating the convergence of iterative methods for solving linear systems. The methods proceed by replacing the given linear system with a derived one of smaller size, the aggregated system. The solution of the latter is used to accelerate the original iterative process. The construction of the aggregated system as well as the passage of information between it and the original system depends on one or more approximations of the solution of the latter. A number of variants are introduced, estimates of the acceleration are obtained, and numerical experiments are performed. The theory and computations show the methods to be effective. © 1980.
Mario Blaum, John L. Fan, et al.
IEEE International Symposium on Information Theory - Proceedings
Nimrod Megiddo
Journal of Symbolic Computation
Kenneth L. Clarkson, K. Georg Hampel, et al.
VTC Spring 2007
Robert Manson Sawko, Malgorzata Zimon
SIAM/ASA JUQ