2006
DOI: 10.9746/sicetr1965.42.493
|View full text |Cite
|
Sign up to set email alerts
|

A Generalized Lyapunov Stability Theorem for Discrete-time Systems Based on Quadratic Difference Forms

Abstract: In this paper, we consider the generalized Lyapunov stability analysis for a discrete-time system described by a high order difference-algebraic equation. In the behavioral approach, a Lyapunov function is characterized in terms of a quadratic difference form. As a main result, we derive a generalized Lyapunov stability theorem that the asymptotic stability of a behavior is equivalent to the solvability of the two-variable polynomial Lyapunov equation (TVPLE) whose solution induces the Lyapunov function. Moreo… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
6
0

Year Published

2006
2006
2024
2024

Publication Types

Select...
4
3

Relationship

1
6

Authors

Journals

citations
Cited by 8 publications
(6 citation statements)
references
References 8 publications
0
6
0
Order By: Relevance
“…Kojima and Takaba,[5], then extended it to the discrete time case, introducing QdFs. Defining the extended inputs and outputs as:…”
Section: Background and Preliminariesmentioning
confidence: 99%
“…Kojima and Takaba,[5], then extended it to the discrete time case, introducing QdFs. Defining the extended inputs and outputs as:…”
Section: Background and Preliminariesmentioning
confidence: 99%
“…The well-known Lyapunov conditions (see, e.g., p. 2913 of [33]) are used to develop further algebraic specifications for stability, that will be instrumental for the synthesis of controllers. For ease of reference, these conditions are recalled as follows:…”
Section: Lyapunov Stabilitymentioning
confidence: 99%
“…Remark 1. Please notice that when dealing with higher order linear systems, it is only required a condition on the Lyapunov function Q K to be non negative, rather than positive definite, please see [33].…”
Section: Lyapunov Stabilitymentioning
confidence: 99%
“…An important result concerning QdFs is that the forward difference of a QdF is itself a QdF. That is, Q ϕ ðt þ 1ÞÀQ ϕ ðtÞ ¼ Q ∇ϕ , where ∇ϕðζ; ηÞ ¼ ðζη À 1Þϕðζ; ηÞ, Kojima and Takaba (2005). This facilitates operations of QdFs using efficient polynomial matrix methods.…”
Section: Preliminariesmentioning
confidence: 99%