Numerical Exploitation of Equivariance

Linear operators in equations describing physical problems on a symmetric domain often are also equivariant, which means that they commute with its symmetries, i.e., with the group of orthogonal transformations which leave the domain invariant. Under suitable discretizations the resulting system matrices are also equivariant with respect to a group of permutations. Methods for exploiting this equivariance in the numerical solution of linear systems of equations and eigenvalue problems via symmetry reduction are described. A very significant reduction in computational expense can be obtained in this way. The basic ideas underlying this method and its analysis involve group representation theory. The symmetry reduction method is complicated somewhat by the presence of nodes or elements which remain fixed under some of the symmetries. Two methods (regularization and projection) for handling such situations are described. The former increases the number of unknowns in the symmetry reduced system, the latter does not but needs more overhead. Some examples are given to illustrate this situation. Our methods circumvent the explicit use of symmetry adapted bases, but our methods can also be used to automatically generate such bases if they are needed for some other purpose. A software package has been posted on the internet.

[1]  T. Healey.  Global Bifurcations and Continuation in the Presence of Symmetry with an Application to Solid Mechanics , 1988 .

[2]  A. Spence,et al.  THE COMPUTATION OF SYMMETRY-BREAKING BIFURCATION POINTS* , 1984 .

[3]  Belingeri Carlo,et al.  A generalization of the discrete fourier transform , 1995 .

[4]  K. Georg,et al.  Exploiting Symmetry in Solving Linear Equations , 1992 .

[5]  Johannes Tausch,et al.  A GENERALIZED FOURIER TRANSFORM FOR BOUNDARY ELEMENT METHODS WITH SYMMETRIES , 1998 .

[6]  T. Healey,et al.  Exact block diagonalization of large eigenvalue problems for structures with symmetry , 1991 .

[7]  Jean-Pierre Serre,et al.  Linear representations of finite groups , 1977, Graduate texts in mathematics.

[8]  Barry F. Smith,et al.  Using symmetrics and antisymmetrics to analyze a parallel multigrid algorithm: the elliptic boundary value problem case , 1989 .

[9]  M. Golubitsky,et al.  Singularities and Groups in Bifurcation Theory: Volume I , 1984 .

[11]  A. Fässler,et al.  Group Theoretical Methods and Their Applications , 1992 .

[12]  T. Healey.  A group-theoretic approach to computational bifurcation problems with symmetry , 1988 .

[13]  M. Dellnitz,et al.  Computational methods for bifurcation problems with symmetries—with special attention to steady state and Hopf bifurcation points , 1989 .

[14]  Johannes Tausch,et al.  Equivariant Preconditioners for Boundary Element Methods , 1996, SIAM J. Sci. Comput..

[15]  Alain Bossavit,et al.  Boundary Value Problems with Symmetry and Their Approximation by Finite Elements , 1993, SIAM J. Appl. Math..

[16]  M. Golubitsky,et al.  Singularities and groups in bifurcation theory , 1985 .

[17]  A. Bossavit,et al.  Symmetry, groups and boundary value problems. A progressive introduction to noncommutative harmonic analysis of partial differential equations in domains with geometrical symmetry , 1986 .

[18]  E. Allgower,et al.  Exploiting symmetry in boundary element methods , 1992 .