A compound matrix algorithm for the computation of the Smith form of a polynomial matrix

In the present paper is presented a numerical method for the exact reduction of a singlevariable polynomial matrix to its Smith form without finding roots and without applying unimodular transformations. Using the notion of compound matrices, the Smith canonical form of a polynomial matrixM(s)^nxn[s] is calculated directly from its definition, requiring only the construction of all thep-compound matricesC _p (M(s)) ofM(s), 1<pn. This technique produces a stable and accurate numerical algorithm working satisfactorily for any polynomial matrix of any degree.     

Global finite-time stabilization of switched high-order rational power nonlinear systems

This works is concerned with the finite-time optimal stabilization problem for a class of switched non-strict-feedback nonlinear systems whose powers are possibly different positive odd rational numbers in the sense the powers of each subsystem might differ from others. It is well known that high-order nonlinear systems are intrinsically challenging as feedback linearization and backstepping method successfully developed for low-order systems fail to work. To this purpose, the nested saturation homogeneous controller is constructively devised to achieve global finite-time stability. Furthermore, the corresponding design parameters are optimized by minimizing a well-defined cost function, and thus an optimal controller being independent of switching signals is obtained. Simulation results are eventually provided to validate the effectiveness of the proposed control scheme.     

The polynomial numerical hull of a matrix and algorithms for computing the numerical range

Let A be an n × n matrix. In this paper we discuss theoretical properties of the polynomial numerical hull of A of degree one and assemble them into three algorithms to computing the numerical range of A.     

State feedback stabilization of uncertain linear time‐delay systems: A nonlinear matrix inequality approach

A nonlinear matrix inequality is derived as a stabilizability condition of linear uncertain time‐delay systems. This inequality is seen as a less conservative one as well as efficient for numerical computation than the existing results as seen when solving by cone‐complementary algorithm. Copyright © 2010 John Wiley & Sons, Ltd.     

Stability,stabilization and duality for linear time-varying systems

In this article, we study stability properties of linear continuous time-varying systems. Based on a time-varying version of the Lyapunov stability theorem, we obtain stabilizability, stability and duality properties of associated systems.     

Finite time stability and stabilization of a class of continuous systems

Finite time stability is investigated for continuous system which satisfies uniqueness of solutions in forward time. A necessary and sufficient condition for finite time stability is given for this class of systems using Lyapunov functions. Then, a necessary and sufficient condition is developed for finite time stabilization of class CLk-affine systems involving a class CL⁰-settling-time function for the closed-loop system. Finally an explicit feedback control is addressed by using a control Lyapunov function verifying a certain inequality.     

Numerical computation of polynomial zeros by means of Aberth's method

An algorithm for computing polynomial zeros, based on Aberth's method, is presented. The starting approximations are chosen by means of a suitable application of Rouché's theorem. More precisely, an integerq 1 and a set of annuliA _i,i=1,...,q, in the complex plane, are determined together with the numberk _i of zeros of the polynomial contained in each annulusA _i. As starting approximations we choosek _i complex numbers lying on a suitable circle contained in the annulusA _i, fori=1,...,q. The computation of Newton's correction is performed in such a way that overflow situations are removed. A suitable stop condition, based on a rigorous backward rounding error analysis, guarantees that the computed approximations are the exact zeros of a nearby polynomial. This implies the backward stability of our algorithm. We provide a Fortran 77 implementation of the algorithm which is robust against overflow and allows us to deal with polynomials of any degree, not necessarily monic, whose zeros and coefficients are representable as floating point numbers. In all the tests performed with more than 1000 polynomials having degrees from 10 up to 25,600 and randomly generated coefficients, the Fortran 77 implementation of our algorithm computed approximations to all the zeros within the relative precision allowed by the classical conditioning theorems with 11.1 average iterations. In the worst case the number of iterations needed has been at most 17. Comparisons with available public domain software and with the algorithm PA16AD of Harwell are performed and show the effectiveness of our approach. A multiprecision implementation in MATHEMATICA is presented together with the results of the numerical tests performed.Work performed under the support of the ESPRIT BRA project 6846 POSSO (POlynomial System SOlving).     

On the division of polynomial matrices

The main purpose of this paper is to determine two new algorithmsfor the division of the polynomial matrix B(s) R[s]^pxq by A(s) R[s]^pxp (a) based on the Laurent matrix expansion at s = =of the inverse of A(s), i.e. A(s)^–1, and (b) in a waysimilar to the one presented by Gantmacher (1959).     

On stability and stabilization of some discrete dynamical systems

The paper formulates effective and nonimprovable stability conditions for a linear difference system involving 2 integer delays. The used technique combines algorithm of the discrete D‐decomposition method with some procedures of the polynomial theory. Contrary to the related existing results, the derived conditions are fully explicit with respect to both delays, which enables their simple applicability in various scientific and engineering areas. As an illustration, we show their importance in delayed feedback controls of discrete dynamical systems, with a particular emphasis put on stabilization of unstable steady states of the discrete logistic map.     

Decentralized stabilization of a class of interconnected systems

Abstract. This paper is concerned with the decentralized stabilization of continuous and discretelinear interconnected systems with the structural constraints about the interconnection matri-ces. For the continuous case,the main improvement in the paper as compared with the corre-sponding results in the literature is to extend the considered class of systems from S to S“ (bothwill be defined in the paper) without resulting in high decentralized gain and difficult numericalcomputation. The algorithm for obtaining decentralized state feedback control to stable theoverall system is presented. The discrete case and some very useful results are discussed aswell.     

Numerical Stability and Oscillations of Runge-Kutta Methods for Differential Equations with Piecewise Constant Arguments of Advanced Type

For differential equations with piecewise constant arguments of advanced type, numerical stability and oscillations of Runge-Kutta methods are investigated. The necessary and sufficient conditions under which the numerical stability region contains the analytic stability region are given. The conditions of oscillations for the Runge-Kutta methods are obtained also. We prove that the Runge-Kutta methods preserve the oscillations of the analytic solution. Moreover, the relationship between stability and oscillations is discussed. Several numerical examples which confirm the results of our analysis are presented.     

Robust stabilization of a class of state-dependent jump linear systems

In this article, we consider a continuous-time state-dependent jump linear system (SDJLS), a kind of stochastic hybrid system, with the presence of uncertainties in system parameters. In SDJLS, we consider that the transition rates of the underlying random jump process depend on the state variable. In particular, we assume the transition rates to have different values across suitably defined sets to which the state of the system belongs, and address a problem of robust stability and stabilization analysis. We obtain sufficient conditions for robust stability and state-feedback stabilization in terms of linear matrix inequalities (LMIs). We validate the obtained sufficient robust stability and stabilization conditions with numerical examples.     

Numerical range of a nilpotent matrix and related central force

In this paper, we introduce a new class of upper triangular nilpotent matrices, etermine the eigenvalues of the Hermitian part of rotating the type of nilpotent matrices and relate the numerical range of that typical type of matrices to the orbit of a point mass under a central force.     

Feedback stabilization and adaptive stabilization of stochastic nonlinear systems by the control Lyapunov function

Our aims of this paper are twofold: On one hand, we study the asymptotic stability in probability of stochastic differential system, when both the drift and diffusion terms are affine in the control. We derive sufficient conditions for the existence of control Lyapunov functions (CLFs) leading to the existence of stabilizing feedback laws which are smooth, except possibly at the equilibrium state. On the other hand, we consider the previous systems with an unknown constant parameters in the drift and introduce the concept of an adaptive CLF for stochastic system and use the stochastic version of Florchinger's control law to design an adaptive controller. In this framework, the problem of adaptive stabilization of nonlinear stochastic system is reduced to the problem of non-adaptive stabilization of a modified system.     

Numerical stability analysis of the Taylor-Couette flow in the two-dimensional case

The stability of the laminar flow between two rotating cylinders (Taylor-Couette flow) is numerically studied. The simulation is based on the equations of motion of an inviscid fluid (Euler equations). The influence exerted on the flow stability by physical parameters of the problem (such as the gap width between the cylinders, the initial perturbation, and the velocity difference between the cylinders) is analyzed. It is shown that the onset of turbulence is accompanied by the formation of large vortices. The results are analyzed and compared with those of similar studies.     

Stability of T. Chan＇s Preconditioner from Numerical Range

A matrix is said to be stable if the real parts of all the eigenvalues are negative. In this paper, for any matrix An, we discuss the stability properties of T. Chan＇s preconditioner cU（An） from the viewpoint of the numerical range. An application in numerical ODEs is also given.