Related papers: Polynomial methods to construct inputs for uniform…

Reducing the conditions under which a given set satisfies the stipulations of the subset sum proposition to a set of linear relationships, the question of whether a set satisfies subset sum may be answered in a polynomial number of steps by…

In many sampled-data applications, observers are designed based on approximately discretized models of continuous-time systems, where usually only the discretized system is analyzed in terms of its detectability. In this paper, we show that…

Linear time-invariant systems are very popular models in system theory and applications. A fundamental problem in system identification that remains rather unaddressed in extant literature is to leverage commonalities amongst related linear…

This paper addresses problems on the structural design of control systems taking explicitly into consideration the possible application to large-scale systems. We provide an efficient and unified framework to solve the following major…

Shaping the reachable set of a dynamical system is a fundamental challenge in control design, with direct implications for both performance and safety. This paper considers the problem of selecting the optimal input matrix for a linear…

In this paper, we address the problem of computing the maximal admissible robust positive invariant (MARPI) set for discrete-time linear time-varying systems with parametric uncertainties and additive disturbances. The system state and…

This paper presents a framework for abstracting uncertain or non-polynomial components of dynamical systems using polynomial constraints. This enables the application of polynomial-based analysis tools, such as sum-of-squares programming,…

This papers presents a general framework for the uniform random generation of deterministic real-time accessible pushdown automata. A polynomial time algorithm to randomly generate a pushdown automaton having a fixed stack operations total…

The recently introduced polynomial time integration framework proposes a novel way to construct time integrators for solving systems of first-order ordinary differential equation by using interpolating polynomials in the complex time plane.…

We combine dependent types with linear type systems that soundly and completely capture polynomial time computation. We explore two systems for capturing polynomial time: one system that disallows construction of iterable data, and one,…

Research efforts of the past fifty years have led to a development of linear integer programming as a mature discipline of mathematical optimization. Such a level of maturity has not been reached when one considers nonlinear systems subject…

We develop a new tool, namely polynomial and linear algebraic methods, for studying systems of word equations. We illustrate its usefulness by giving essentially simpler proofs of several hard problems. At the same time we prove extensions…

In this paper, we investigate the problem of actuator selection for linear dynamical systems. We develop a framework to design a sparse actuator schedule for a given large-scale linear system with guaranteed performance bounds using…

We address the observability problem for ensembles that are described by probability distributions. The problem is to reconstruct a probability distribution of the initial state from the time-evolution of the probability distribution of the…

We provide a constructive algorithm to find the best separable approximation to an arbitrary density matrix of a composite quantum system of finite dimensions. The method leads to a condition of separability and to a measure of…

The paper introduces and solves a structural controllability problem for continuum ensembles of linear time-invariant systems. All the individual linear systems of an ensemble are sparse, governed by the same sparsity pattern.…

Many applications of computational fluid dynamics require multiple simulations of a flow under different input conditions. In this paper, a numerical algorithm is developed to efficiently determine a set of such simulations in which the…

We present a computational method for open-loop minimum-norm control synthesis for fixed-endpoint transfer of bilinear ensemble systems that are indexed by two continuously varying parameters. We suppose that one ensemble parameter scales…

We propose a method to outer bound forward reachable sets on finite horizons for uncertain nonlinear systems with polynomial dynamics. This method makes use of time-dependent polynomial storage functions that satisfy appropriate dissipation…

Given a dynamical system with constrained outputs, the maximal admissible set (MAS) is defined as the set of all initial conditions such that the output constraints are satisfied for all time. It has been previously shown that for…