Matrix bounds of the discrete ARE solution

This paper provides new lower and upper matrix bounds of the solution to the discrete algebraic Riccati equation. The lower bound always works if the solution exists. The upper bounds are presented in terms of the solution of the discrete Lyapunov equation and its upper matrix bound. The upper bounds are always calculated if the solution of the Lyapunov equation exists. A numerical example shows that the new bounds are tighter than previous results in many cases.     

The generalized continuous algebraic Riccati equation and impulse-free continuous-time LQ optimal control

The purpose of this paper is to investigate the role that the so-called constrained generalized Riccati equation plays within the context of continuous-time singular linear–quadratic (LQ) optimal control. This equation has been defined following the analogy with the discrete-time setting. However, while in the discrete-time case the connections between this equation and the linear–quadratic optimal control problem has been thoroughly investigated, to date very little is known on these connections in the continuous-time setting. This note addresses this point. We show, in particular, that when the continuous-time constrained generalized Riccati equation admits a solution, the corresponding linear–quadratic problem admits an impulse-free optimal control. We also address the corresponding infinite-horizon LQ problem for which we establish a similar result under the additional constraint that there exists a control input for which the cost index is finite.     

Bounds for the eigenvalues of the solution of the unified algebraic Riccati matrix equation

In recent years, several eigenvalues bounds have been investigated separately for the solutions of the continuous and the discrete Riccati and Lyapunov matrix equations. In this paper, lower bounds for the eigenvalues of the solution of the unified Riccati equation (relatively to continuous and discrete cases), are presented. In the limiting cases, the results reduce to some new bounds for both the continuous and discrete Riccati equation.     

Stable Hermitian solutions of discrete algebraic Riccati equations

Stable and Lipschitz stable hermitian solutions of the discrete algebraic Riccati equations are characterized, in the complex as well as in the real case.This paper was written while the first author visited The College of William and Mary.Partially supported by NSF Grant DMS-8802836 and by the Binational United States-Israel Science Foundation.     

On the numerical solution of a structured nonsymmetric algebraic Riccati equation

A class of nonsymmetric algebraic Riccati equation, where one of the two linear coefficients is block diagonal, is studied. These equations arise in the modeling of an adaptive MMAP[K]/PH[K]/1$MMAP\left[K\right]/PH\left[K\right]/1$ queue. Some theoretical results are proved, and two new algorithms are introduced that exploit the diagonal structure of the linear coefficient.     

On the existence of maximal solution for generalized algebraic Riccati equations arising in stochastic control

Existence of maximal solution is proved for a generalized version of the well-known standard algebraic Riccati equations which arise in certain stochastic optimal control problems.     

New matrix bounds,an existence uniqueness and a fixed-point iterative algorithm for the solution of the unified coupled algebraic Riccati equation

In this paper, combining the equivalent form of the unified coupled algebraic Riccati equation (UCARE) with the eigenvalue inequalities of a matrix's sum and product, using the properties of an M-matrix and its inverse matrix, we offer new lower and upper matrix bounds for the solution of the UCARE. Furthermore, applying the derived lower and upper matrix bounds and a fixed-point theorem, an existence uniqueness condition of the solution of the UCARE is proposed. Then, we propose a new fixed-point iterative algorithm for the solution of the UCARE. Finally, we present a corresponding numerical example to demonstrate the effectiveness of our results.     

Algorithm for solving algebraic Riccati equation which has singular Hamiltonian matrix

The algorithm of construction of the solution of ARE, with Hamiltonian matrix having zero eigenvalues, is developed. The algorithm generalizes the Schur method on ARE with singular Hamiltonian matrix and could be used for J-factorization of matrix polynomial, which has zero roots.     

Existence and uniqueness of unmixed solutions of the discrete-time algebraic Riccati equation

A solution X of a discrete-time algebraic Riccati equation is called unmixed if the corresponding closed-loop matrix Φ(X) has the property that the common roots of det(sI−Φ(X)) and det(I−sΦ(X)^*) (if any) are on the unit circle. A necessary and sufficient condition is given for existence and uniqueness of an unmixed solution such that the eigenvalues of Φ(X) lie in a prescribed subset of .     

Strong solutions of the discrete-time algebraic Riccati equation

Conditions are given under which a solution of the DARE is positive semidefinite if and only if all the eigenvalues of its associated closed-loop matrix are in the closed unit disc.     

A revised Kleinman algorithm to solve algebraic Riccati equation of singularly perturbed systems

In this paper, we show that the Kleinman algorithm can be used well to solve the algebraic Riccati equation (ARE) of singularly perturbed systems, where the quadratic term of the ARE may be indefinite. The quadratic convergence property of the Kleinman algorithm is proved by using the Newton-Kantorovich theorem when the initial condition is chosen appropriately. In addition, the numerical method to solve the generalized algebraic Lyapunov equation (GALE) appearing in the Kleinman algorithm is given.     

On upper bounds for the unified algebraic Riccati equation

In recent years, several eigenvalues, norms and determinants bounds have been investigated separately for the solutions of continuous and discrete Riccati equations. In this paper, an upper bound for solution of the unified Riccati equation is presented. In the limiting cases, the result reduces to a new upper bound for the solution of continuous and discrete Riccati equation.     

A nonrecursive algebraic solution for the discrete Riccati equation

Equations for the optimal linear control and filter gains for linear discrete systems with quadratic performance criteria are widely documented. A nonrecursive algebraic solution for the Riccati equation is presented. These relations allow the determination of the steady-state solution of the Riccati equation directly without iteration. The relations also allow the direct determination of the transient solution for any particular time without proceeding recursively from the initial conditions. The method involves finding the eigenvalues and eigenvectors of the canonical state-costate equations.     

On stochastic Riccati equations for the stochastic LQR problem

This paper studies an approximation of stochastic Riccati equations for stochastic LQR problems some of which may be even with indefinite control weight costs.     

Curvature properties of the algebraic Riccati equation

We prove that the solution to the algebraic Ricatti equation (ARE) is concave with respect to a nonnegative-definite symmetric state weighting matrix Q when the input weighting matrix R = R^T > 0. We also prove that the solution to the ARE is concave with respect to a positive-definite diagonal input weighting matrix R when Q = Q^T ≥ 0.     

Upper solution bounds of the continuous and discrete coupled algebraic Riccati equations

In this paper, we propose upper bounds for the sum of the maximal eigenvalues of the solutions of the continuous coupled algebraic Riccati equation (CCARE) and the discrete coupled algebraic Riccati equation (DCARE), which are then used to infer upper bounds for the maximal eigenvalues of the solutions of each Riccati equation. By utilizing the upper bounds for the maximal eigenvalues of each equation, we then derive upper matrix bounds for the solutions of the CCARE and DCARE. Following the development of each bound, an iterative algorithm is proposed which can be used to derive tighter upper matrix bounds. Finally, we give numerical examples to demonstrate the effectiveness of the proposed results, making comparisons with existing results.     

Existence of unmixed solutions of the discrete-time algebraic Riccati equation and a nonstrictly bounded real lemma

The existence of a solution of the discrete-time algebraic Riccati equation is established assuming modulus controllability and positive semidefiniteness on the unit circle of the Popov function. As an application a nonstrictly bounded real lemma is obtained.     

Perturbation analysis and condition numbers of symmetric algebraic Riccati equations

This paper is devoted to the perturbation analysis of symmetric algebraic Riccati equations. Based on our perturbation analysis, the upper bounds for the normwise, mixed and componentwise condition numbers are presented. The results are demonstrated by our preliminary numerical experiments.     

Monotonicity of algebraic Lyapunov iterations for optimal control of jump parameter linear systems

In this paper we show that the sequences of the solutions of the decoupled algebraic Lyapunov equations are monotonic under proper initialization. These sequences converge from above to the positive-semidefinite stabilizing solutions of the system of coupled algebraic Riccati equations of the optimal control problem of jump parameter linear systems.