Reduced order models from computed states of physical systems using non-local calculus on finite weighted graphs
share
Partial differential equation-based numerical solution frameworks for initial and boundary value problems have attained a high degree of complexity. Applied to a wide range of physics with the ultimate goal of enabling engineering solutions, these approaches encompass a spectrum of spatiotemporal discretization techniques that leverage solver technology and high performance computing. While high-fidelity solutions can be achieved using these approaches, they come at a high computational expense and complexity. Systems with billions of solution unknowns are now routine. The expense and complexity do not lend themselves to typical engineering design and decision-making, which must instead rely on reduced-order models. Here we present an approach to reduced-order modelling that builds off of recent graph theoretic work for representation, exploration, and analysis on computed states of physical systems (Banerjee et al., Comp. Meth. App. Mech. Eng., 351, 501-530, 2019). We extend a non-local calculus on finite weighted graphs to build such models by exploiting first order dynamics, polynomial expansions, and Taylor series. Some aspects of the non-local calculus related to consistency of the models are explored. Details on the numerical implementations and the software library that has been developed for non-local calculus on graphs are described. Finally, we present examples of applications to various quantities of interest in mechano-chemical systems.
READ FULL TEXT