Sufficient Conditions for Detectability of Approximately Discretized Nonlinear Systems

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 if the continuous-time system satisfies certain linear matrix inequality (LMI) conditions, and the sampling period of the discretization scheme is sufficiently small, then the whole family of discretized systems (parameterized by the sampling period) satisfies analogous discrete-time LMI conditions that imply detectability. Our results are applicable to general discretization schemes, as long as they produce approximate models whose linearizations are in some sense consistent with the linearizations of the continuous-time ones. We explicitly show that the Euler and second-order Runge-Kutta methods satisfy this condition. A batch-reactor system example is provided to highlight the usefulness of our results from a practical perspective.

Institutions

Publication Details

Journal
ArXiv.org
Published
2025-05-23
Primary Topic
Control Systems and Identification
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Sufficient Conditions for Detectability of Approximately Discretized Nonlinear Systems

ArXiv.org
Control Systems and Identification
article

Sufficient Conditions for Detectability of Approximately Discretized Nonlinear Systems

article en

Abstract

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 if the continuous-time system satisfies certain linear matrix inequality (LMI) conditions, and the sampling period of the discretization scheme is sufficiently small, then the whole family of discretized systems (parameterized by the sampling period) satisfies analogous discrete-time LMI conditions that imply detectability. Our results are applicable to general discretization schemes, as long as they produce approximate models whose linearizations are in some sense consistent with the linearizations of the continuous-time ones. We explicitly show that the Euler and second-order Runge-Kutta methods satisfy this condition. A batch-reactor system example is provided to highlight the usefulness of our results from a practical perspective.

ArXiv.org
Leibniz University Hannover (DE)
European Commission
Openalex Percentile: Top 45%
Control Systems and Identification
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.