Related papers: A dynamical algorithm to compute hyperbolic Julia …
We give a new proof of a theorem of Hubbard-Oberste-Vorth [HOV2] for H\'enon maps that are perturbations of a hyperbolic polynomial and recover the Julia set $J^{+}$ inside a polydisk as the image of the fixed point of a contracting…
We describe a method, using periodic points and determinants, for giving alternative expressions for dynamical quantities (including Lyapunov exponents and Hausdorff dimension of invariant sets) associated to analytic hyperbolic systems.…
This paper is addressed to establishing an internal observability estimate for some linear stochastic hyperbolic equations. The key is to establish a new global Carleman estimate for forward stochastic hyperbolic equations in the…
Hyperbolic polynomials have been of recent interest due to applications in a wide variety of fields. We seek to better understand these polynomials in the case when they are symmetric, i.e. invariant under all permutations of variables. We…
We extend classical methods of computational complexity to the realm of distributed computing, where they sometimes prove more effective than in their original context. Our focus is on decision problems in the LOCAL model, a setting in…
We study the computational complexity of decomposing finite discrete dynamical systems (FDDSs) in terms of the semiring operations of alternative and synchronous execution, which is useful for the analysis of discrete phenomena in science…
Progressive Hedging is a popular decomposition algorithm for solving multi-stage stochastic optimization problems. A computational bottleneck of this algorithm is that all scenario subproblems have to be solved at each iteration. In this…
The computation of determinants or their signs is the core procedure in many important geometric algorithms, such as convex hull, volume and point location. As the dimension of the computation space grows, a higher percentage of the total…
This paper presents a novel method of global adaptive dynamic programming (ADP) for the adaptive optimal control of nonlinear polynomial systems. The strategy consists of relaxing the problem of solving the Hamilton-Jacobi-Bellman (HJB)…
Probabilistic Latent Variable Models (LVMs) excel at modeling complex, high-dimensional data through lower-dimensional representations. Recent advances show that equipping these latent representations with a Riemannian metric unlocks…
We develop an extension of the fast method of angles for hyperbolicity verification in chaotic systems with an arbitrary number of time-delay feedback loops. The adopted method is based on the theory of covariant Lyapunov vectors and…
Online system identification algorithms are widely used for monitoring, diagnostics and control by continuously adapting to time-varying dynamics. Typically, these algorithms consider a model structure that lacks parsimony and offers…
The VertexCover problem is proven to be computationally hard in different ways: It is NP-complete to find an optimal solution and even NP-hard to find an approximation with reasonable factors. In contrast, recent experiments suggest that on…
The authors proposed a general way to find particular solutions for overdetermined systems of PDEs previously, where the number of equations is greater than the number of unknown functions. In this paper, we propose an algorithm for finding…
Counting distinct permutations with replacement, especially when involving multiple subwords, is a longstanding challenge in combinatorial analysis, with critical applications in cryptography, bioinformatics, and statistical modeling. This…
The optimal time for the controllability of linear hyperbolic systems in one dimensional space with one-side controls has been obtained recently for time-independent coefficients in our previous works. In this paper, we consider linear…
This paper investigates reachability analysis for max-plus linear systems (MPLS), an important class of dynamical systems that model synchronization and delay phenomena in timed discrete-event systems. We specifically focus on backward…
We consider the dynamics of rational semigroups (semigroups of rational maps) on the Riemann sphere. We provide proof that a random backward iteration algorithm to draw the pictures of the Julia sets, previously proven to work in the…
We continue the study of counting complexity begun in [Buergisser, Cucker 04] and [Buergisser, Cucker, Lotz 05] by proving upper and lower bounds on the complexity of computing the Hilbert polynomial of a homogeneous ideal. We show that the…
In a recent paper, Kuperberg described the first subexponential time algorithm for solving the dihedral hidden subgroup problem. The space requirement of his algorithm is super-polynomial. We describe a modified algorithm whose running time…