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.
Publication
Computing
Paper
An abstract theory for the domain reduction method
Abstract
The domain reduction method uses a finite group of symmetries of a system of linear equations arising by discretization of partial differential equations to obtain a decomposition into independent subproblems, which can be solved in parallel. This paper develops a theory for this class of methods based on known results from group representation theory and algebras of finite groups. The main theoretical result is that if the problem splits into subproblems based on isomorphic subdomains, then the group of symmetries must be commutative. General decompositions are then obtained by nesting decompositions based on commutative groups of symmetries. © 1992 Springer-Verlag.