Abstract
Nonsymmetric differential matrix Riccati equations arise in many problems related to science and engineering. This work is focusing on the sensitivity of the solution to perturbations in the matrix coefficients and the initial condition. Two approaches of nonlocal perturbation analysis of the symmetric differential Riccati equation are extended to the nonsymmetric case. Applying the techniques of Fréchet derivatives, Lyapunov majorants and fixed-point principle, two perturbation bounds are derived: the first one is based on the integral form of the solution and the second one considers the equivalent solution to the initial value problem of the associated differential system. The first bound is derived for the nonsymmetric differential Riccati equation in its general form. The perturbation bound based on the sensitivity analysis of the associated linear differential system is formulated for the low-dimensional approximate solution to the large-scale nonsymmetric differential Riccati equation. The two bounds exploit the existing sensitivity estimates for the matrix exponential and are alternative.
Keywords:
non-linear matrix equations; perturbation bounds; Lyapunov majorants; fixed-point principle; nonsymmetric differential matrix Riccati equation MSC:
15A24
1. Introduction and Notations
In the present paper, we consider the nonsymmetric differential matrix Riccati equation /NDRE/
where the solution is a real matrix and , , and are the coefficient matrices and is a given initial value.
We assume that the matrix
is a nonsingular M-matrix, or an irreducible singular M-matrix. (Recall that a real square matrix A is said M-matrix if with and , where denotes the spectral radius. If , the M-matrix A is nonsingular.) As a consequence, [1], A and D are both nonsingular M-matrices and can be decomposed as and , where , are positive and , are nonsingular M-matrices. The NDRE (1) can then be formulated as
The solution of NDRE (1) is given by the implicit formula [2]
Let us now consider a nonsingular solution to the nonsymmetric algebraic Riccati equation
In [1], it is proved that if is assumed to be a nonsingular M-matrix, then the NDRE (1) has a global solution , provided that the initial value satisfies the condition , where for every matrices A, , we write if for all and .
Nonsymmetric differential Riccati equations are related to linear boundary value problems arising in game and control theory, oscillation criterion problems for second order differential systems, variational calculus and theory of transport processes [3]. NDRE are an intermediate step in problems from singular perturbations and control theory when linear transformations are applied to reduce high-order systems to lower order or to partially decomposed systems. The properties of nonsymmetric differential Riccati equations determine the existence of the optimal open-loop strategies in Nash and Stackelberg control in game theory [4]. NDRE are induced via invariant embedding and interpretation formula from an “angularly shifted” transport model in the slab geometry [2]. Of mathematical interest, nonsymmetric differential Riccati equation describes the local coordinates of the restriction to a subset of the Lagrangian Grassmannian manifold. The most important results for NDRE are generalized in [5]. Fital and Guo, in [1], prove that for a suitable initial value , the initial value problem (1) has a nonnegative solution , which converges to the stable equilibrium of (1). A closed formula, in terms of exponential of data matrices, for the general solution of (1), when S is invertible, is proposed in [6]. An analytical review of existing numerical methods to find the minimal nonnegative solution to low-dimensional NDRE (1) is given in [7], where the approximate low-dimensional solution to the large-scale case with low-dimensional right hand side is obtained after projecting (1) to low-dimensional differential equation by applying the extended block Arnoldi process.
The numerically computed solution contains errors, as a result of truncation of infinite series, round-off errors due to the finite precision machine arithmetic, error of stopping iteration procedures, etc. The computed perturbed solution can be represented as the exact solution of a slightly perturbed problem, simulating the effect of the errors mentioned above by equivalent perturbations in the data matrices. To estimate the actual error in the computed solution, it is important to find a bound of the error in the computed solution in terms of the perturbations in the data. Perturbation analysis of the nonsymmetric algebraic Riccati equation is given in [8], normwise, mixed and componentwise condition numbers, as well as residual bounds are proposed in [9,10,11]. To the best of our knowledge, the sensitivity and the conditioning of the NDRE are not yet analyzed.This work has two goals. First, we study the sensitivity of the solution to (1) to perturbations in the matrix coefficients A, D, Q, S, . It is done by adapting the bounds established for the symmetric differential Riccati equation, obtained by [12,13] to the nonsymmetric Riccati equation, which show good upper sensitivity. The perturbation bounds are very important for interpreting a numerically computed solution. The second objective is to apply the derived nonlocal perturbation bound to estimate the error of approximation in the solution when solving large-scale nonsymmetric differential Riccati equations by Krylov-type methods.
The paper is organized as follows: In Section 2, nonlocal sensitivity analysis of the nonsymmetric differential matrix Riccati Equation (1) is presented. An effective perturbation bound is proposed. In Section 3, an alternative perturbation bound based on the sensitivity analysis of the associated differential system is derived and then applied for estimating the error of approximation of the low-dimensional approximate solution. The bounds exploit existing sensitivity estimates of the matrix exponential. Numerical examples are presented in Section 4 to illustrate the theoretical results established in this work.
Throughout the paper, the following notations are used: denotes the space on real matrices, is the spectral norm , where is the maximum eigenvalue of the symmetric matrix N, is the Frobenius norm, is the transpose of the matrix , is the unit matrix, and the symbol stands for “equal by definition”.
2. Nonlocal Perturbation Bound of NDRE
In this section, we will extend the approach proposed in [12] to the nonsymmetric differential Riccati Equation (1).
Let us denote by the collection of matrix coefficients and by the collection of equivalent perturbations in the data. The perturbation is continuous with , where is a low-order polynomial in n and is the round-off unit of the machine arithmetic. If some of the matrix coefficients are not perturbed, then the corresponding perturbations are assumed to be zero. The perturbed nonsymmetric differential matrix Riccati equation, obtained from (1) by replacing the nominal values by , () is given by
where is the solution to the perturbed nonsymmetric differential matrix Riccati Equation (3). For sufficiently small perturbations in the data , the solution to the perturbed Equation (3) exists and depends continuously on the elements of the perturbations in the data Z. Let ; ; ; ; be the perturbation vector, where for .
Our aims in this section, are to extend the results obtained in [12] for the symmetric differential matrix Riccati equation to the nonsymmetric case (1) and to give a bound for the perturbations in the solution as a function of the perturbation vector .
From (3), taking into account (1), we can write the perturbation of the solution as
where , are the closed-loop matrices and is the operator
defined for some matrix , with
and spectral norm
From (4), we can state the following nonlocal perturbation bound:
Theorem 1.
Let be the perturbation in a solution to Equation (1), solved by a numerically stable algorithm in finite precision arithmetic according to the perturbation vector , , , , . Let us define the set
where
with
and is the fundamental matrix of equation for some real matrix P.
If δ satisfies the inclusion
for given in (8), then the norm of the perturbation is bounded by the nonlocal perturbation bound
Proof.
Premultiplying and postmultiplying the differential Equation (4) by the factors and respectively, and integrating with respect to from 0 to t, we obtain the equivalent integral form of the initial value problem (4) [2]:
According to its definition, satisfies
Equation (14) can be stated as
where the operator is defined as
The spectral norm of the operator in terms of (7), (9)–(11) is
and the second order polynomial
with , defined in (9) via (10), (11) is a Lyapunov majorant for the operator such that
In a similar way, for two arbitrary matrices , with , we get
where . If inequalities (17) and (20) hold and for any positive number such as
then the operator is a contraction on the ball According to the fixed-point principle [14], the operator Equation (16) admits a solution such that for
we have
which concludes the proof. □
The perturbation bound formulated in Theorem 1 is a nonlocal sensitivity bound. The inclusion (12), (8) guarantees that there exists a solution of the perturbed Equation (3) for which the bound (13) holds.
Let . Then (9) and (8) yield
and
with and . The estimate (13) becomes
The assumption for to be a nonsingular M-matrix implies that the closed loop-matrices and are nonsingular M-matrices too [15]. This allows us, to facilitate the computation of the terms and , to derive computable bounds for the spectral norm of the fundamental matrices and
based on the logarithmic norms
of the closed-loop matrices and , respectively.
3. Sensitivity of Low-Dimensional Approximate Solutions to Large-Scale NDRE
For large NDRE with low-rank matrix Q, decomposed as with , and , we proposed in [7] to project the problem (1) onto extended Krylov subspace and applying the Extended block Arnoldi algorithm and to obtain the approximate solution
where solves the projected low-dimensional NDRE
instead of the exact solution to (1). Here , , and the block Hessenberg matrices and are obtained after transformation by the orthonormal matrices and composed of the orthonormal bases and , . The orthonormal bases are generated after applying the Extended block Arnoldi algorithm to the pairs and ; see [7] for more details.
The classical theory of Radon (see, e.g., [5]) states that any solution of the low-dimensional NDRE (24) is locally equivalent to a solution of the initial value problem
where , with and , .
The solution of (25) is
If the matrix is nonsingular, the solution of the projected low-order nonsymmetric differential Riccati Equation (24) is represented as [16]
To estimate the sensitivity of the problem (24), we consider the strategies proposed in [13]. We represent the calculated perturbed solution to (24) with collection of data coefficients = as the exact solution to a slightly perturbed problem with collection of data coefficients . The data perturbation ∈ with , , reflects the effect of round-off errors and approximation errors in the computed solution to (24).
The perturbed projected low-dimensional NDRE is
The equivalent to (28) initial value problem is
where
The perturbations , , , are analytical functions of the data perturbations and reflect the errors in the solution + to the perturbed linear differential system
According to (26) and (30), the perturbation is
If the matrix
is invertible, then the solution
with and given in (31) to the perturbed projected low-dimensional Equation (28) exists.
The perturbation bound of the solution to the NDRE (24) consists of finding an interval such that for each , the matrix is invertible and then the perturbed solution given by (32) exists, as well as to derive a normwise bound in terms of spectral norm for the error in the solution (32) as a function of the equivalent perturbations in the data coefficients .
We formulate the following perturbation bound of the solution to the projected low-dimensional NDRE (24).
Theorem 2.
Proof.
The initial value of problem (25) is . Then, according to (26) , . The matrix is invertible and its inverse is . Denote by the singular values of the matrix . Then the interval can be chosen from
From (32) and taking into account (27), the perturbation in the solution to the projected low-dimensional NDRE satisfies
Applying the property , which is valid for any matrices , with existing inverse and [17], from (37), we obtain
provided that
Using the fact that for any matrix , we have
the norms of the perturbations and can be estimated by
and
Replacing and in (38) by and from (39), (40), we prove the non-local bound as stated in (35).
In order to represent the norm of the perturbation in terms of and by the norms of the perturbations in the data matrices and , we consider the perturbed differential Equation (29). We have
Then, taking the spectral norm, we have
where and is an upper bound for , i.e., .
Some bounds for the matrix exponential based on Jordan and Schur matrix decompositions, logarithmic norm and power series are summarized in [18]:
with constants , , and p, listed in Table 1.
Here ; is the dimension of the maximum block in the Jordan canonical form of where the matrix Y is chosen so as the condition number to be minimized; ; is the spectral abscissa of , i.e., the maximum real part of the eigenvalues of ; is the Schur decomposition of with unitary matrix U, chosen so as to be minimized, diagonal matrix and - strictly upper triangular matrix with index of nilpotency
The results stated in Theorem 2 can be used to formulate a perturbation bound for the solution to the large-scale NDRE (1).
Theorem 3.
Let a large-scale NDRE (1) for which the constant matrix coefficient Q is low-rank and can decomposed as with , , () be projected onto a pair of extended Krylov subspaces and . Let be its approximate solution as stated in (23), obtained by applying the Extended block Arnoldi algorithm to the projected low-dimensional NDRE
with solution and perturbation bound (35) as defined in Theorem 2. A perturbation bound in terms of spectral norm for the approximate solution to (1) is given by
for , with as defined in (34) and stated in (26), , stated in (33), .
Proof.
The proof follows directly from the definition (23) of the approximate solution and the preservation of the spectral norm by unitary matrices. □
Next, we apply the preceding results to estimate the approximation error of the approximate solution to the projected low-dimensional NDRE versus the exact solution to (1) from Theorem (4), which was already established by the authors in [19].
Theorem 4.
Let us rewrite the NDRE associated with the error
in the equivalent form
where , , with
Here , . As the unitary matrices and have unit spectral norm, we have and . We notice that the fact that the term tends normwisely to 0 as m increases implies that the spectral norm of , decreases towards 0. This allows us to consider , as equivalent data perturbations, and Equation (43) as an equation of the perturbation in the solution. Equation (43) is equivalent to the NDRE (4) of the perturbation in the perturbed NDRE (2). This allows us to apply the technique of the nonlocal perturbation analysis of the NDRE, based on the integral solution to the NDRE and the statements of Theorem 1 to formulate a bound for the error .
Theorem 5.
For , , satisfying , the spectral norm of the error , solution to the NDRE (43), is bounded by
where
for , and being the fundamental matrix of equation .
4. Numerical Examples
To illustrate the effectiveness of the bounds proposed in Theorems 1 and 2, we consider nonsymmetric differential matrix Riccati equations of type (1) on a time interval , for different matrix coefficients and for several sizes. The experimental tests are performed with Matlab R2020a on an Intel processor laptop equipped with 16GB of RAM. The reference solutions to the NDRE (1) and to the perturbed NDRE (3) are computed by the backward differential formula - BDF1-Newton method, see [19] for more details.
Example 1.
Consider the NDRE (1), constructed according to the rules given in [15]. This scheme is used in [10] to analyze the effectiveness of mixed and componentwise condition numbers, and in [11], to illustrate the validity of a condition number and backward errors of nonsymmetric algebraic Riccati equation.
Experiment 1.
In [10], an equation of sizeis considered and the perturbations are chosen as:
The results, obtained for the estimated value - the relative perturbationand the estimate—the relative bound, withgiven by (8)–(13) forandare listed in Table 2.
The same experimental statement is used to test the accuracy of the estimate (34) and (35) from Theorem 2. The results obtained forare listed in Table 4 forand in Table 5 for. Comparing the results for the bound (34) and (35) to these for the bound (8)–(13) given in Table 2 and Table 3, it is seen that the two bounds are of the same size of the domain of validity. The bound (8)–(13) from Theorem 1 is superior to the bound (34) and (35) from Theorem 2 with respect of closeness to the estimated quantity. However, the bound (34) and (35) from Theorem 2 has the advantage that it is not related with the solution of the NDRE and hence with problems of divergence of the numerical procedure.
Experiment 2.
The size n of the matricesvaries from 5 to 50. The perturbations are randomly generated following the schemeforand. The average values over 30 trials for the relative perturbationand the bound,from (8)–(13), for,,andare displayed in Figure 1 for.
Figure 1.
Example 2, experiment 2, bound f (t)= f(δ, t), (8)–(13) from Theorem 1, α = 0, j = 12, t = 0.2 to 0.8 and n from 5 to 50.
It appears in Figure 1 that forand j from 10 to 4, the boundremains of the order of the estimated value.
The average values over 30 trials for the relative perturbationand the bound,from (8)–(13) for,,andare displayed in Figure 2 for.
Figure 2.
Example 2, experiment 2, bound f (t)= f(δ, t), (8)–(13) from Theorem 1, α = 5, j = 12, t = 0.2 to 0.8, n from 5 to 50.
The results for the perturbation bound, (8)–(13) from Theorem 1, visualized on Figure 1 and Figure 2 demonstrate that the perturbation bound, (8)–(13) is an effective upper perturbation bound ofin a large range of the size n of the NDRE (1) (n varies from 5 to 50). With the increasing of the dimension n of Equation (1), the accuracy of the estimate improves.
Example 2.
This example tests the effectiveness of the bound (9)–(13) in the case of large-scale NDRE. We consider a NDRE of order , arising in neutron transport theory
on time interval , with matrices
where the sequences and , are the nodes and weights of the Gaussian-Legendre quadrature on , respectively:
The perturbation is chosen as:
The results, obtained for the relative perturbation and the nonlocal bound (8)–(13) for and 2 are shown in Table 6.
As is seen, over all the interval of integration , the perturbation bound from (8)–(13) is valid, i.e., the condition (8) for existence of the bound is not deteriorated. The bound is a quite sharp upper bound—remains in the order of the estimated value. The perturbation bound formulated in Theorem 1 is effective and could be used to estimate the sensitivity even of a large-scale NDRE.
5. Conclusions
In this paper, a nonlocal sensitivity analysis of the nonsymmetric differential matrix Riccati equation is presented. Two computable perturbation bounds are derived using the techniques of Fréchet derivatives, Lyapunov majorants and fixed-point principles, developed in [14]. The first bound is based on the integral form of the solution. The second one exploits the statement of the classical Radon’s theory of local equivalence of the solution to the differential matrix Riccati equation to the solution of the initial value problem of the associated differential system. It has the advantage of not being related with the solution of the NDRE and hence with problems of divergence of the numerical procedure. Numerical examples show that the estimates proposed are fairly sharp for both low-dimensional and large-scale NDRE. The perturbation bound is a crucial issue of the process of numerical solution of an equation as well as a tool to evaluate the stability of the computation process. The tight perturbation bounds, proposed in the paper, allow estimation of the accuracy of the solution to a numerically solved nonsymmetric differential matrix Riccati equation.
Author Contributions
Conceptualization, V.A. and K.J.; methodology, V.A. and K.J.; software, M.H.; validation, V.A., M.H. and K.J.; writing—original draft preparation, V.A., M.H. and K.J.; writing—review and editing, V.A., M.H. and K.J.; visualization, V.A., M.H. and K.J.; supervision, K.J.; project administration, V.A., M.H. and K.J.; funding acquisition, V.A. All authors have read and agreed to the published version of the manuscript.
Funding
This work was partially supported by grant BG PLANTNET “Establishment of national information network genbank—Plant genetic resources”.
Acknowledgments
Mustapha Hached acknowledges support from the Labex CEMPI (ANR-11-LABX-0007-01).
Conflicts of Interest
The authors declare no conflict of interest.
References
- Fital, S.; Guo, C.H. Convergence of the solution of a nonsymmetric matrix Riccati differential equation to its stable equilibrium solution. J. Math. Anal. Appl. 2006, 318, 648–657. [Google Scholar] [CrossRef]
- Juang, J. Global existence and stability of solutions of matrix Riccati equations. J. Math. Analy. Appl. 2001, 258, 1–12. [Google Scholar] [CrossRef]
- Abou-Kandil, H.; Freiling, G.; Ionescu, V.; Jank, G. Matrix Riccati Equations in Control and Systems Theory. In Systems & Control: Foundations & Applications; Birkhäuser: Basel, Switzerland, 2003. [Google Scholar]
- Freiling, G.; Jank, G.; Lee, S.R. Existence and uniqueness of open-loop Stackelberg equilibra in linear-quadratic differential games. J. Opt. Theo. Appl. 2001, 110, 515–544. [Google Scholar] [CrossRef]
- Freiling, G. A survey of nonsymmetric Riccati equations. Lin. Alg. Appl. 2002, 351, 243–270. [Google Scholar] [CrossRef]
- Jódar, L. A formula for the general solution of Riccati type matrix differential equations. Systems Cont. Let. 1989, 12, 39–43. [Google Scholar] [CrossRef]
- Guldogan, Y.; Hached, M.; Jbilou, K.; Kurulay, M. Low rank approximate solutions to large-scale differential matrix Riccati equations. App. Math. 2018, 45, 233–254. [Google Scholar] [CrossRef]
- Guo, C.-H.; Higham, N.J. Iterative solution of a nonsymmetric algebraic Riccati equation. SIAM J. Matrix Anal. Appl. 2007, 29, 396–412. [Google Scholar] [CrossRef]
- Lin, Y.; Wei, Y. Normwise, mixed and componentwise condition numbers of nonsymmetric algebraic Riccati equation. Appl. Math. Comput. 2008, 27, 137–147. [Google Scholar] [CrossRef]
- Liu, L. Mixed and componentwise condition numbers of nonsymmetric algebraic Riccati equation. Appl. Math. Comput. 2012, 218, 7595–7601. [Google Scholar] [CrossRef]
- Liu, L.; Xu, A.-F. Condition number and backward errors of nonsymmetric algebraic Riccati equation. Appl. Math. Comput. 2014, 242, 716–728. [Google Scholar] [CrossRef]
- Konstantinov, M.; Pelova, G. Sensitivity of the solutions to differential matrix Riccati equations. IEEE Trans. Automat. Control 1991, 36, 213–215. [Google Scholar] [CrossRef]
- Konstantinov, M.; Angelova, V. Sensitivity analysis of the differential matrix Riccati equation based on the associated linear differential system. Adv. Comp. Math. 1997, 7, 295–301. [Google Scholar] [CrossRef]
- Konstantinov, M.; Gu, D.; Mehrmann, V.; Petkov, P. Perturbation Theory for Matrix Equations; Elsevier: Amsterdam, The Netherlands, 2003. [Google Scholar]
- Guo, C.-H. Nonsymmetric algebraic Riccati equation and Winner-Hopf factorization for M-matrices. SIAM J. Matrix Anal. Appl. 2001, 23, 225–242. [Google Scholar] [CrossRef]
- Choi, C.; Laub, A.J. Constructing Riccati differential equations with known analytic solutions for numerical experiments. IEEE Trans. Automat. Control 1990, AC-35, 437–439. [Google Scholar] [CrossRef]
- Lancaster, P. The Theory of Matrices; Academic Press: New York, NY, USA, 1969. [Google Scholar]
- Petkov, P.; Christov, N.; Konstantinov, M. Computational Methods for Linear Control Systems; Prentice-Hall: Hemel Hempstead, UK, 1991. [Google Scholar]
- Angelova, V.; Hached, M.; Jbilou, K. Approximate solutions to large nonsymmetric differential Riccati problems with applications to transport theory. Numer. Lin. Alg. Appl. 2020, 27, e2272. [Google Scholar] [CrossRef]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. |
© 2021 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).