CMV matrices in random matrix theory and integrable systems: a survey

We present a survey of recent results concerning a remarkable class of unitary matrices, the CMV matrices. We are particularly interested in the role they play in the theory of random matrices and integrable systems. Throughout the paper we also emphasize the analogies and connections to Jacobi matrices.Comment: Based on a talk given at the Short Program on Random Matrices, Random Processes and Integrable Systems, CRM, Universite de Montreal, 200

A Survey on Continuous Time Computations

We provide an overview of theories of continuous time computation. These theories allow us to understand both the hardness of questions related to continuous time dynamical systems and the computational power of continuous time analog models. We survey the existing models, summarizing results, and point to relevant references in the literature

The symmetric representation of the rigid body equations and their discretization

This paper analyses continuous and discrete versions of the generalized rigid body equations and the role of these equations in numerical analysis, optimal control and integrable Hamiltonian systems. In particular, we present a symmetric representation of the rigid body equations on the Cartesian product SO(n)×SO(n) and study its associated symplectic structure. We describe the relationship of these ideas with the Moser-Veselov theory of discrete integrable systems and with the theory of variational symplectic integrators. Preliminary work on the ideas discussed in this paper may be found in Bloch et al (Bloch A M, Crouch P, Marsden J E and Ratiu T S 1998 Proc. IEEE Conf. on Decision and Control 37 2249-54).Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/49076/2/no2416.pd

Approximating the Existential Theory of the Reals

The Existential Theory of the Reals (ETR) consists of existentially quantified Boolean formulas over equalities and inequalities of polynomial functions of variables in $\mathbb{R}$. In this paper we propose and study the approximate existential theory of the reals ($\epsilon$-ETR), in which the constraints only need to be satisfied approximately. We first show that when the domain of the variables is $\mathbb{R}$ then $\epsilon$-ETR = ETR under polynomial time reductions, and then study the constrained $\epsilon$-ETR problem when the variables are constrained to lie in a given bounded convex set. Our main theorem is a sampling theorem, similar to those that have been proved for approximate equilibria in normal form games. It discretizes the domain in a grid-like manner whose density depends on various properties of the formula. A consequence of our theorem is that we obtain a quasi-polynomial time approximation scheme (QPTAS) for a fragment of constrained $\epsilon$-ETR. We use our theorem to create several new PTAS and QPTAS algorithms for problems from a variety of fields