Skip to content
DraconiticResearch
Search Sources API
190,851 studies31 sourcesUpdated 8 min ago
PreprintCC BY-NC-ND 4.0arXiv

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 ℓ-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.

Related

  1. An invariant variational proof for canonical processes with independent symmetric log-concave tails
    Witold Bednorz, Rafal Martynek, Rafal Meller
    arXivPreprintCC BY 4.0Full textProbabilityarXiv
  2. A Unified Space-Time Variational Framework for Wave Equations on Differential Forms
    C. Urzúa-Torres, A. Wisse
    arXivPreprintarXiv licenceFull textAnalysis & PDEsNumerical analysis & scientific computingarXiv
  3. Translation invariant quadratic forms in $8$ variables and dense sets of primes
    Zhaochen Pei, Maoru Tan, Weiwen Zhang +1
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
  4. The Heat Kernel of the Hodge Laplacian on an Invariant Subspace of 1-forms on the Hyperbolic Space ℍn
    Petros Siasos
    arXivPreprintarXiv licenceFull textAnalysis & PDEsGeometry & topologyarXiv
  5. Fixed-Point Formulation and Parallel Averaged Operator Algorithms for Generalized Variational Inclusion Problems
    Arifuzzaman, Syed Shakaib Irfan, Ahmad Almutlg +1
    AxiomsPeer-reviewedCC BY 4.0General mathematicsCrossref
BibTeX
@misc{druzhkov2026computational,
  title = {{Computational Algorithms for Invariant Reduction of Variational Forms}},
  author = {Kostya Druzhkov and Alexey Shevyakov},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.03197},
  eprint = {2609.03197},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.03197},
  note = {CC BY-NC-ND 4.0},
}
RIS
TY  - UNPB
TI  - Computational Algorithms for Invariant Reduction of Variational Forms
AU  - Kostya Druzhkov
AU  - Alexey Shevyakov
PY  - 2026
DA  - 2026/09/02
PB  - arXiv
DO  - 10.48550/arxiv.2609.03197
UR  - https://arxiv.org/abs/2609.03197
AB  - 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 ℓ-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.
ER  -