Structure-Preserving Model Order Reduction of Hamiltonian Systems
International Mathematical Union via YouTube
Overview
Syllabus
Intro
Motivation
Reduced order models
Subspace selection Option 1 - by snapshots and SVD-POO
When can we expect this to work? For this to be successful there must be some structure to the solution under parameter variation
Consider an example
A few observations
Hamiltonian problems To understand how to address these problems, let us consider Hamitonian problems Equations of evolution
Model order reduction Definition: A € R is a symplectic basis transformation
Symplectic transformations
Model order reduction Suppose for a symplectic subspace
The greedy method - algorithm
Symplectic Empirical Interpolation Nonlinear case
General Hamiltonian problems Now consider the general state dependent Hamiltonian problem
Constant degenerate Poisson structure EP
Example:The KdV equation
State-dependent Poisson structure The complication now is that the Darboux map evolves and is unknown a priori We evolve the map
Towards a local basis While the methods work well, the size of the basis is generaly very large This is a classic challenge associated with transport dominated problems which often has a slowly decaying Kolmogorov.N width
Error estimator To adapt the rank we need to consider two actions Decrease basis size - this is handled by rank condition of 2 and reduction in U Increase basis size - this requires both an error estimator and a candidate vector to add
Rank adaptation We use as condition for adaptation the growth
Example: Shallow water equations
Examples Similar example for 2d shallow water equation (26)
To summarize cost
To summarize The development of reduced order stable methods for time-dependent nonlinear problems is more complex than for traditional reduced models The Hamiltonian model offers access to a number of powerful tools Local and adaptive techniques addresses cost Acceleration for very complex problems possible
References
Taught by
International Mathematical Union