Georgia Institute of Technology College of Sciences

This talk will be an amalgamation of aspects of scientific computing - development, verification, and interpretation - with application to the Vlasov-Poisson (VP) system, an important nonlinear partial differential equation containing the essential difficulties of collisionless kinetic theories. I will describe our development of a discontinuous Galerkin (DG) algorithm, its verification via convergence studies and comparison to known Vlasov results, and our interpretation of computational results in terms of dynamical systems ideas. The DG method was invented for solving a neutron transport model, successfully adapted to fluid motion including shock propagation, applied to the Boltzmann equation, and developed in the general context of conservation laws, and elliptic and parabolic equations. Our development for the VP system required the simultaneous approximation of the hyperbolic Vlasov equation with the elliptic Poisson equation, which created new challenges. I will briefy discuss advantages of the method and describe our error estimates and recurrence calculations for polynomial bases. Then, I will show results from a collection of benchmark computations of electron plasma dynamics, including i) convergence studies of high resolution linear and nonlinear Landau damping with a comparison to theoretical parameter dependencies ii) the nonlinear two-stream instability integrated out to (weak) saturation into an apparently stable equilibrium (BGK) state with detailed modeling of this state, and iii) an electric field driven (dynamically accessible) example that appears to saturate into various periodic solutions. I will interpret such final states, in analogy to finite-dimensional Hamiltonian theory, as Moser-Weinstein periodic orbits, and suggest a possible variational path for proof of their existence. Finally, I will comment briefly on recent progress on extensions to the Maxwell-Vlasov system, including estimates and computational results.

The heart is an excitable system in which electrical waves normally propagate in a coordinated manner to produce an effective mechanical contraction. Rapid pacing can lead to the development of alternans, a period-doubling bifurcation in electrical response in which successive beats have long and short responses despite a constant pacing period. Alternans can develop into higher-order rhythms as well as spatiotemporally complex patterns that reflect large regions of dispersion in electrical response. These states disrupt synchrony and compromise the heart's mechanical function; indeed, alternans has been observed clinically as a precursor to dangerous arrhythmias, including ventricular fibrillation. In this talk, we will show experimental examples of alternans, describe how alternans develops using a mathematical and computational approach, and discuss the nonlinear dynamics of several possible mechanisms for alternans as well as the conditions under which they are likely to be important in initiating dangerous cardiac arrhythmias.

A discussion of the papers "Accurate SHAPE-directed RNA structure determination" by Deigan et al (2008) and "SHAPE-directed RNA secondary structure prediction" by Low and Weeks (2010).

In a celebrated result, Raghavendra [Rag08] showed that, assuming Unique Game Conjecture, every Max-CSP problem has a sharp approximation threshold that matches the integrality gap of a natural SDP relaxation. Raghavendra and Steurer [RS09] also gave a simple and unified framework for optimally approximating all the Max-CSPs.In this work, we consider the problem of approximating CSPs with global cardinality constraints. For example, Max-Cut is a boolean CSP where the input is a graph $G = (V,E)$ and the goal is to find a cut $S \cup \bar S = V$ that maximizes the number of crossing edges, $|E(S,\bar S)|$. The Max-Bisection problem is a variant of Max-Cut with an additional global constraint that each side of the cut has exactly half the vertices, i.e., $|S| = |V|/2$. Several other natural optimization problems like Small Set Expansion, Min Bisection and approximating Graph Expansion can be formulated as CSPs with global constraints.In this talk, I will introduce a general approach towards approximating CSPs with global constraints using SDP hierarchies. To demonstrate the approach, I will present an improved algorithm for Max-Bisection problem that achieves the following:- Given an instance of Max-Bisection with value $1-\epsilon$, the algorithm finds a bisection with value at least $1-O(\sqrt{\epsilon})$ with running time $O(n^{poly(1/\eps)})$. This approximation is near-optimal (up to constant factors in $O()$) under the Unique Games Conjecture.- Using computer-assisted proof, we show that the same algorithm also achieves a 0.85-approximation for Max-Bisection, improving on the previous bound of 0.70 (note that it is UGC-hard to approximate better than 0.878 factor). As an attempt to prove matching hardness result, we show a generic conversion from SDP integrality gap to dictatorship test for any CSP with global cardinality constraints. The talk is based on joint work with Prasad Raghavendra.