Delta算子Riccati方程研究的新结果

基于Delta算子描述，统一研究连续时间代数Riccati方程(CARE)和离散时间代数Riccati方程(DARE)的定界估计问题，提出了统一代数Riccati方程(UARE)解矩阵的上下界，给出UARE中P与R和Q的几个基本关系．     

Solvability Criterion for the Constrained Discrete Lyapunov and Riccati Equations

Conditions for the solvability of the discrete Lyapunov and the discrete Riccati equations subject to linear equality constraints are derived. These problems arise naturally in the context of output min-max robust control. It is shown that the following problems are equivalent to one another: (a) the solvability of the constrained discrete Riccati equation; and (b) the existence of a feedback gain that guarantees the solvability of the constrained discrete Lyapunov equation of the resulting closed loop. A simple criterion for the existence of a solution to both problems is presented. These problems are shown to be related to the discrete positive real property.     

Sylvester与Lyapunov方程向后误差分析

利用矩阵Kronecker积的性质,研究Sylvester矩阵方程Ax YB=C与Lyapunov矩阵方程ATX XA=-Q(Q0)的向后误差,获得了这两类矩阵方程向后误差η(X,Y)与η(X)的精确表达式及其更易计算的上下界.这些结果是对有关文献相应结果的改进与补充.     

Positive operator based iterative algorithms for solving Lyapunov equations for Itô stochastic systems with Markovian jumps

This paper studies the iterative solutions of Lyapunov matrix equations associated with Itô stochastic systems having Markovian jump parameters. For the discrete-time case, when the associated stochastic system is mean square stable, two iterative algorithms with one in direct form and the other one in implicit form are established. The convergence of the implicit iteration is proved by the properties of some positive operators associated with the stochastic system. For the continuous-time case, a transformation is first performed so that it is transformed into an equivalent discrete-time Lyapunov equation. Then the iterative solution can be obtained by applying the iterative algorithm developed for discrete-time Lyapunov equation. Similar to the discrete-time case, an implicit iteration is also proposed for the continuous case. For both discrete-time and continuous-time Lyapunov equations, the convergence rates of the established algorithms are analyzed and compared. Numerical examples are worked out to validate the effectiveness of the proposed algorithms.     

Some experiments with interval methods for two-point boundary-value problems in ordinary differential equations

Methods of interval mathematics are used to find upper and lower bounds for the solution of two-point boundary-value problems at discrete mesh points. They include interval versions of shooting and of finite-difference techniques for linear and non-linear differential equations of second order, and of finite-difference methods for Sturm-Liouville eigenvalue problems.Good results are obtained whenever the difficulties of dependency-width can be avoided, and particularly for the finite-difference method when the associated matrix is anM matrix.     

Estimating the spectral radius of a real matrix by discrete Lyapunov equation

For any real matrix A, this paper is concerned with the estimation of the spectral radius of A. The relationship between the weighted norm and the discrete Lyapunov equation of the matrix A is obtained. On the basis of the relationship, an iterative algorithm is presented to obtain the spectral radius of A and to estimate the solution of the corresponding linear discrete system. Several numerical examples are given to show that the iterative algorithm is effective.     

Lyapunov型矩阵方程的迭代—校正解法

引进校正技术，建立求解Ｌｙａｐｕｎｏｖ型方程迭代格式的框架。该框架亦可用于求解一般的线性矩阵方程。     

On the eigenvalue estimation for solution to Lyapunov equation

This paper deals with the problems of eigenvalue estimation for the solution to the perturbed matrix Lyapunov equation. We obtain some eigenvalue inequalities on condition that X is a positive semidefinite solution to the equation A^TXA − X = −Q, which can be used in control theory and linear system stability.     

New upper solution bounds of the discrete algebraic Riccati matrix equation

In this note, we present upper matrix bounds for the solution of the discrete algebraic Riccati equation (DARE). Using the matrix bound of Theorem 2.2, we then give several eigenvalue upper bounds for the solution of the DARE and make comparisons with existing results. The advantage of our results over existing upper bounds is that the new upper bounds of Theorem 2.2 and Corollary 2.1 are always calculated if the stabilizing solution of the DARE exists, whilst all existing upper matrix bounds might not be calculated because they have been derived under stronger conditions. Finally, we give numerical examples to demonstrate the effectiveness of the derived results.     

A Relation Between the Weighted Logarithmic Norm of a Matrix and the Lyapunov Equation

In this note, we define a weighted logarithmic norm for any matrix. In the case when a stable matrix A is considered, we obtain the relationship between the maximal eigenvalue of a symmetric positive definite matrix H which is a solution of the Lyapunov equation and the weight H logarithmic norm of A. It can be seen that the weighted logarithmic norm of A is always a negative value in this case. Several examples illustrate the relationship.     

On spectral decompositions of solutions to discrete Lyapunov equations

A new approach to solving discrete Lyapunov matrix algebraic equations is based on methods for spectral decomposition of their solutions. Assuming that all eigenvalues of the matrices on the left-hand side of the equation lie inside the unit disk, it is shown that the matrix of the solution to the equation can be calculated as a finite sum of matrix bilinear quadratic forms made up by products of Faddeev matrices obtained by decomposing the resolvents of the matrices of the Lyapunov equation. For a linear autonomous stochastic discrete dynamic system, analytical expressions are obtained for the decomposition of the asymptotic variance matrix of system’s states.     

A Modified Low-Rank Smith Method for Large-Scale Lyapunov Equations

In this note we present a modified cyclic low-rank Smith method to compute low-rank approximations to solutions of Lyapunov equations arising from large-scale dynamical systems. Unlike the original cyclic low-rank Smith method introduced by Penzl in [20], the number of columns required by the modified method in the approximate solution does not necessarily increase at each step and is usually much lower than in the original cyclic low-rank Smith method. The modified method never requires more columns than the original one. Upper bounds are established for the errors of the low-rank approximate solutions and also for the errors in the resulting approximate Hankel singular values. Numerical results are given to verify the efficiency and accuracy of the new algorithm.     

Stability Criteria for Solutions of Systems of Linear Deterministic or Stochastic Delay Difference Equations with Continuous Time

We give spectral and algebraic coefficient criteria (necessary and sufficient conditions) as well as sufficient algebraic coefficient conditions for the Lyapunov asymptotic stability of solutions to systems of linear deterministic or stochastic delay difference equations with continuous time under white noise coefficient perturbations for the case in which all delay ratios are rational. For stochastic systems, mean-square asymptotic stability is studied. The Lyapunov function method is used. Our criteria on algebraic coefficients and our sufficient conditions are stated in terms of matrix Lyapunov equations (for deterministic systems) and matrix Sylvester equations (for stochastic systems).     

离散时间代数Riccati方程的解矩阵的下界与上界

本文讨论离散时间代数Ｒｉｃｃａｔｉ方程ＡＴＸＡ－Ｘ－（ＡＴＸＢ＋Ｌ）（Ｒ＋ＢＴＸＢ）＾－１（ＬＴ＋ＢＴＸＡ）＋Ｑ＝０的唯一对称正定解的上界和下界。     

Optimization Approach to the Robustness of Linear Delay Systems

By using the Lyapunov equation approach and an improved Razumikhin-type theorem, this paper presents a new robust stability criterion for a linear system subject to delayed time-varying nonlinear perturbations. Then, by using a parameter optimization technique, an efficient algorithm is derived for determining a desirable matrix for the Lyapunov equation. As a consequence, less conservative robust stability bounds for the perturbed system are achieved. Numerical examples are included to demonstrate the effectiveness of the proposed approach.     

The relationships between some types of partial differential equations and ordinary differential equations as well as their applications

In this article, we establish some relationships between several types of partial differential equations and ordinary differential equations. One application of these relationships is that we can get the exact values of the blowup time and the blowup rate of the solution to a partial differential equation by solving an ordinary differential equation. Another application of these relationships is that we can give the estimates for the spatial integration (or mean value) of the solution to a partial differential equation. We also obtain the lower and upper bounds for the blowup time of the solution to a parabolic equation with weighted function and space‐time integral in the nonlinear term.     

Iterative Methods for a Linearly Perturbed Algebraic Matrix Riccati Equation Arising in Stochastic Control

We start with a discussion of coupled algebraic Riccati equations arising in the study of linear-quadratic optimal control problems for Markov jump linear systems. Under suitable assumptions, this system of equations has a unique positive semidefinite solution, which is the solution of practical interest. The coupled equations can be rewritten as a single linearly perturbed matrix Riccati equation with special structures. We study the linearly perturbed Riccati equation in a more general setting and obtain a class of iterative methods from different splittings of a positive operator involved in the Riccati equation. We prove some special properties of the sequences generated by these methods and determine and compare the convergence rates of these methods. Our results are then applied to the coupled Riccati equations of jump linear systems. We obtain linear convergence of the Lyapunov iteration and the modified Lyapunov iteration, and confirm that the modified Lyapunov iteration indeed has faster convergence than the original Lyapunov iteration.     

Solution Bounds for the Discrete Riccati Equation and Its Applications

In this paper, we address the estimation problem for the solution of the discrete algebraic matrix Riccati equation. Both upper and lower bounds are measured. Compared to the majority of the approaches proposed in the literature, the present results are sharper. We also apply the results obtained to solve the robust stabilization problem of discrete time-delay systems. A robust stabilizability criterion and the corresponding state feedback control law are proposed. Furthermore, the tolerable bound of the delay term is also estimated. Finally, numerical examples are given to demonstrate the applications of the results.     

求解混合型Lyapunov矩阵方程的参数迭代法

采用参数迭代法求一类混合型Lyapunov矩阵方程A~TX XA B~TXB=C的对称解.在方程相容的条件下,给出了迭代法收敛的充要条件和一些充分条件,以及参数的选取方法.最后,利用数值算例对有关结果进行了验证.     

Stability in Probability of Nonlinear Stochastic Volterra Difference Equations with Continuous Variable

Abstract

The general method of Lyapunov functionals construction, that was proposed by Kolmanovskii and Shaikhet and successfully used already for functional-differential equations, difference equations with discrete time, difference equations with continuous time, and is used here to investigate the stability in probability of nonlinear stochastic Volterra difference equations with continuous time. It is shown that the investigation of the stability in probability of nonlinear stochastic difference equation with order of nonlinearity more than one can be reduced to investigation of the asymptotic mean square stability of the linear part of this equation.