Computational Algorithms for Invariant Reduction of Variational Forms

Abstract

Symmetry reductions of partial differential equations (PDEs) inherit more geometric structures than other types of reductions: invariant conservation laws, variational structures, and, under suitable conditions, Hamiltonian-type structures of the original model descend to the reduced model through the mechanism of invariant reduction. This paper develops computational algorithms that carry out such reductions explicitly. We use the interpretation of variational $p$-forms as conservation laws of an enlarged system --- the (degree-shifted) tangent system --- consisting of the original equations together with their linearizations, in which the perturbation variables are treated as anticommuting. This allows us to formulate the algorithms using well-known concepts from the theory of conservation laws, naturally adapted to the graded-commutative setting. The reduction of conservation laws, variational $1$-forms, and presymplectic structures thereby becomes a single algorithmic procedure. We present (i) a homotopy-based reduction algorithm for systems of evolution equations, implemented in Maple; (ii) a descent reduction algorithm applicable to general $\ell$-normal systems for $p>0$; and (iii) a simple reduction algorithm available for point symmetries under suitable conditions, including the description of reductions in terms of systems involving fewer independent variables. Examples include nonlinear evolution equations in one and two spatial dimensions, the Laplace equation, the incompressible Euler equations, and the cotangent system of Pavlov's equation.