SearcharxivSearch

arXiv subjects

C. William Gear

Publications and source records attributed to C. William Gear.

13 recordsLinked to original sources

Manifold learning for parameter reduction

Large scale dynamical systems (e.g. many nonlinear coupled differential equations) can often be summarized in terms of only a few state variables (a few equations), a trait that reduces complexity and facilitates exploration of behavioral aspects of otherwise intractable models. High model dimensionality and complexity makes symbolic, pen--and--paper model reduction tedious and impractical, a difficulty addressed by recently developed frameworks that computerize reduction. Symbolic work has the benefit, however, of identifying both reduced state variables and parameter combinations that matter most (effective parameters, "inputs"); whereas current computational reduction schemes leave the parameter reduction aspect mostly unaddressed. As the interest in mapping out and optimizing complex input--output relations keeps growing, it becomes clear that combating the curse of dimensionality also requires efficient schemes for input space exploration and reduction. Here, we explore systematic, data-driven parameter reduction by means of effective parameter identification, starting from current nonlinear manifold-learning techniques enabling state space reduction. Our approach aspires to extend the data-driven determination of effective state variables with the data-driven discovery of effective model parameters, and thus to accelerate the exploration of high-dimensional parameter spaces associated with complex models.

math.DS

Coarse-Grained Descriptions of Dynamics for Networks with both Intrinsic and Structural Heterogeneities

Finding accurate reduced descriptions for large, complex, dynamically evolving networks is a crucial enabler to their simulation, analysis, and, ultimately, design. Here we propose and illustrate a systematic and powerful approach to obtaining good collective coarse-grained observables-- variables successfully summarizing the detailed state of such networks. Finding such variables can naturally lead to successful reduced dynamic models for the networks. The main premise enabling our approach is the assumption that the behavior of a node in the network depends (after a short initial transient) on the node identity: a set of descriptors that quantify the node properties, whether intrinsic (e.g. parameters in the node evolution equations) or structural (imparted to the node by its connectivity in the particular network structure). The approach creates a natural link with modeling and "computational enabling technology" developed in the context of Uncertainty Quantification. In our case, however, we will not focus on ensembles of different realizations of a problem, each with parameters randomly selected from a distribution. We will instead study many coupled heterogeneous units, each characterized by randomly assigned (heterogeneous) parameter value(s). One could then coin the term Heterogeneity Quantification for this approach, which we illustrate through a model dynamic network consisting of coupled oscillators with one intrinsic heterogeneity (oscillator individual frequency) and one structural heterogeneity (oscillator degree in the undirected network). The computational implementation of the approach, its shortcomings and possible extensions are also discussed.

nlin.CD

iMapD: intrinsic Map Dynamics exploration for uncharted effective free energy landscapes

We describe and implement iMapD, a computer-assisted approach for accelerating the exploration of uncharted effective Free Energy Surfaces (FES), and more generally for the extraction of coarse-grained, macroscopic information from atomistic or stochastic (here Molecular Dynamics, MD) simulations. The approach functionally links the MD simulator with nonlinear manifold learning techniques. The added value comes from biasing the simulator towards new, unexplored phase space regions by exploiting the smoothness of the (gradually, as the exploration progresses) revealed intrinsic low-dimensional geometry of the FES.

physics.chem-ph

Data-Driven Reduction for Multiscale Stochastic Dynamical Systems

Multiple time scale stochastic dynamical systems are ubiquitous in science and engineering, and the reduction of such systems and their models to only their slow components is often essential for scientific computation and further analysis. Rather than being available in the form of an explicit analytical model, often such systems can only be observed as a data set which exhibits dynamics on several time scales. We will focus on applying and adapting data mining and manifold learning techniques to detect the slow components in such multiscale data. Traditional data mining methods are based on metrics (and thus, geometries) which are not informed of the multiscale nature of the underlying system dynamics; such methods cannot successfully recover the slow variables. Here, we present an approach which utilizes both the local geometry and the local dynamics within the data set through a metric which is both insensitive to the fast variables and more general than simple statistical averaging. Our analysis of the approach provides conditions for successfully recovering the underlying slow variables, as well as an empirical protocol guiding the selection of the method parameters.

math.DS

On the acceleration of spatially distributed agent-based computations: a patch dynamics scheme

In recent years, individual-based/agent-based modeling has been applied to study a wide range of applications, ranging from engineering problems to phenomena in sociology, economics and biology. Simulating such agent-based models over extended spatiotemporal domains can be prohibitively expensive due to stochasticity and the presence of multiple scales. Nevertheless, many agent-based problems exhibit smooth behavior in space and time on a macroscopic scale, suggesting that a useful coarse-grained continuum model could be obtained. For such problems, the equation-free framework [16-18] can significantly reduce the computational cost. Patch dynamics is an essential component of this framework. This scheme is designed to perform numerical simulations of an unavailable macroscopic equation on macroscopic time and length scales; it uses appropriately initialized simulations of the fine-scale agent-based model in a number of small "patches", which cover only a fraction of the spatiotemporal domain. In this work, we construct a finite-volume-inspired conservative patch dynamics scheme and apply it to a financial market agent-based model based on the work of Omurtag and Sirovich [22]. We first apply our patch dynamics scheme to a continuum approximation of the agent-based model, to study its performance and analyze its accuracy. We then apply the scheme to the agent-based model itself. Our computational experiments indicate that here, typically, the patch dynamics-based simulation requires only 20% of the full agent-based simulation in space, and need occur over only 10% of the temporal domain.

math.NA

Reduced models in chemical kinetics via nonlinear data-mining

The adoption of detailed mechanisms for chemical kinetics often poses two types of severe challenges: First, the number of degrees of freedom is large; and second, the dynamics is characterized by widely disparate time scales. As a result, reactive flow solvers with detailed chemistry often become intractable even for large clusters of CPUs, especially when dealing with direct numerical simulation (DNS) of turbulent combustion problems. This has motivated the development of several techniques for reducing the complexity of such kinetics models, where eventually only a few variables are considered in the development of the simplified model. Unfortunately, no generally applicable a priori recipe for selecting suitable parameterizations of the reduced model is available, and the choice of slow variables often relies upon intuition and experience. We present an automated approach to this task, consisting of three main steps. First, the low dimensional manifold of slow motions is (approximately) sampled by brief simulations of the detailed model, starting from a rich enough ensemble of admissible initial conditions. Second, a global parameterization of the manifold is obtained through the Diffusion Map (DMAP) approach, which has recently emerged as a powerful tool in data analysis/machine learning. Finally, a simplified model is constructed and solved on the fly in terms of the above reduced (slow) variables. Clearly, closing this latter model requires nontrivial interpolation calculations, enabling restriction (mapping from the full ambient space to the reduced one) and lifting (mapping from the reduced space to the ambient one). This is a key step in our approach, and a variety of interpolation schemes are reported and compared. The scope of the proposed procedure is presented and discussed by means of an illustrative combustion example.

math.DS

Manifold learning techniques and model reduction applied to dissipative PDEs

We link nonlinear manifold learning techniques for data analysis/compression with model reduction techniques for evolution equations with time scale separation. In particular, we demonstrate a `"nonlinear extension" of the POD-Galerkin approach to obtaining reduced dynamic models of dissipative evolution equations. The approach is illustrated through a reaction-diffusion PDE, and the performance of different simulators on the full and the reduced models is compared. We also discuss the relation of this nonlinear extension with the so-called "nonlinear Galerkin" methods developed in the context of Approximate Inertial Manifolds.

physics.comp-ph

Analysis and Computation of a Discrete KdV-Burgers Type Equation with Fast Dispersion and Slow Diffusion

The long time behavior of the dynamics of a fast-slow system of ordinary differential equations is examined. The system is derived from a spatial discretization of a Korteweg-de Vries-Burgers type equation, with fast dispersion and slow diffusion. The discretization is based on a model developed by Goodman and Lax, that is composed of a fast system drifted by a slow forcing term. A natural split to fast and slow state variables is, however, not available. Our approach views the limit behavior as an invariant measure of the fast motion drifted by the slow component, where the known constants of motion of the fast system are employed as slowly evolving observables; averaging equations for the latter lead to computation of characteristic features of the motion. Such computations are presented in the paper.

math.NA

Projective and Coarse Projective Integration for Problems with Continuous Symmetries

Temporal integration of equations possessing continuous symmetries (e.g. systems with translational invariance associated with traveling solutions and scale invariance associated with self-similar solutions) in a ``co-evolving'' frame (i.e. a frame which is co-traveling, co-collapsing or co-exploding with the evolving solution) leads to improved accuracy because of the smaller time derivative in the new spatial frame. The slower time behavior permits the use of {\it projective} and {\it coarse projective} integration with longer projective steps in the computation of the time evolution of partial differential equations and multiscale systems, respectively. These methods are also demonstrated to be effective for systems which only approximately or asymptotically possess continuous symmetries. The ideas of projective integration in a co-evolving frame are illustrated on the one-dimensional, translationally invariant Nagumo partial differential equation (PDE). A corresponding kinetic Monte Carlo model, motivated from the Nagumo kinetics, is used to illustrate the coarse-grained method. A simple, one-dimensional diffusion problem is used to illustrate the scale invariant case. The efficiency of projective integration in the co-evolving frame for both the macroscopic diffusion PDE and for a random-walker particle based model is again demonstrated.

math.DS

Equation-free modeling of evolving diseases: Coarse-grained computations with individual-based models

We demonstrate how direct simulation of stochastic, individual-based models can be combined with continuum numerical analysis techniques to study the dynamics of evolving diseases. % Sidestepping the necessity of obtaining explicit population-level models, the approach analyzes the (unavailable in closed form) `coarse' macroscopic equations, estimating the necessary quantities through appropriately initialized, short `bursts' of individual-based dynamic simulation. % We illustrate this approach by analyzing a stochastic and discrete model for the evolution of disease agents caused by point mutations within individual hosts. % Building up from classical SIR and SIRS models, our example uses a one-dimensional lattice for variant space, and assumes a finite number of individuals. % Macroscopic computational tasks enabled through this approach include stationary state computation, coarse projective integration, parametric continuation and stability analysis.

nlin.AO

The Gap-Tooth Method in Particle Simulations

We explore the gap-tooth method for multiscale modeling of systems represented by microscopic physics-based simulators, when coarse-grained evolution equations are not available in closed form. A biased random walk particle simulation, motivated by the viscous Burgers equation, serves as an example. We construct macro-to-micro (lifting) and micro-to-macro (restriction) operators, and drive the coarse time-evolution by particle simulations in appropriately coupled microdomains (teeth) separated by large spatial gaps. A macroscopically interpolative mechanism for communication between the teeth at the particle level is introduced. The results demonstrate the feasibility of a closure-on-demand approach to solving hydrodynamics problems.

physics.class-ph

Deciding the Nature of the "Coarse Equation" through Microscopic Simulations: the Baby-Bathwater Scheme

Recent developments in multiscale computation allow the solution of ``coarse equations'' for the expected macroscopic behavior of microscopically/stochastically evolving particle distributions without ever obtaining these coarse equations in closed form. The closure is obtained ``on demand'' through appropriately initialized bursts of microscopic simulation. The effective coupling of microscopic simulators with macrosocopic behavior embodied in this approach requires certain decisions about the nature of the unavailable ``coarse equation''. Such decisions include (a) the determination of the highest spatial derivative active in the equation, (b) whether the coarse equation satisfies certain conservation laws, and (c) whether the coarse dynamics is Hamiltonian. These decisions affect the number and type of boundary conditions as well as the nature of the algorithms employed in good solution practice. In the absence of an explicit formula for the temporal derivative, we propose, implement and validate a simple scheme for deciding these and other similar questions about the coarse equation using only the microscopic simulator. Microscopic simulations under periodic boundary conditions are carried out for appropriately chosen families of random initial conditions; evaluating the sample variance of certain statistics over the simulation ensemble allows us to infer the highest order of spatial derivatives active in the coarse equation. In the same spirit we show how to determine whether a certain coarse conservation law exists or not, and we discuss plausibility tests for the existence of a coarse Hamiltonian or integrability. We argue that such schemes constitute an important part of the equation-free approach to multiscale computation.

physics.comp-ph

Equation-Free Multiscale Computation: enabling microscopic simulators to perform system-level tasks

We present and discuss a framework for computer-aided multiscale analysis, which enables models at a "fine" (microscopic/stochastic) level of description to perform modeling tasks at a "coarse" (macroscopic, systems) level. These macroscopic modeling tasks, yielding information over long time and large space scales, are accomplished through appropriately initialized calls to the microscopic simulator for only short times and small spatial domains. Our equation-free (EF) approach, when successful, can bypass the derivation of the macroscopic evolution equations when these equations conceptually exist but are not available in closed form. We discuss how the mathematics-assisted development of a computational superstructure may enable alternative descriptions of the problem physics (e.g. Lattice Boltzmann (LB), kinetic Monte Carlo (KMC) or Molecular Dynamics (MD) microscopic simulators, executed over relatively short time and space scales) to perform systems level tasks (integration over relatively large time and space scales,"coarse" bifurcation analysis, optimization, and control) directly. In effect, the procedure constitutes a systems identification based, "closure on demand" computational toolkit, bridging microscopic/stochastic simulation with traditional continuum scientific computation and numerical analysis. We illustrate these ideas through examples from chemical kinetics (LB, KMC), rheology (Brownian Dynamics), homogenization and the computation of "coarsely self-similar" solutions, and discuss various features, limitations and potential extensions of the approach.

physics.comp-ph