Seminar talk, 14 October 2026: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| (One intermediate revision by the same user not shown) | |||
| Line 3: | Line 3: | ||
| title = Computational algorithms for invariant reduction of variational forms | | title = Computational algorithms for invariant reduction of variational forms | ||
| abstract = Symmetry reductions of partial differential equations inherit more geometric structures than other types of reductions: invariant conservation laws, presymplectic structures, internal Lagrangians, and, under suitable conditions, Hamiltonian structures of the original system descend to its symmetry reduction through the mechanism of invariant reduction. Reductions of all these structures can often be described in terms of variational forms. We will discuss computational algorithms that carry out reductions of variational forms explicitly. | | abstract = Symmetry reductions of partial differential equations inherit more geometric structures than other types of reductions: invariant conservation laws, presymplectic structures, internal Lagrangians, and, under suitable conditions, Hamiltonian structures of the original system descend to its symmetry reduction through the mechanism of invariant reduction. Reductions of all these structures can often be described in terms of variational forms. We will discuss computational algorithms that carry out reductions of variational forms explicitly. | ||
| video = | | video = https://video.gdeq.org/GDEq-zoom-seminar-20261014-Konstantin_Druzhkov.mp4 | ||
| slides = [[Media:Inv_red_comput.pdf|Inv_red_comput.pdf]] | | slides = [[Media:Inv_red_comput.pdf|Inv_red_comput.pdf]] | ||
| references = {{arXiv|2609.03197}} | | references = {{arXiv|2609.03197}} | ||
| 79YY-MM-DD = 7973-89-85 | | 79YY-MM-DD = 7973-89-85 | ||
}} | }} | ||
Latest revision as of 23:51, 14 October 2026
Speaker: Konstantin Druzhkov
Title: Computational algorithms for invariant reduction of variational forms
Abstract:
Symmetry reductions of partial differential equations inherit more geometric structures than other types of reductions: invariant conservation laws, presymplectic structures, internal Lagrangians, and, under suitable conditions, Hamiltonian structures of the original system descend to its symmetry reduction through the mechanism of invariant reduction. Reductions of all these structures can often be described in terms of variational forms. We will discuss computational algorithms that carry out reductions of variational forms explicitly.
Video
Slides: Inv_red_comput.pdf
References:
arXiv:2609.03197