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.     

线性等式约束系统广义Riccati代数方程的求解*

本文基于定常离散LQ控制问题的动力学方程、价值泛函及系统的约束方程,根据极大值原理,给出了线性等式约束系统下的广义Riccati方程,进而对上述方程进行了深入的探讨,并给出了相应的数值例题。     

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.     

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

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

Some predictor–corrector‐type iterative schemes for solving nonsymmetric algebraic Riccati equations arising in transport theory

It is as well known that nonsymmetric algebraic Riccati equations arising in transport theory can be translated to vector equations. In this paper, we propose six predictor–corrector‐type iterative schemes to solve the vector equations. And we give the convergence of these schemes. Unlike the previous work, we prove that all of them converge to the minimal positive solution of the vector equations by the initial vector (e,e), where e = (1,1, ? ,1)^T. Moreover, we prove that all the sequences generated by the iterative schemes are strictly and monotonically increasing and bounded above. In addition, some numerical results are also reported in the paper, which confirm the good theoretical properties of our approach. Copyright © 2014 John Wiley & Sons, Ltd.     

二阶复微分方程的亚纯元素解及代数元素解

研究了一类二阶亚纯系数复微分方程的亚纯元素解及代数元素解的存在性问题,得到了几个有关解的存在性定理.     

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.     

关于超越系数的Riccati方程亚纯解的增长性

该文讨论了Riccati方程亚纳解的增长性问题,证明了我们曾给出的解的高阶增长级的上界稍加修改后即为一种最佳上界     

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.     

Convergence analysis of the Newton–Shamanskii method for a nonsymmetric algebraic Riccati equation

In this paper, we consider the nonsymmetric algebraic Riccati equation arising in transport theory. An important feature of this equation is that its minimal positive solution can be obtained via computing the minimal positive solution of a vector equation. We apply the Newton–Shamanskii method to solve the vector equation. Convergence analysis shows that the sequence of vectors generated by the Newton–Shamanskii method is monotonically increasing and converges to the minimal positive solution of the vector equation. Numerical experiments show that the Newton–Shamanskii method is feasible and effective, and outperforms the Newton method. Copyright © 2008 John Wiley & Sons, Ltd.     

一类Riccati方程的推广

把 Riccati方程 y′=Py2 + Qy+ R推广成 Riccati型方程 :f′( y) dydx=Pf 2 ( y) + Qf ( y) + R.并给出其可积的条件及其对应的通积分 .     

Krylov subspace methods of Hessenberg based for algebraic Riccati equation

In this paper, we propose a class of special Krylov subspace methods to solve continuous algebraic Riccati equation (CARE), i.e., the Hessenberg-based methods. The presented approaches can obtain efficiently the solution of algebraic Riccati equation to some extent. The main idea is to apply Kleinman-Newton"s method to transform the process of solving algebraic Riccati equation into Lyapunov equation at every inner iteration. Further, the Hessenberg process of pivoting strategy combined with Petrov-Galerkin condition and minimal norm condition is discussed for solving the Lyapunov equation in detail, then we get two methods, namely global generalized Hessenberg (GHESS) and changing minimal residual methods based on the Hessenberg process (CMRH) for solving CARE, respectively. Numerical experiments illustrate the efficiency of the provided methods.     

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.     

Fast verified computation for solutions of algebraic Riccati equations arising in transport theory

A fast algorithm for enclosing the solution of the nonsymmetric algebraic Riccati equation arising in transport theory is proposed. The equation has a special structure, which is taken into account to reduce the complexity. By exploiting the structure, the enclosing process involves only quadratic complexity under a reasonable assumption. The algorithm moreover verifies the uniqueness and minimal positiveness of the enclosed solution. Numerical results show the efficiency of the algorithm.     

A modified Newton method for solving non-symmetric algebraic Riccati equations arising in transport theory

Liang Bao ^{The non-symmetric algebraic Riccati equation arising in transporttheory can be rewritten as a vector equation and the minimalpositive solution of the non-symmetric algebraic Riccati equationcan be obtained by solving the vector equation. In this paper,we apply the modified Newton method to solve the vector equation.Some convergence results are presented. Numerical tests showthat the modified Newton method is feasible and effective, andoutperforms the Newton method.}     

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.     

二阶代数微分方程的代数解

本文讨论了二阶代数微分方程的代数解的存在性问题,例子表明了定理中的条件是精确的.     

Riccati微分方程特解新求法的研究

通过对一般Riccati方程进行初等变换,使之变为特殊的Riccati方程,然后利用公式、观察实验,或利用二阶微分方程的特解,或利用一阶微分方程组的特解等方法,求得这些Riccati方程的特解.     

周期系数的高维Riccati方程的周期解

本文研究了周期系数的高维Riccati方程X’＝X·A（t）·X＋B（t）·X＋C（t）,其中X∈R(n×1)A（t）∈R(1×n),B（t）∈R(n×n),C（t）E∈R(n×1);A（t）,B（t）,C（t）均是以2π为周期的实连续矩阵或向量函数,建立了该方程存在广义周期解的一个充要条件和存在周期解的两个充分条件,推广了周期系数的Riccati方程存在周期解的一些结论．     

A New Approach to Linearly Perturbed Riccati Equations Arising in Stochastic Control

In this paper a linearly perturbed version of the well-known matrix Riccati equations which arise in certain stochastic optimal control problems is studied. Via the concepts of mean square stabilizability and mean square detectability we improve previous results on both the convergence properties of the linearly perturbed Riccati differential equation and the solutions of the linearly perturbed algebraic Riccati equation. Furthermore, our approach unifies, in some way, the study for this class of Riccati equations with the one for classical theory, by eliminating a certain inconvenient assumption used in previous works (e.g., [10] and [26]). The results are derived under relatively weaker assumptions and include, inter alia, the following: (a) An extension of Theorem 4.1 of [26] to handle systems not necessarily observable. (b) The existence of a strong solution, subject only to the mean square stabilizability assumption. (c) Conditions for the existence and uniqueness of stabilizing solutions for systems not necessarily detectable. (d) Conditions for the existence and uniqueness of mean square stabilizing solutions instead of just stabilizing. (e) Relaxing the assumptions for convergence of the solution of the linearly perturbed Riccati differential equation and deriving new convergence results for systems not necessarily observable. Accepted 30 July 1996