Approximating the nearest stable discrete-time system
نویسندگان
چکیده
منابع مشابه
Approximating Nearest Neighbor Distances
Several researchers proposed using non-Euclidean metrics on point sets in Euclidean space for clustering noisy data. Almost always, a distance function is desired that recognizes the closeness of the points in the same cluster, even if the Euclidean cluster diameter is large. Therefore, it is preferred to assign smaller costs to the paths that stay close to the input points. In this paper, we c...
متن کاملComplete memory structures for approximating nonlinear discrete-time mappings
This paper introduces a general structure that is capable of approximating input-output maps of nonlinear discrete-time systems. The structure is comprised of two stages, a dynamical stage followed by a memoryless nonlinear stage. A theorem is presented which gives a simple necessary and sufficient condition for a large set of structures of this form to be capable of modeling a wide class of no...
متن کاملStable Stabilization for Discrete-Time Systems
to discrete-time systems. Specifically, several modifications to the closed-loop discrete-time Lyapunov equation are proposed that guarantee that the compensator dynamics are stable. Using fixed-structure controller optimiztion techniques sufficient conditions for stable compensators with suboptimal H a performance can readily be derived. designing continuous-time stable dynamic compensators z(...
متن کاملExponentially Stable Linear Time-Varying Discrete Behaviors
We study implicit systems of linear time-varying (LTV) difference equations with rational coefficients of arbitrary order and their solution spaces, called discrete LTV-behaviors. The signals are sequences, i.e. functions from the discrete time set of natural numbers into the complex numbers. The difference field of rational functions with complex coefficients gives rise to a noncommutative ske...
متن کاملApproximating the Stable Model Semantics is Hard
In this paper we investigate the complexity of problems concerned with approximating the stable model semantics. We show that under rather weak assumptions it is NP-hard to decide whether the size of a polynomially computable approximation is within a constant factor from the size of the intersection (union) of stable models of a program. We also show that unless P=NP, no approximation exists t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2019
ISSN: 0024-3795
DOI: 10.1016/j.laa.2019.03.014