Efficient Localization of Discontinuities in Complex Computational Simulations

Surrogate models for computational simulations are input-output approximations that allow computationally intensive analyses, such as uncertainty propagation and inference, to be performed efficiently. When a simulation output does not depend smoothly on its inputs, the error and convergence rate of many approximation methods deteriorate substantially. This paper details a method for efficiently localizing discontinuities in the input parameter domain, so that the model output can be approximated as a piecewise smooth function. The approach comprises an initialization phase, which uses polynomial annihilation to assign function values to different regions and thus seed an automated labeling procedure, followed by a refinement phase that adaptively updates a kernel support vector machine representation of the separating surface via active learning. The overall approach avoids structured grids and exploits any available simplicity in the geometry of the separating surface, thus reducing the number of model evaluations required to localize the discontinuity. The method is illustrated on examples of up to eleven dimensions, including algebraic models and ODE/PDE systems, and demonstrates improved scaling and efficiency over other discontinuity localization approaches

Computing Dynamic Output Feedback Laws

The pole placement problem asks to find laws to feed the output of a plant governed by a linear system of differential equations back to the input of the plant so that the resulting closed-loop system has a desired set of eigenvalues. Converting this problem into a question of enumerative geometry, efficient numerical homotopy algorithms to solve this problem for general Multi-Input-Multi-Output (MIMO) systems have been proposed recently. While dynamic feedback laws offer a wider range of use, the realization of the output of the numerical homotopies as a machine to control the plant in the time domain has not been addressed before. In this paper we present symbolic-numeric algorithms to turn the solution to the question of enumerative geometry into a useful control feedback machine. We report on numerical experiments with our publicly available software and illustrate its application on various control problems from the literature.Comment: 20 pages, 3 figures; the software described in this paper is publicly available via http://www.math.uic.edu/~jan/download.htm

Accurate and Efficient Expression Evaluation and Linear Algebra

We survey and unify recent results on the existence of accurate algorithms for evaluating multivariate polynomials, and more generally for accurate numerical linear algebra with structured matrices. By "accurate" we mean that the computed answer has relative error less than 1, i.e., has some correct leading digits. We also address efficiency, by which we mean algorithms that run in polynomial time in the size of the input. Our results will depend strongly on the model of arithmetic: Most of our results will use the so-called Traditional Model (TM). We give a set of necessary and sufficient conditions to decide whether a high accuracy algorithm exists in the TM, and describe progress toward a decision procedure that will take any problem and provide either a high accuracy algorithm or a proof that none exists. When no accurate algorithm exists in the TM, it is natural to extend the set of available accurate operations by a library of additional operations, such as $x+y+z$, dot products, or indeed any enumerable set which could then be used to build further accurate algorithms. We show how our accurate algorithms and decision procedure for finding them extend to this case. Finally, we address other models of arithmetic, and the relationship between (im)possibility in the TM and (in)efficient algorithms operating on numbers represented as bit strings.Comment: 49 pages, 6 figures, 1 tabl

The complex life of hydrodynamic modes

We study analytic properties of the dispersion relations in classical hydrodynamics by treating them as Puiseux series in complex momentum. The radii of convergence of the series are determined by the critical points of the associated complex spectral curves. For theories that admit a dual gravitational description through holography, the critical points correspond to level-crossings in the quasinormal spectrum of the dual black hole. We illustrate these methods in ${\cal N}=4$ supersymmetric Yang-Mills theory in 3+1 dimensions, in a holographic model with broken translation symmetry in 2+1 dimensions, and in conformal field theory in 1+1 dimensions. We comment on the pole-skipping phenomenon in thermal correlation functions, and show that it is not specific to energy density correlations.Comment: V3: 54 pages, 18 figures. Appendix added. Version to appear in JHE

Fracton Topological Order, Generalized Lattice Gauge Theory and Duality

We introduce a generalization of conventional lattice gauge theory to describe fracton topological phases, which are characterized by immobile, point-like topological excitations, and sub-extensive topological degeneracy. We demonstrate a duality between fracton topological order and interacting spin systems with symmetries along extensive, lower-dimensional subsystems, which may be used to systematically search for and characterize fracton topological phases. Commutative algebra and elementary algebraic geometry provide an effective mathematical toolset for our results. Our work paves the way for identifying possible material realizations of fracton topological phases.Comment: 9 pages, 4 figures; 8 pages of appendices, 3 figure