Pilot-wave dynamics: Using dynamic mode decomposition to characterize bifurcations, routes to chaos, and emergent statistics.

We develop a data-driven characterization of the pilot-wave hydrodynamic system in which a bouncing droplet self-propels along the surface of a vibrating bath. We consider drop motion in a confined one-dimensional geometry and apply the dynamic mode decomposition (DMD) in order to characterize the evolution of the wave field as the bath's vibrational acceleration is increased progressively. Dynamic mode decomposition provides a regression framework for adaptively learning a best-fit linear dynamics model over snapshots of spatiotemporal data. Thus, DMD reduces the complex nonlinear interactions between pilot waves and droplet to a low-dimensional linear superposition of DMD modes characterizing the wave field. In particular, it provides a low-dimensional characterization of the bifurcation structure of the pilot-wave physics, wherein the excitation and recruitment of additional modes in the linear superposition models the bifurcation sequence. This DMD characterization yields a fresh perspective on the bouncing-droplet problem that forges valuable new links with the mathematical machinery of quantum mechanics. Specifically, the analysis shows that as the vibrational acceleration is increased, the pilot-wave field undergoes a series of Hopf bifurcations that ultimately lead to a chaotic wave field. The established relation between the mean pilot-wave field and the droplet statistics allows us to characterize the evolution of the emergent statistics with increased vibrational forcing from the evolution of the pilot-wave field. We thus develop a numerical framework with the same basic structure as quantum mechanics, specifically a wave theory that predicts particle statistics.

Kernel learning for robust dynamic mode decomposition: linear and nonlinear disambiguation optimization.

Research in modern data-driven dynamical systems is typically focused on the three key challenges of high dimensionality, unknown dynamics and nonlinearity. The dynamic mode decomposition (DMD) has emerged as a cornerstone for modelling high-dimensional systems from data. However, the quality of the linear DMD model is known to be fragile with respect to strong nonlinearity, which contaminates the model estimate. By contrast, sparse identification of nonlinear dynamics learns fully nonlinear models, disambiguating the linear and nonlinear effects, but is restricted to low-dimensional systems. In this work, we present a kernel method that learns interpretable data-driven models for high-dimensional, nonlinear systems. Our method performs kernel regression on a sparse dictionary of samples that appreciably contribute to the dynamics. We show that this kernel method efficiently handles high-dimensional data and is flexible enough to incorporate partial knowledge of system physics. It is possible to recover the linear model contribution with this approach, thus separating the effects of the implicitly defined nonlinear terms. We demonstrate our approach on data from a range of nonlinear ordinary and partial differential equations. This framework can be used for many practical engineering tasks such as model order reduction, diagnostics, prediction, control and discovery of governing laws.

Periodic Schwarz-Christoffel mappings with multiple boundaries per period.

We present an extension to the theory of Schwarz-Christoffel (S-C) mappings by permitting the target domain to be a single period window of a periodic configuration having multiple polygonal (straight-line) boundaries per period. Taking the arrangements to be periodic in the x-direction in an (x, y)-plane, three cases are considered; these differ in whether the period window extends off to infinity as y → ± ∞, or extends off to infinity in only one direction (y → + ∞ or y → - ∞), or is bounded. The preimage domain is taken to be a multiply connected circular domain. The new S-C mapping formulae are shown to be expressible in terms of the Schottky-Klein prime function associated with the circular preimage domains. As usual for an S-C map, the formulae are explicit but depend on a finite set of accessory parameters. The solution of this parameter problem is discussed in detail, and illustrative examples are presented to highlight the essentially constructive nature of the results.