On the Lyapunov transformation for stable matrices

The matrices studied here are positive stable (or briefly stable). These are matrices, real or complex, whose eigenvalues have positive real parts. A theorem of Lyapunov states that A is stable if and only if there exists H ˃ 0 such that AH + HA* = I. Let A be a stable matrix. Three aspects of the Lyapunov transformation L_A :H → AH + HA* are discussed.

1. Let C₁ (A) = {AH + HA* :H ≥ 0} and C₂ (A) = {H: AH+HA* ≥ 0}. The problems of determining the cones C₁(A) and C₂(A) are still unsolved. Using solvability theory for linear equations over cones it is proved that C₁(A) is the polar of C₂(A*), and it is also shown that C₁ (A) = C₁(A^-1). The inertia assumed by matrices in C₁(A) is characterized.

2. The index of dissipation of A was defined to be the maximum number of equal eigenvalues of H, where H runs through all matrices in the interior of C₂(A). Upper and lower bounds, as well as some properties of this index, are given.

3. We consider the minimal eigenvalue of the Lyapunov transform AH+HA*, where H varies over the set of all positive semi-definite matrices whose largest eigenvalue is less than or equal to one. Denote it by ψ(A). It is proved that if A is Hermitian and has eigenvalues μ₁ ≥ μ₂…≥ μ_n ˃ 0, then ψ(A) = -(μ₁-μ_n)²/(4(μ₁ + μ_n)). The value of ψ(A) is also determined in case A is a normal, stable matrix. Then ψ(A) can be expressed in terms of at most three of the eigenvalues of A. If A is an arbitrary stable matrix, then upper and lower bounds for ψ(A) are obtained.

Lyapunov's stability and operational margin of grid-connected photovoltaic modules

Analyses of photovoltaic power generation based on Lyapunov's theorems are presented. The characteristics of the photovoltaic module and the power conditioning unit are analyzed in order to establish energy functions that assess the stability of solutions and define safe regions of operation. Furthermore, it is shown that grid-connected photovoltaic modules driven at maximum power may become unstable under normal grid transients. In such cases, stability can be maintained by allowing an operational margin defined as the energy difference between the stable and the unstable solutions of the system. Simulations show that modules cope well with grid transients when a sufficiently large margin is used.

Lyapunov-like conditions for the existence of zeno behavior in hybrid and lagrangian hybrid systems

Lyapunov-like conditions that utilize generalizations of energy and barrier functions certifying Zeno behavior near Zeno equilibria are presented. To better illustrate these conditions, we will study them in the context of Lagrangian hybrid systems. Through the observation that Lagrangian hybrid systems with isolated Zeno equilibria must have a onedimensional configuration space, we utilize our Lyapunov-like conditions to obtain easily verifiable necessary and sufficient conditions for the existence of Zeno behavior in systems of this form. © 2007 IEEE.

Lyapunov theory for zeno stability

Zeno behavior is a dynamic phenomenon unique to hybrid systems in which an infinite number of discrete transitions occurs in a finite amount of time. This behavior commonly arises in mechanical systems undergoing impacts and optimal control problems, but its characterization for general hybrid systems is not completely understood. The goal of this paper is to develop a stability theory for Zeno hybrid systems that parallels classical Lyapunov theory; that is, we present Lyapunov-like sufficient conditions for Zeno behavior obtained by mapping solutions of complex hybrid systems to solutions of simpler Zeno hybrid systems defined on the first quadrant of the plane. These conditions are applied to Lagrangian hybrid systems, which model mechanical systems undergoing impacts, yielding simple sufficient conditions for Zeno behavior. Finally, the results are applied to robotic bipedal walking. © 2012 IEEE.

Lyapunov functions for stable cascades and applications to global stabilization

This paper generalizes recent Lyapunov constructions for a cascade of two nonlinear systems, one of which is stable rather than asymptotically stable. A new cross-term construction in the Lyapunov function allows us to replace earlier growth conditions by a necessary boundedness condition. This method is instrumental in the global stabilization of feedforward systems, and new stabilization results are derived from the generalized construction.

A differential lyapunov framework for contraction analysis

Lyapunov's second theorem is an essential tool for stability analysis of differential equations. The paper provides an analog theorem for incremental stability analysis by lifting the Lyapunov function to the tangent bundle. The Lyapunov function endows the state-space with a Finsler structure. Incremental stability is inferred from infinitesimal contraction of the Finsler metrics through integration along solutions curves. © 2013 IEEE.

类Lyapunov理论在类人形机器人任务空间内跟踪的应用

考虑了类人形机器人的各种不确定因素,提出了其手臂控制的新方法.基于类Lyapunov方法,设计出具有鲁棒性功能的任务空间控制器.该方法得到的控制器不但在有限确定时间内达到稳定跟踪,而且不需要雅可比矩阵求逆,对一定类型的外部干扰具有鲁棒性功能.最后通过数值仿真显示了所得结果的有效性及其应用方法.

Stability of time-delay systems via Lyapunov functions

In this paper, a Lyapunov function candidate is introduced for multivariable systems with inner delays, without assuming a priori stability for the nondelayed subsystem. By using this Lyapunov function, a controller is deduced. Such a controller utilizes an input-output description of the original system, a circumstance that facilitates practical applications of the proposed approach.

Scaling relations in the Lyapunov exponents of one dimensional maps

We establish numerically the validity of Huberman-Rudnick scaling relation for Lyapunov exponents during the period doubling route to chaos in one dimensional maps. We extend our studies to the context of a combination map. where the scaling index is found to be different.

Bifurcation structure and Lyapunov exponents of a modulated logistic map

We have studied the bifurcation structure of the logistic map with a time dependant control parameter. By introducing a specific nonlinear variation for the parameter, we show that the bifurcation structure is modified qualitatively as well as quantitatively from the first bifurcation onwards. We have also computed the two Lyapunov exponents of the system and find that the modulated logistic map is less chaotic compared to the logistic map.

Refinement criteria for global illumination using convex funcions

In several computer graphics areas, a refinement criterion is often needed to decide whether to go on or to stop sampling a signal. When the sampled values are homogeneous enough, we assume that they represent the signal fairly well and we do not need further refinement, otherwise more samples are required, possibly with adaptive subdivision of the domain. For this purpose, a criterion which is very sensitive to variability is necessary. In this paper, we present a family of discrimination measures, the f-divergences, meeting this requirement. These convex functions have been well studied and successfully applied to image processing and several areas of engineering. Two applications to global illumination are shown: oracles for hierarchical radiosity and criteria for adaptive refinement in ray-tracing. We obtain significantly better results than with classic criteria, showing that f-divergences are worth further investigation in computer graphics. Also a discrimination measure based on entropy of the samples for refinement in ray-tracing is introduced. The recursive decomposition of entropy provides us with a natural method to deal with the adaptive subdivision of the sampling region