Greene's Residue Criterion for the Breakup of Invariant Tori of Volume-Preserving Maps

Invariant tori play a fundamental role in the dynamics of symplectic and volume-preserving maps. Codimension-one tori are particularly important as they form barriers to transport. Such tori foliate the phase space of integrable, volume-preserving maps with one action and $d$ angles. For the area-preserving case, Greene's residue criterion is often used to predict the destruction of tori from the properties of nearby periodic orbits. Even though KAM theory applies to the three-dimensional case, the robustness of tori in such systems is still poorly understood. We study a three-dimensional, reversible, volume-preserving analogue of Chirikov's standard map with one action and two angles. We investigate the preservation and destruction of tori under perturbation by computing the "residue" of nearby periodic orbits. We find tori with Diophantine rotation vectors in the "spiral mean" cubic algebraic field. The residue is used to generate the critical function of the map and find a candidate for the most robust torus.Comment: laTeX, 40 pages, 26 figure

A probabilistic interpretation of set-membership filtering: application to polynomial systems through polytopic bounding

Set-membership estimation is usually formulated in the context of set-valued calculus and no probabilistic calculations are necessary. In this paper, we show that set-membership estimation can be equivalently formulated in the probabilistic setting by employing sets of probability measures. Inference in set-membership estimation is thus carried out by computing expectations with respect to the updated set of probability measures P as in the probabilistic case. In particular, it is shown that inference can be performed by solving a particular semi-infinite linear programming problem, which is a special case of the truncated moment problem in which only the zero-th order moment is known (i.e., the support). By writing the dual of the above semi-infinite linear programming problem, it is shown that, if the nonlinearities in the measurement and process equations are polynomial and if the bounding sets for initial state, process and measurement noises are described by polynomial inequalities, then an approximation of this semi-infinite linear programming problem can efficiently be obtained by using the theory of sum-of-squares polynomial optimization. We then derive a smart greedy procedure to compute a polytopic outer-approximation of the true membership-set, by computing the minimum-volume polytope that outer-bounds the set that includes all the means computed with respect to P

Status and Future Perspectives for Lattice Gauge Theory Calculations to the Exascale and Beyond

In this and a set of companion whitepapers, the USQCD Collaboration lays out a program of science and computing for lattice gauge theory. These whitepapers describe how calculation using lattice QCD (and other gauge theories) can aid the interpretation of ongoing and upcoming experiments in particle and nuclear physics, as well as inspire new ones.Comment: 44 pages. 1 of USQCD whitepapers