Related papers: Symmetric interval identification systems of order…
We first develop systematic and comprehensive interval observer designs for linear time-invariant (LTI) systems, under standard assumptions of observability and interval bounds on the initial condition and uncertainties. Traditionally, such…
We introduce a novel class of finite difference approximations, termed zigzag schemes, that employ a hybrid stencil that is neither symmetrical, nor fully one-sided. These zigzag schemes often enjoy more permissive stability constraints and…
Interval translation maps (ITMs) are a non-invertible generalization of interval exchange transformations (IETs). The dynamics of finite type ITMs is similar to IETs, while infinite type ITMs are known to exhibit new interesting effects. In…
We prove that the recently developed semiexplicit symplectic integrators for non-separable Hamiltonian systems preserve any linear and quadratic invariants possessed by the Hamiltonian systems. This is in addition to being symmetric and…
In this paper, we develop a system identification algorithm to identify a model for unknown linear quantum systems driven by time-varying coherent states, based on empirical single-shot continuous homodyne measurement data of the system's…
We demonstrate, using the symbolic method together with p-adic and resultant methods,the existence of systems with exactly one or two generalized symmetries. Since the existence of one or two symmetries is often taken as a sure sign (or as…
This work is concerned with uncertainty quantification in reduced-order dynamical system identification. Reduced-order models for system dynamics are ubiquitous in design and control applications and recent efforts focus on their…
Multidimensional Consistency becomes more and more important in the theory of discrete integrable systems. Recently, we gave a classification of all 3D consistent 6-tuples of equations with the tetrahedron property, where several novel…
Randomized iterative algorithms have attracted much attention in recent years because they can approximately solve large-scale linear systems of equations without accessing the entire coefficient matrix. In this paper, we propose two novel…
We introduce a very natural generalization of the well-known problem of simultaneous congruences. Instead of searching for a positive integer $s$ that is specified by $n$ fixed remainders modulo integer divisors $a_1,\dots,a_n$ we consider…
We use low-depth quantum circuits, a specific type of tensor networks, to classify two-dimensional symmetry-protected topological many-body localized phases. For (anti-)unitary on-site symmetries we show that the (generalized) third…
In the paper the notion of {\em Rauzy scheme} is introduced. From Rauzy graph Rauzy Scheme can be obtaining by uniting sequence of vertices of ingoing and outgoing degree 1 by arches. This notion is a tool to describe Rauzy graph behavior.…
A systematic procedure to synthesize interval observers for nonlinear discrete-time systems is proposed. The feedback gains and other matrices are found from the solutions to semidefinite feasibility programs. Two cases are considered: (1)…
We propose a new point of view on multidimensional continued fraction algorithms inspired by Rauzy induction. The generic behaviour of such an algorithm is described here as a random walk on a graph that we call simplicial system. These…
This paper investigates two issues on identification of switched linear systems: persistence of excitation and numerical algorithms. The main contribution is a much weaker condition on the regressor to be persistently exciting that…
This paper deals with strong versions of input-to-state stability and integral input-to-state stability of infinite-dimensional linear systems with an unbounded input operator. We show that infinite-time admissibility with respect to inputs…
The Weak-form Sparse Identification of Nonlinear Dynamics algorithm (WSINDy) has been demonstrated to offer coarse-graining capabilities in the context of interacting particle systems (https://doi.org/10.1016/j.physd.2022.133406). In this…
Numerical methods based on interval arithmetic are efficient means to reliably solve nonlinear systems of equations. Algorithm bc3revise is an interval method that tightens variables' domains by enforcing a property called box consistency.…
We provide a class of methods for the identification of a linear system with delay of the shape $x^{(n)}(t) = \sum_{i=0}^{n-1}a_{i}x^{(i)}(t) + bu(t-h)$. They allow the simultaneous identification of the parameters and delay, the…
In this paper a class of mappings on unit interval is constructed. These mapping preserve uniform distribution and theirs iterations form a sequence which is Buck uniformly distributed. In the third part some prorties of these mappings are…