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

Formulating genome-scale kinetic models in the post-genome era.

The biological community is now awash in high-throughput data sets and is grappling with the challenge of integrating disparate data sets. Such integration has taken the form of statistical analysis of large data sets, or through the bottom-up reconstruction of reaction networks. While progress has been made with statistical and structural methods, large-scale systems have remained refractory to dynamic model building by traditional approaches. The availability of annotated genomes enabled the reconstruction of genome-scale networks, and now the availability of high-throughput metabolomic and fluxomic data along with thermodynamic information opens the possibility to build genome-scale kinetic models. We describe here a framework for building and analyzing such models. The mathematical analysis challenges are reflected in four foundational properties, (i) the decomposition of the Jacobian matrix into chemical, kinetic and thermodynamic information, (ii) the structural similarity between the stoichiometric matrix and the transpose of the gradient matrix, (iii) the duality transformations enabling either fluxes or concentrations to serve as the independent variables and (iv) the timescale hierarchy in biological networks. Recognition and appreciation of these properties highlight notable and challenging new in silico analysis issues

A Model for Collective Dynamics in Ant Raids

Ant raiding, the process of identifying and returning food to the nest or bivouac, is a fascinating example of collective motion in nature. During such raids ants lay pheromones to form trails for others to find a food source. In this work a coupled PDE/ODE model is introduced to study ant dynamics and pheromone concentration. The key idea is the introduction of two forms of ant dynamics: foraging and returning, each governed by different environmental and social cues. The model accounts for all aspects of the raiding cycle including local collisional interactions, the laying of pheromone along a trail, and the transition from one class of ants to another. Through analysis of an order parameter measuring the orientational order in the system, the model shows self-organization into a collective state consisting of lanes of ants moving in opposite directions as well as the transition back to the individual state once the food source is depleted matching prior experimental results. This indicates that in the absence of direct communication ants naturally form an efficient method for transporting food to the nest/bivouac. The model exhibits a continuous kinetic phase transition in the order parameter as a function of certain system parameters. The associated critical exponents are found, shedding light on the behavior of the system near the transition.Comment: Preprint Version, 30 pgs., 18 figures, complete version with supplementary movies to appear in Journal of Mathematical Biology (Springer

Accelerating moderately stiff chemical kinetics in reactive-flow simulations using GPUs

The chemical kinetics ODEs arising from operator-split reactive-flow simulations were solved on GPUs using explicit integration algorithms. Nonstiff chemical kinetics of a hydrogen oxidation mechanism (9 species and 38 irreversible reactions) were computed using the explicit fifth-order Runge-Kutta-Cash-Karp method, and the GPU-accelerated version performed faster than single- and six-core CPU versions by factors of 126 and 25, respectively, for 524,288 ODEs. Moderately stiff kinetics, represented with mechanisms for hydrogen/carbon-monoxide (13 species and 54 irreversible reactions) and methane (53 species and 634 irreversible reactions) oxidation, were computed using the stabilized explicit second-order Runge-Kutta-Chebyshev (RKC) algorithm. The GPU-based RKC implementation demonstrated an increase in performance of nearly 59 and 10 times, for problem sizes consisting of 262,144 ODEs and larger, than the single- and six-core CPU-based RKC algorithms using the hydrogen/carbon-monoxide mechanism. With the methane mechanism, RKC-GPU performed more than 65 and 11 times faster, for problem sizes consisting of 131,072 ODEs and larger, than the single- and six-core RKC-CPU versions, and up to 57 times faster than the six-core CPU-based implicit VODE algorithm on 65,536 ODEs. In the presence of more severe stiffness, such as ethylene oxidation (111 species and 1566 irreversible reactions), RKC-GPU performed more than 17 times faster than RKC-CPU on six cores for 32,768 ODEs and larger, and at best 4.5 times faster than VODE on six CPU cores for 65,536 ODEs. With a larger time step size, RKC-GPU performed at best 2.5 times slower than six-core VODE for 8192 ODEs and larger. Therefore, the need for developing new strategies for integrating stiff chemistry on GPUs was discussed.Comment: 27 pages, LaTeX; corrected typos in Appendix equations A.10 and A.1