About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Paper
Acceleration by aggregation of successive approximation methods
Abstract
Methods of successive approximation for solving linear systems or minimization problems are accelerated by aggregation-disaggregation processes. These processes, which modify the iterates being produced, are characterized by a two directional flow of information between the original higher dimensional problem and a lower dimensional aggregated version. This technique is characterized by means of Galerkin approximations, and this in turn permits analysis of the method. A deterministic as well as probabilistic analysis is given of a number of specific aggregation-disaggregation examples. Numerical experiments have been performed, and these confirm the analysis and demonstrate the acceleration. © 1982.