Inheritance properties of the conjugate discrete-time algebraic Riccati equation
Abstract
In this paper we consider a class of conjugate discrete-time Riccati equations, arising originally from the linear quadratic regulation problem for discrete-time antilinear systems. Under mild and reasonable assumptions, the existence of the maximal solution to the conjugate discrete-time Riccati equation, in which the control weighting matrix is nonsingular and its constant term is Hermitian, will be inherited to a transformed discrete-time algebraic Riccati equation. Based on this inheritance property, an accelerated fixed-point iteration is proposed for finding the maximal solution via the transformed Riccati equation. Numerical examples are shown to illustrate the correctness of our theoretical results and the feasibility of the proposed algorithm.
keywords:
conjugate discrete-time algebraic Riccati equation, inheritance property, fixed-point iteration, maximal solution, LQR control problem, antilinear systemMSC:
39B12, 39B42, 93A99, 65H05, 15A241 Introduction
In this paper we are mainly concerned with the inheritance properties of the maximal solution to the conjugate discrete-time algebraic Riccati equation (CDARE) of the form
(1a) | |||
or the compact form | |||
(1b) |
where , , is nonsingular, , is the identity matrix of compatible size and , respectively. Here, denotes the set of all Hermitian matrices and is the matrix obtained by taking the complex conjugate of each entry of a matrix . The solution of the CDARE (1a), with being positive definite, is considered in this paper.
For any , the positive definite and positive semidefinite matrices are denoted by and , respectively. Moreover, we usually write (or ) if (or ) in the context. For the sake of simplicity, the spectrum and spectral radius of are denoted by and , respectively. We say that the CDARE (1) has a maximal solution if for any solution of the CDARE. Thus, it follows from the definition of the maximality that is unique if it exists. A matrix operator is order preserving (resp. reversing) on if (resp. ) when and .
A class of CDAREs (1) arises originally from linear quadratic regulation (LQR) optimal control problem for the discrete-time antilinear system
(2) |
where is the state response and is the control input. The main goal of this control problem is to find a state feedback control such that the performance index
is minimized with and . If the antilinear system (2) is controllable, it is shown in Theorem 12.7 of [18] that the optimal state feedback controller is with such that the minimum value of is achieved and the corresponding closed-loop antilinear system
(3) |
is asymptotically stable, i.e., , where is the unique solution of the CDARE (1a) or the discrete-time algebraic anti-Riccati equation [17, 18].
Recently, some accelerated iterations have been proposed for solving the unique positive definite solution of the CDARE (1) under positive definiteness assumptions with and , see, e.g., [9, 10, 12] and the references therein. In addition, this numerical technique has also been utilized to some real-life applications recently, see, e.g., [11, 14, 15].
It is worth mentioning that the authors in [9] first transformed a conjugate nonlinear matrix equation, arising from modern quantum theory, to some CDARE (1b) with , and proposed theoretical results for the existence and uniqueness of the (maximal) positive definite solution to the CDARE. On the other hand, we have generalized the existence of the maximal solution for the CDARE (1) with under the framework of the fixed-point iteration (FPI) and some weaker assumptions [4], see also Theorem 2.1 below.
Inspired by the technique using in [9], if
(4) |
, where , then the CDARE (1a) can be transformed into a discrete-time algebraic Riccati equation (DARE) of the form
(5a) | ||||
(5b) |
where its coefficient matrices are given by
(6a) | ||||
(6b) |
and the invertibility of the matrix will be shown in the next section. The assumption (4) will be needed throughout the paper.
Therefore, the first question is to ask whether the CDARE (1) and its induced DARE (5) both have the same maximal solution under the assumptions proposed in [4]. If yes, we may further ask if there exists a suitable matrix related to so that the closed-loop matrix inherits the stability of the closed-loop matrix related to the original CDARE (1), where is defined by (3). These interesting questions will be addressed completely in this work.
Once the CDARE (1) and its transformed DARE (5) have the same maximal solution, there are dozens of numerical methods for solving the standard DAREs of small to medium sizes in the existing literatures, see, e.g., [3, 5, 6, 7, 8, 13, 16] and the references therein. Nevertheless, following the line of the FPI discussed in [4], we are mainly interested in the design of an accelerated fixed-point iteration (AFPI) for finding the maximal solution of the CDARE (1) via its transformed DARE (5) directly.
The paper is organized as follows. In Section 2, we introduce some useful notations, and auxiliary theorems and lemmas that will be used in our main results. Some inheritance properties related to the CDARE (1) and its transformed DARE (5) have been addressed in Section 3. Especially, under reasonable and mild assumptions, we have shown that these Riccati matrix equations both have the same maximal Hermitian solution in Theorem 3.1. Based on this theorem, an accelerated fixed-point iteration is proposed for computing the maximal solution of the transformed DARE (5) directly in Section 4. Numerical examples are given to illustrate the validity of the inheritance properties and the feasibility of our AFPI algorithm in Section 5. Finally, we conclude the paper in Section 6.
2 Preliminaries
In this section we introduce some notations and auxiliary lemmas that will be used below. Firstly, let the conjugate Stein matrix operator and standard Stein matrix operator associated with a matrix be defined by
(7) |
for any . In general, the operator is neither order preserving nor order reversing. However, under the assumption that , its inverse operator is order preserving, since for with .
It will be clear later on that the matix operators and defined by (1a) and (5a), respectively, both play an important role in our theorems below, where and . If is nonsingular for , it is easily seen that the matrix defined by (6a) is of the form
(8) |
Therefore, is nonsingular, i.e., , since the Schur complement of given by
is also nonsingular. This implies and thus the solution set of the CDARE (1) is contained in the solution set of the transformed DARE (5).
Moreover, for the sake of simplicity the following sets and matrices
(9a) | |||
(9b) | |||
(9c) | |||
(9d) |
will be used throughout the paper for any and .
The following lemma characterizes some useful identities depending on the matrix operators and with respect to the associated conjugate Stein and Stein operators, which will be quoted in the proof of Lemma 2.3 later on.
Lemma 2.1.
Next, a sufficient condition is provided in the following result to guarantee the equivalence between two subsets of , which will be described in the proof of Lemma 2.3 later.
Lemma 2.2.
Let . Suppose that there exists a matrix such that , where and . Assume that there exists a -square matrix satisfies
(11) |
Then, if .
Proof.
Let and . Starting from an initial matrix if . It has been shown in [4] that the sequence generated by the following FPI of the form
(16) |
converges at least linearly to the maximal solution of the CDARE (1) if
(17) |
which are main assumptions throughout this paper. The following theorem is quoted from Theorem 3.1 of [4] and it will be applied to deduce the inheritance properties presented in Section 3.
Theorem 2.1.
If the assumptions in (17) are fulfilled, the maximal solution of the CDARE (1) exists. Furthermore, the following statements hold:
-
(i)
The sequence generated by the FPI (16) with is well-defined. Moreover, for all .
-
(ii)
for all and .
-
(iii)
The sequence converges at least linearly to , which is the maximal element of the set and satisfies , with the rate of convergence
whenever .
For any , consider the sequence generated by the FPI
(18) |
where the matrix operators and are defined by (1a) and (5a), respectively. Analogously, the existence of the maximal solution to the transformed DARE (5) can be established by modifying the proof Theorem 3.1 in [4] slightly. It is stated without proof in the following theorem, in which , and if .
Theorem 2.2.
Assume that and . Let the sequence be generated by the FPI (18) with . Then the following statements hold:
-
(i)
is well-defined and for all .
-
(ii)
for all and for all .
-
(iii)
The sequence converges at least linearly to , which is the maximal element of satisfying , with the rate of convergence
provided that .
It is clear that , and the interest is finding some reasonable conditions such that coincides with . Finally, the following lemma can be used to prove the inheritance of the maximal solution to CDAREs, which will be illustrated in the next section.
Lemma 2.3.
Assume that . Let and . The following two statements are equivalent:
-
(i)
.
-
(ii)
.
Moreover, if either (i) or (ii) holds, then and the following two statements are also holded:
-
(iii)
or the pair is stabilizable.
-
(iv)
.
Proof.
The proof of first two equivalence of these statements is given as follows.
- (i) (ii):
-
(ii)(i):
Suppose that the statement (ii) holds. If we let , then .
Suppose that and (ii) holds. From Theorem 2.1 the maximal solution exists and thus . The proof of the remaining part of the lemma are listed below.
-
(i)(iii):
Let , then and this complete the proof of (iii).
- (iii)(iv):
-
(iv)(iii):
Suppose that the statement (iv) holds. If we let , then .
∎
Remark 2.1.
-
1.
Assume that . Recall that if . Thus, if and only if if and only if , an analogous procedure yields if and only if .
-
2.
We conclude that if and if . Indeed, implies that for some with . Then, since . Thus, . Conversely, let and for an element . Then, , i.e., . The same arguments relying on Theorem 2.3 provide that . Furthermore,
That is, . We conclude that . Therefore, .
A similar proof can be given for the .
3 Inheritance properties of the CDARE
In this section, as mentioned previously, we shall clarify which properties will be inherited from the maximal solution of the CDARE (1). Some results of the previous section will be applied in the following properties.
Proposition 3.1.
Assume that . The following statements hold:
-
(i)
and if .
-
(ii)
. The converse is also true if .
-
(iii)
.
Proof.
- (i)
-
(ii)
Observed that
Thus, if .
Conversely, the positiveness of can be verified directly by going through the following computation
if and .
- (iii)
∎
Under some reasonable conditions, it will be shown that the transformed DARE (5) inherits the maximal solution of the CDARE (1) in the following theorem.
Theorem 3.1.
Proof.
From Theorem 2.1, we have deduced that the CDARE (1) has the maximal solution with under the assumptions in (17). That is, and hence and follow from Proposition 3.1. The result together with Proposition 3.1 imply that the sufficient conditions of Theorem 2.2 are fulfilled.
In addition, according to Theorem 3.1, it is natural to determine whether the closed-loop matrices and defined by (9c) and (9d), respectively, might have the same structure. Indeed, the invariance of these closed-loop matrices follows immediately from a more general result presented below.
Theorem 3.2.
Assume that . Then,
-
1.
.
-
2.
. In particular, the closed-loop matrices and coincide for any .
Proof.
Applying the Sherman-Morrison-Woodbury formula (SMWF) with (6b), we see that two matrices
exist, where . Therefore, we conclude that
Especially, if , then and thus . ∎
4 An accelerated fixed-point iteration
According to Theorem 3.1, it is natual to design numerical methods for computing the maximal solution of the CDARE (1) via its tansformed DARE (5b) under the assumptions in (17) and . Although there are dozens of numerical methods presented in the existing literatures for solving standard DAREs, we are mainly concerned with the possibility whether the FPI (18) can be accelerated at least superlinearly for finding the maximal solution of the CDARE (1) in this section.
Since the FPI is usually linearly convergent, a numerical method of higher order of convergence is always required in the practical computation and many real-life applications. Recently, we have proposed an accelerated fixed-point iteration [2] for computing the extremal solutions of a standard DARE
(22) |
ith and . Therefore, we shall extend the idea of AFPI for solving the transformed DARE (5b) with and provide a corresponding convergence theorem in this section.
For any positive integer , we will revisit an accelerated fixed-point iteration of the form
(23a) | ||||
(23b) |
with , for computing the numerical solutions of DARE (22). Here denotes the composition of the operator itself for times, where is a positive integer. Theoretically, the iteration of the form (23) is equivalent to the formula
(24) |
with , and we see that for each .
For the FPI defined by , in which is an initial matrix and the operator is defined by (22), it is shown in [9] that the fixed-point iteration can be rewritten as the following formulation
(25) |
where the sequence of matrices is generated by the following iteration
(26) |
with and for each , provided that the matrices exists for all . Notice that is a binary operator with . Moreover, it has been shown in Theorem 4.2 of [10] that the iteration (26) has the semigroup property and thus satisfies the so-called discrete flow property [10], that is,
(27) |
for any nonnegative integers and . Here the subscript of (27) is an equivalent adjustment to the original formula presented in [10, Theorem 3.2].
Analogously, in order to characterize the construction of the operator defined by (24) with , we define the operator iteratively by
(28) |
with for all and being defined by (26). Furthermore, if we let for and be defined as in (26), then the sequence generated by the iteration
(29) |
which is equivalent to the doubling or strctured doubling algorithms [1, 3]. Indeed, according the semigroup and discrete flow property (27), we have , and for each . That is, under the iteration (29), the sequence of matrices proceeds rapidly with their subscripts being the exponential numbers of base number .From the theoretical point of view, staring with a suitable matrix , the sequence generated by (25) might also converge rapidly to its limit, if the limit exists.
Recently, for any positive integer , Lin and Chiang proposed an efficient iterative method for generating the sequence with order of R-convergence, provided that the operator in (26) is well-defined, see, e.g., Algorithm 3.1 in [10]. Theoretically, this algorithm utilizes the following accelerated iteration
(30) |
with and being the operator defined by (28), for constructing , and , respectively. Therefore, combining (25) and (30), we obtain the pseudocode of AFPI summarized in Algorithm 1.
From Theorem 3.1, note that is a Hermitian solution of the transformed DARE (5b) under the assumptions in (17) and , in which the coefficient maxtices , and are given by (6). Consequently, the maximal solution of the CDARE (1) can be computed numerically by Algorithm 1 with , and , respectively, and the superlinear convergence of the AFPI performed by Algorithm 1 will be stated as follows.
Theorem 4.1.
5 Numerical examples
In this section we shall give two examples to illustrate the correctness of aforementioned theorems in this paper and the feasibility of the FPI (16) and the AFPI presented in Section 4. In our numerical experiments shown below, we will measure the normalized residual
for each quantity computed by the FPI (16) or Algorithm 1, where denotes the matrix -norm. In our numerical results, each iterative method was terminated when .
All numerical experiments were performed on ASUS laptop (ROG GL502VS-0111E7700HQ), using Microsoft Win- dows 10 operating system and MATLAB Version R2019b, with Intel Core i7-7700HQ CPU and 32 GB RAM.
Example 5.1.
We first consider a scalar CDARE (1) of the form
(31) |
where , with and with . Without loss of generality, we assume that , and thus . From (31) and , we obtain
which has two solutions satisfying
(32) |
if the discriminant . Note that if and only if or .
For any , let the coefficient matrices of the CDARE (1a) be defined by
where the entries , , and are randomly generated by MATLAB coomands rand, randn, crand and crandn, respectively. It is easily seen that the CDARE (1a) has two extremal solutions, namely,
with and being defined by (32). Moreover, the maximal solution of the CDARE (1a) satisfies .
In our numerical experiments we tested the CDAREs with . Starting with an initial matrix , the FPI (16) produced a highly assurate approximation to the maximal solution after iterations. In this case, its relative error is about and . The numerical results are reported in Table 1.
On the other hand, in order to verify the correctness of Theorem 3.1 numerically, we transformed the CDARE (1a) to the associated DARE (5) of coefficient matrices defined by (6). Based on these matrices, we computed an approximation to the maximal solution of the DARE (5) via NATLAB built-in command dare. Note that its relative error and the difference between and are
which give a numerical evidence for the inheritance property presented in Theorem 3.1. In addition, applying the AFPI(2) performed by Algorithm 1 with , , and , it generated an extremely accurate approximation to with absolute error being after 3 iterations, and the numerical results are shown in Table 2. Again, the validity of Theorem 3.1 follows from this numerical experiment.
NRes() | ||
---|---|---|
Example 5.2.
In this example we shall consider a critical case of the CDARE (1a) with coefficient matrices defined as in Example 5.1. For , it follows from (32) that the discriminant and hence . In this case, the spectrum of the matrix associated with the maximal solution is , where is a simple eigenvalue of .
Although the upper bound of the convergence rate presented in Theorem 2.1 is not applicable here, starting with a suitable matrix , the FPI (16) still converges to the maximal solution of the CDARE theoretically, but the order of convergence might be linear or even sublinear. With this reason, we apply the AFPI() presented in Algorithm 1 for computing the maximal solution of the CDARE (1) with and different values of . After the given CDARE is transformed into the DARE (5), starting from , , and , the convergence histories of AFPI() are shown in Figure 1 for , , and , respectively.

In particular, AFPI(100) produced an approximation of significant digits after iterations, since its relative error is about . The numerical results of AFPI(100) are reported in Table 3.
NRes() | ||
---|---|---|
6 Concluding remarks
In this paper we mainly deal with a class of conjugate discrete-time Riccati equations, arising originally from the LQR control problem for discrete-time antilinear systems. In this case, the design of the optimal controller usually depends on the existence of a unique positive semidefinite optimizing solution of CDAREs (1a) with and , if the antilinear system is assumed to be controllable. Recently, under the assumptions in (17), it is shown in [4] that the existence of the maximal Hermitian solution can be extended to the CDARE (1a) with being nonsingular and , respectively, which is summarized in Theorem 2.1.
From Theorem 2.1, Theorem 2.2 and Lemma 3.1, we have deduced that the CDARE (1) and its transformed DARE (5) both have the same maximal Hermitian solution in Theorem 3.1. As a special case mentioned in Theorem 3.2, their corresponding closed-loop matrices related to coincide as well. To our best knowledge, these inheritance properties of the CDARE (1) have not been shown in the existing literatures.
From the computational point of view, inspired by Theorem 3.1, the AFPI presented in Algorithm 1 is proposed for computing via the transformed DARE (5) directly. Numerical results in Section 5 show the correctness of Theorem 3.1 and the feasibility of the AFPI for finding the maximal solution of CDAREs numerically. In particular, although the convergence rate of the AFPI presented in Theorem 4.1 is no longer applicable for Example 5.2, it seems that our AFPI algorithm still performed well when the CDARE (1) has a maximal and almost stabilizing solution,and we shall further investigate this critical case in our futute work.
Acknowledgment
This research work is partially supported by the National Science and Technology Council of Taiwan and the National Center for Theoretical Sciences of Taiwan. The first author (Chun-Yueh Chiang) would like to thank the support from the National Science and Technology Council of Taiwan under the grant MOST 111-2115-M-150-001-MY2, and the corresponding author (Hung-Yuan Fan) would like to thank the support from the National Science and Technology Council of Taiwan under the grant MOST 111-2115-M-003-012.
References
- [1] B. D. O. Anderson. Second-order convergent algorithms for the steady-state Riccati equation. In 1977 IEEE Conf. Decis. Control 16th Symp. Adapt. Process. Spec. Symp. Fuzzy Set Theory Appl., pages 948–953, New Orleans, LA, USA, Dec. 1977. IEEE.
- [2] C.-Y. Chiang and H.-Y. Fan. An efficient iteration for the extremal solutions of discrete-time algebraic Riccati equations. arXiv, (arXiv:2111.08923), Nov. 2021.
- [3] E. K.-W. Chu, H.-Y. Fan, W.-W. Lin, and C.-S. Wang. Structure-preserving algorithms for periodic discrete-time algebraic Riccati equations. Int. J. Control, 77(8):767–788, May 2004.
- [4] H.-Y. Fan and C.-Y. Chiang. On the maximal solution of the conjugate discrete-time algebraic Riccati equation. Appl. Math. Lett., 135:108438, Jan. 2023.
- [5] T. Gudmundsson, C. Kenney, and A. Laub. Scaling of the discrete-time algebraic Riccati equation to enhance stability of the Schur solution method. IEEE Trans. Automat. Contr., 37(4):513–518, Apr. 1992.
- [6] M. Kimura. Convergence of the doubling algorithm for the discrete-time algebraic Riccati equation. Int. J. Syst. Sci., 19(5):701–711, Jan. 1988.
- [7] P. Lancaster and L. Rodman. Algebraic Riccati Equations. Oxford Science Publications. Clarendon Press ; Oxford University Press, Oxford : New York, 1995.
- [8] A. Laub. A Schur method for solving algebraic Riccati equations. IEEE Trans. Automat. Contr., 24(6):913–921, Dec. 1979.
- [9] M. M. Lin and C.-Y. Chiang. An accelerated technique for solving one type of discrete-time algebraic Riccati equations. J. Comput. Appl. Math., 338:91–110, Aug. 2018.
- [10] M. M. Lin and C.-Y. Chiang. On the semigroup property for some structured iterations. J. Comput. Appl. Math., 374:112768, Aug. 2020.
- [11] H. Liu, T. Wang, and D. Guo. Design and validation of zeroing neural network to solve time-varying algebraic Riccati equation. IEEE Access, 8:211315–211323, 2020.
- [12] S. Miyajima. Verified computation for the Hermitian positive definite solution of the conjugate discrete-time algebraic Riccati equation. J. Comput. Appl. Math., 350:80–86, Apr. 2019.
- [13] T. Pappas, A. Laub, and N. Sandell. On the numerical solution of the discrete-time algebraic Riccati equation. IEEE Trans. Automat. Contr., 25(4):631–641, Aug. 1980.
- [14] S. Riaz, H. Lin, and M. P. Akhter. Design and implementation of an accelerated error convergence criterion for norm pptimal iterative learning controller. Electronics, 9(11):1766, Oct. 2020.
- [15] S. Riaz, H. Lin, and H. Elahi. A novel fast error convergence approach for an optimal iterative learning controller. Integrated Ferroelectrics, 213(1):103–115, Jan. 2021.
- [16] P. Van Dooren. A generalized eigenvalue approach for solving Riccati equations. SIAM J. Sci. and Stat. Comput., 2(2):121–135, June 1981.
- [17] A.-G. Wu, Y.-Y. Qian, W. Liu, and V. Sreeram. Linear quadratic regulation for discrete-time antilinear systems: An anti-Riccati matrix equation approach. J. Franklin Inst., 353(5):1041–1060, Mar. 2016.
- [18] A.-G. Wu and Y. Zhang. Complex Conjugate Matrix Equations for Systems and Control. Communications and Control Engineering. Springer Singapore, Singapore, 2017.