Convergence of the solution of a nonsymmetric matrix Riccati differential equation to its stable equilibrium solution

We consider the initial value problem for a nonsymmetric matrix Riccati differential equation, where the four coefficient matrices form an M-matrix. We show that for a wide range of initial values the Riccati differential equation has a global solution X(t) on [0,∞) and X(t) converges to the stable equilibrium solution as t goes to infinity.     

The King-Werner method for solving nonsymmetric algebraic Riccati equation

For the nonsymmetric algebraic Riccati equation arising from transport theory, we concern about solving its minimal positive solution. In [1], Lu transferred the equation into a vector form and pointed out that the minimal positive solution of the matrix equation could be obtained via computing that of the vector equation. In this paper, we use the King-Werner method to solve the minimal positive solution of the vector equation and give the convergence and error analysis of the method. Numerical tests show that the King-Werner method is feasible to determine the minimal positive solution of the vector equation.     

On the Minimal Nonnegative Solution of Nonsymmetric Algebraic Riccati Equation

We study perturbation bound and structured condition number about the minimal nonnegative solution of nonsymmetric algebraic Riccati equation, obtaining a sharp perturbation bound and an accurate condition number. By using the matrix sign function method we present a new method for finding the minimal nonnegative solution of this algebraic Riccati equation. Based on this new method, we show how to compute the desired M-matrix solution of the quadratic matrix equation X^2 - EX - F = 0 by connecting it with the nonsymmetric algebraic Riccati equation, where E is a diagonal matrix and F is an M-matrix.     

ON THE MINIMAL NONNEGATIVE SOLUTION OF ONSYMMETRIC ALGEBRAIC RICCATI EQUATION

We study perturbation bound and structured condition number about the minimalnonnegative solution of nonsymmetric algebraic Riccati equation,obtaining a sharp per-turbation bound and an accurate condition number.By using the matrix sign functionmethod we present a new method for finding the minimal nonnegative solution of this al-gebraic Riccati equation.Based on this new method,we show how to compute the desiredM-matrix solution of the quadratic matrix equation X~2-EX-F=0 by connecting itwith the nonsymmetric algebraic Riccati equation,where E is a diagonal matrix and F isan M-matrix.     

Improved Potter-Anderson-Moore algorithm for the differential Riccati equation

The paper presents a method to find the solution of the constant coefficient matrix differential Riccati differential in terms of solutions of algebraic Riccati and Lyapunov equations, and the state transition matrix (matrix exponential) of the corresponding linear dynamic system. The method presented represents an improved method of Potter-Anderson-Moore since the solution is obtained under milder assumptions than the original algorithm of Potter-Anderson-Moore. An aircraft and satellite examples done in the paper demonstrate the advantages of the improved algorithm.     

Algebraically stable general linear methods and the <Emphasis Type="Italic">G</Emphasis>-matrix

The standard algebraic stability condition for general linear methods (GLMs) is considered in a modified form, and connected to a branch of Control Theory concerned with the discrete algebraic Riccati equation (DARE). The DARE theory shows that, for an algebraically stable method, there is a minimal G-matrix, G ^*, satisfying an equation, rather than an inequality. This result, and another alternative reformulation of algebraic stability, are applied to construct new GLMs with 2 steps and 2 stages, one of which has order p=4 and stage order q=3. The construction process is simplified by method-equivalence, and Butcher’s simplified order conditions for the case p≤q+1.      

Proper deflating subspaces: properties,algorithms and applications

An algorithm for computing proper deflating subspaces with specified spectrum for an arbitrary matrix pencil is presented. The method uses refined algorithms for computing the generalized Schur form of a matrix pencil and enlightens the connection that exists between reducing and proper deflating subspaces. The proposed algorithm can be applied for computing the stabilizing solution of the generalized algebraic Riccati equation, a recently introduced concept which extends the usual algebraic Riccati equation.     

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

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

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.     

Monotonicity and convexity properties of matrix Riccati equations

Using a Fréchet-derivative-based approach some monotonicity,convexity/concavity and comparison results concerning strictlyunmixed solutions of continuous- and discrete-time algebraicRiccati equations are obtained; it turns out that these solutionsare isolated and smooth functions of the input data. Similarly,it is proved that the solutions of initial value problems forboth Riccati differential and difference equations are smoothand monotonic functions of the input data and of the initial value. They are also convex or concave functions with respectto certain matrix coefficients.     

ON SIGN FUNCTION AND SQUARE ROOT METHODS FOR SOLUTION OF REAL ALGEBRAIC RICCATI EQUATIONS

In this paper, we first justify the theory of the square root algorithm presented in [1], [2] by simple application of the matrix sign function, then we present an iterative square root algorithm for the continuous time algebraic Riccati equation.     

Quadratic optimal control of stable well-posed linear systems

We consider the infinite horizon quadratic cost minimization problem for a stable time-invariant well-posed linear system in the sense of Salamon and Weiss, and show that it can be reduced to a spectral factorization problem in the control space. More precisely, we show that the optimal solution of the quadratic cost minimization problem is of static state feedback type if and only if a certain spectral factorization problem has a solution. If both the system and the spectral factor are regular, then the feedback operator can be expressed in terms of the Riccati operator, and the Riccati operator is a positive self-adjoint solution of an algebraic Riccati equation. This Riccati equation is similar to the usual algebraic Riccati equation, but one of its coefficients varies depending on the subspace in which the equation is posed. Similar results are true for unstable systems, as we have proved elsewhere.

     

A subspace shift technique for nonsymmetric algebraic Riccati equations associated with an M‐matrix

The worst situation in computing the minimal nonnegative solution of a nonsymmetric algebraic Riccati equation associated with an M‐matrix occurs when the corresponding linearizing matrix has two very small eigenvalues, one with positive and one with negative real part. When both eigenvalues are exactly zero, the problem is called critical or null recurrent. Although in this case the problem is ill‐conditioned and the convergence of the algorithms based on matrix iterations is slow, there exist some techniques to remove the singularity and transform the problem to a well‐behaved one. Ill‐conditioning and slow convergence appear also in close‐to‐critical problems, but when none of the eigenvalues is exactly zero, the techniques used for the critical case cannot be applied. In this paper, we introduce a new method to accelerate the convergence properties of the iterations also in close‐to‐critical cases, by working on the invariant subspace associated with the problematic eigenvalues as a whole. We present numerical experiments that confirm the efficiency of the new method.Copyright © 2012 John Wiley & Sons, Ltd.     

On the convergence of inexact Newton methods for discrete-time algebraic Riccati equations

In this paper, we present a convergence analysis of the inexact Newton method for solving Discrete-time algebraic Riccati equations (DAREs) for large and sparse systems. The inexact Newton method requires, at each iteration, the solution of a symmetric Stein matrix equation. These linear matrix equations are solved approximatively by the alternating directions implicit (ADI) or Smith?s methods. We give some new matrix identities that will allow us to derive new theoretical convergence results for the obtained inexact Newton sequences. We show that under some necessary conditions the approximate solutions satisfy some desired properties such as the d-stability. The theoretical results developed in this paper are an extension to the discrete case of the analysis performed by Feitzinger et al. (2009) [8] for the continuous-time algebraic Riccati equations. In the last section, we give some numerical experiments.     

Condition numbers of algebraic Riccati equations in the Frobenius norm

Consider the continuous-time algebraic Riccati equation (CARE) and the discrete-time algebraic Riccati equation (DARE) which arise in linear control and system theory. It is known that appropriate assumptions on the coefficient matrices guarantee the existence and uniqueness of Hermitian positive semidefinite stabilizing solutions. In this note, we apply the theory of condition developed by Rice to define condition numbers of the CARE and DARE in the Frobenius norm, and derive explicit expressions of the condition numbers in a uniform manner. Both the complex case and real case are considered, and connections to certain existing condition numbers of the CARE and DARE are discussed.     

Algebraic convergence for discrete-time ergodic markov chains

This paper studies the l-ergodicity for discrete-time recurrent Markov chains.It proves that thel-order deviation matrix exists and is finite if and only if the chain is(l+2)-ergodic,and then the algebraicdecay rates of the n-step transition probability to the stationary distribution are obtained.The criteria forl-ergodicity are given in terms of existence of solution to an equation.The main results are,illustrated by someexamples.     

A new two‐phase structure‐preserving doubling algorithm for critically singular M‐matrix algebraic Riccati equations

Among numerous iterative methods for solving the minimal nonnegative solution of an M‐matrix algebraic Riccati equation, the structure‐preserving doubling algorithm (SDA) stands out owing to its overall efficiency as well as accuracy. SDA is globally convergent and its convergence is quadratic, except for the critical case for which it converges linearly with the linear rate 1/2. In this paper, we first undertake a delineatory convergence analysis that reveals that the approximations by SDA can be decomposed into two components: the stable component that converges quadratically and the rank‐one component that converges linearly with the linear rate 1/2. Our analysis also shows that as soon as the stable component is fully converged, the rank‐one component can be accurately recovered. We then propose an efficient hybrid method, called the two‐phase SDA, for which the SDA iteration is stopped as soon as it is determined that the stable component is fully converged. Therefore, this two‐phase SDA saves those SDA iterative steps that previously have to have for the rank‐one component to be computed accurately, and thus essentially, it can be regarded as a quadratically convergent method. Numerical results confirm our analysis and demonstrate the efficiency of the new two‐phase SDA. Copyright © 2015 John Wiley & Sons, Ltd.     

Transformation of Quadratic Forms to Perfect Squares for Broken Extremals

In this paper we study a quadratic form which corresponds to an extremal with piecewise continuous control in variational problems. This form, compared with the classical one, has some new terms connected with the set of all points of discontinuity of the control. Its positive definiteness is a sufficient optimality condition for broken extremals. We show that if there exists a solution to corresponding Riccati equation satisfying some jump condition at each point of the set , then the quadratic form can be transformed to a perfect square, just as in the classical case. As a result we obtain sufficient conditions for positive definiteness of the quadratic form in terms of the Riccati equation and hence, sufficient optimality conditions for broken extremals.     

Exact slow-fast decomposition of the singularly perturbed matrix differential Riccati equation

In this paper the Hamiltonian matrix formulation of the Riccati equation is used to derive the reduced-order pure-slow and pure-fast matrix differential Riccati equations of singularly perturbed systems. These pure-slow and pure-fast matrix differential Riccati equations are obtained by decoupling the singularly perturbed matrix differential Riccati equation of dimension n₁+n₂ into the pure-slow regular matrix differential Riccati equation of dimension n₁ and the pure-fast stiff matrix differential Riccati equation of dimension n₂. A formula is derived that produces the solution of the original singularly perturbed matrix differential Riccati equation in terms of solutions of the pure-slow and pure-fast reduced-order matrix differential Riccati equations and solutions of two reduced-order initial value problems. In addition to its theoretical importance, the main result of this paper can also be used to implement optimal filtering and control schemes for singularly perturbed linear time-invariant systems independently in pure-slow and pure-fast time scales.