Next Article in Journal
Comparisons of Parallel Systems with Components Having Proportional Reversed Hazard Rates and Starting Devices
Next Article in Special Issue
A Multidimensional Principal Component Analysis via the C-Product Golub–Kahan–SVD for Classification and Face Recognition
Previous Article in Journal
InterCriteria Analysis: Application for ECG Data Analysis
Previous Article in Special Issue
An Inverse Mixed Impedance Scattering Problem in a Chiral Medium
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Sensitivity of the Solution to Nonsymmetric Differential Matrix Riccati Equation

by
Vera Angelova
1,†,
Mustapha Hached
2,*,† and
Khalide Jbilou
3,†
1
Department of Intelligent Systems, Institute of Information and Communication Technologies, Bulgarian Academy of Sciences, Akad. G. Bonchev, Bl. 2, 1113 Sofia, Bulgaria
2
Université de Lille, CNRS, UMR 8524-Laboratoire Paul Painlevé, F-59000 Lille, France
3
Laboratoire LMPA, 50 Rue F. Buisson, ULCO Calais, CEDEX, 62228 Calais, France
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Mathematics 2021, 9(8), 855; https://doi.org/10.3390/math9080855
Submission received: 1 March 2021 / Revised: 2 April 2021 / Accepted: 10 April 2021 / Published: 14 April 2021
(This article belongs to the Special Issue Numerical Linear Algebra and the Applications)

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.

1. Introduction and Notations

In the present paper, we consider the nonsymmetric differential matrix Riccati equation /NDRE/
X ˙ ( t ) = A X ( t ) X ( t ) D + X ( t ) S X ( t ) + Q , X ( 0 ) = X 0 .
where the solution X ( t ) is a n × p real matrix and A R n × n , D R p × p , Q R n × p and S R p × n are the coefficient matrices and X 0 R n × p is a given initial value.
We assume that the matrix
H = D S Q A R p + n × p + n
is a nonsingular M-matrix, or an irreducible singular M-matrix. (Recall that a real square matrix A is said M-matrix if A = s I B with B 0 and s r ( B ) , where r ( . ) denotes the spectral radius. If s > r ( B ) , the M-matrix A is nonsingular.) As a consequence, [1], A and D are both nonsingular M-matrices and can be decomposed as A = A 1 A 2 and D = D 1 D 2 , where A 2 , D 2 are positive and A 1 , D 1 are nonsingular M-matrices. The NDRE (1) can then be formulated as
X ˙ ( t ) + X ( t ) D 1 + A 1 X ( t ) = A 2 X ( t ) + X ( t ) D 2 + X ( t ) S X ( t ) + Q X ( 0 ) = X 0 .
The solution of NDRE (1) is given by the implicit formula [2]
X ( t ) = e t A 1 X 0 e t D 1 + 0 t e ( t τ ) A 1 Q e ( t τ ) D 1 d τ + 0 t e ( t τ ) A 1 X ( τ ) S X ( τ ) + A 2 X ( τ ) + X ( τ ) D 2 e ( t τ ) D 1 d τ .
Let us now consider a nonsingular solution X * to the nonsymmetric algebraic Riccati equation
A X X D + X S X + Q = 0 .
In [1], it is proved that if H is assumed to be a nonsingular M-matrix, then the NDRE (1) has a global solution X ( t ) , provided that the initial value X 0 satisfies the condition 0 X 0 X * , where for every matrices A, B R m × n , we write A B if a i j b i j for all i { 1 , , m } and j { 1 , , n } .
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 X 0 , the initial value problem (1) has a nonnegative solution X ( t ) , 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 X ( t ) to (1) to perturbations in the matrix coefficients A, D, Q, S, X 0 . 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: R m × n denotes the space on m × n real matrices, . is the spectral norm M = [ λ max ( M M ) ] 1 / 2 , where λ max ( N ) is the maximum eigenvalue of the symmetric matrix N, . F is the Frobenius norm, A is the transpose of the matrix A R m × n , I n is the n × n 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 Z : = ( A , D , Q , S , X 0 ) the collection of matrix coefficients and by Δ Z : = ( Δ Z , Δ D , Δ Q , Δ S , Δ X 0 ) the collection of equivalent perturbations in the data. The perturbation Δ Z Δ Z is continuous with Δ Z macheps ϕ ( n ) Z , where ϕ ( n ) is a low-order polynomial in n and macheps 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 Z Z by Z + Δ Z , ( Δ Z Δ Z ) is given by
( X ( t ) + Δ X ( t ) ) = ( A + Δ A ) ( X ( t ) + Δ X ( t ) ) ( X ( t ) + Δ X ( t ) ) ( D + Δ D ) + ( X ( t ) + Δ X ( t ) ) ( S + Δ S ) ( X ( t ) + Δ X ( t ) ) + Q + Δ Q , X ( 0 ) + Δ X ( 0 ) = X 0 + Δ X 0 ,
where X ( t ) + Δ X ( t ) is the solution to the perturbed nonsymmetric differential matrix Riccati Equation (3). For sufficiently small perturbations Δ Z Δ Z in the data Z Z , the solution X ( t ) + Δ X ( t ) to the perturbed Equation (3) exists and depends continuously on the elements of the perturbations Δ Z in the data Z. Let δ : = [ δ A ; δ D ; δ Q ; δ S ; δ X 0 ] R + 5 be the perturbation vector, where δ Z : = Δ Z for Δ Z Δ Z .
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 Δ X ( t ) f ( δ , t ) as a function of the perturbation vector δ .
From (3), taking into account (1), we can write the perturbation of the solution as
Δ X ˙ ( t ) = A c ( t ) Δ X ( t ) Δ X ( t ) D c ( t ) + M ( t , Δ X ( t ) ) , Δ X ( 0 ) = Δ X 0 ,
where A c ( t ) : = A X ( t ) S , D c ( t ) : = D S X ( t ) are the closed-loop matrices and M ( t , P ) is the operator
M ( t , P ) : = M 1 ( t , P ) + M 2 ( t , P ) ,
defined for some matrix P R n × p , with
M 1 ( t , P ) : = X ( t ) Δ S X ( t ) Δ A X ( t ) X ( t ) Δ D + Δ Q , M 2 ( t , P ) : = ( Δ A X ( t ) Δ S ) P P ( Δ D Δ S X ( t ) ) + P ( S + Δ S ) P
and spectral norm
M ( t , P ) X ( t ) 2 δ S + X ( t ) ( δ A + δ D ) + δ Q + P ( δ A + 2 X ( t ) δ S + δ D ) + P 2 ( S + δ S ) .
From (4), we can state the following nonlocal perturbation bound:
Theorem 1.
Let Δ X ( t ) be the perturbation in a solution X ( t ) to Equation (1), solved by a numerically stable algorithm in finite precision arithmetic according to the perturbation vector δ : = ( δ A , δ D , δ Q , δ S , δ X 0 ) . Let us define the set Ω t
Ω t : = { δ 0 , a 1 ( δ ) + 2 a 0 ( δ ) a 2 ( δ ) 1 } R + 5 ,
where
a 0 ( δ ) : = ν ( S + δ S ) , a 1 ( δ ) : = ν ( δ A + 2 X ( t ) δ S + δ D ) , a 2 ( δ ) : = ν δ Q + ν X ( t ) ( δ A + δ D ) + ν X ( t ) 2 δ S + β δ X 0 ,
with
β = max { Φ A c ( 0 , t ) Φ D c ( 0 , t ) : t T } ,
ν = max { 0 t Φ A c ( τ , t ) Φ D c ( τ , t ) d τ : t T } ,
and Φ P ( t , t 0 ) = e ( t t 0 ) P is the fundamental matrix of equation η ˙ ( t ) = P η ( t ) for some real matrix P.
If δ satisfies the inclusion
δ Ω t ,
for Ω t given in (8), then the norm of the perturbation Δ X ( t ) is bounded by the nonlocal perturbation bound
Δ X ( t ) f ( δ , t ) : = 2 a 2 ( δ ) 1 a 1 ( δ ) + ( 1 a 1 ( δ ) ) 2 4 a 0 ( δ ) a 2 ( δ ) .
Proof. 
Premultiplying and postmultiplying the differential Equation (4) by the factors e ( t τ ) A c ( τ ) and e ( t τ ) D c ( τ ) respectively, and integrating with respect to τ from 0 to t, we obtain the equivalent integral form of the initial value problem (4) [2]:
Δ X ( t ) = e t A c ( t ) Δ X 0 e t D c ( t ) + 0 t e ( t τ ) A c ( τ ) M ( τ , Δ X ( τ ) ) e ( t τ ) D c ( τ ) δ τ .
According to its definition, Φ P ( t , t 0 ) satisfies
Φ ˙ P ( t ) = Φ P ( t ) P ( t ) , Φ P ( t , t ) = Φ ( t t ) = Φ ( 0 ) = I , f o r t T .
Equation (14) can be stated as
Δ X ( t ) = Π ( Δ X ) ( t ) ,
where the operator Π is defined as
Π ( Δ X ) ( t ) : = Φ A c ( 0 , t ) Δ X 0 Φ D c ( 0 , t ) + 0 t Φ A c ( τ , t ) M ( τ , Δ X ( τ ) ) Φ D c ( τ , t ) d τ .
The spectral norm of the operator Π ( P ) ( t ) in terms of (7), (9)–(11) is
Π ( P ) ( t ) β δ X 0 + ν M ( t , P ) ,
and the second order polynomial
h ( Δ X ( t ) , δ ) : = a 0 ( δ ) Δ X ( t ) 2 + a 1 ( δ ) Δ X ( t ) + a 2 ( δ ) ,
with a i ( δ ) , i = 0 , 1 , 2 , defined in (9) via (10), (11) is a Lyapunov majorant for the operator Π ( . ) such that
Π ( Δ X ) ( t ) h ( Δ X ( t ) , δ ) .
In a similar way, for two arbitrary matrices V ( t ) , W ( t ) R n × p with V ( t ) , W ( t ) Δ X ( t ) , we get
Π ( V ) ( t ) Π ( W ) ( t ) h ( θ , δ ) θ V ( t ) W ( t ) = ( a 1 ( δ ) + 2 a 0 ( δ ) θ ) V ( t ) W ( t ) ,
where θ : = max { V ( t ) , W ( t ) } . If inequalities (17) and (20) hold and for any positive number ρ such as
h ( ρ , δ ) ρ , h ( ρ , δ ) = h ( ρ , δ ) ρ < 1 ,
then the operator Π ( . ) is a contraction on the ball M ρ : = { V ( t ) R n × p : V ( t ) ρ } . According to the fixed-point principle [14], the operator Equation (16) admits a solution Δ X ( t ) M ρ such that for
δ Ω t : = { δ R + 5 , a 1 ( δ ) + 2 a 0 ( δ ) a 2 ( δ ) 1 } R + 5 ,
we have
Δ X ( t ) 2 a 2 ( δ ) 1 a 1 ( δ ) + ( 1 a 1 ( δ ) ) 2 4 a 0 ( δ ) a 2 ( δ ) ,
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 X ( t ) + Δ X ( t ) of the perturbed Equation (3) for which the bound (13) holds.
Let α = max { δ A , δ D , δ Q , δ S , δ X 0 } . Then (9) and (8) yield
a 0 ( α ) = ν ( S + α ) , a 1 ( α ) = 2 α ν σ , a 2 ( α ) = α ( ν σ 2 + β ) ,
and
Ω t = { α < ( κ + κ 2 + β / ν ) / 2 β } ,
with σ : = 1 + X ( t ) and κ : = σ + S ( β + ν σ 2 ) . The estimate (13) becomes
Δ X ( t ) 1 2 α ν σ 1 4 α ν ( κ + α β ) 2 ν ( S + α ) .
The assumption for H to be a nonsingular M-matrix implies that the closed loop-matrices A c ( t ) = A X ( t ) S and D c ( t ) = D S X ( t ) 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 Φ A c ( 0 , t ) and Φ D c ( 0 , t )
Φ A c ( 0 , t ) e 0 t λ ( τ ) d τ ; Φ D c ( 0 , t ) e 0 t ξ ( τ ) d τ ,
based on the logarithmic norms
λ ( t ) = 0 , 5 λ max A c ( t ) + A c ( t ) ; ξ ( t ) = 0 , 5 ξ max D c ( t ) + D c ( t )
of the closed-loop matrices A c ( t ) = A X ( t ) S and D c ( t ) = D S X ( t ) , respectively.

3. Sensitivity of Low-Dimensional Approximate Solutions to Large-Scale NDRE

For large NDRE with low-rank matrix Q, decomposed as Q = F G with F R n × s , G R p × s and s < < n , we proposed in [7] to project the problem (1) onto extended Krylov subspace K m ( A , F ) and K m ( D , G ) applying the Extended block Arnoldi algorithm and to obtain the approximate solution
X m ( t ) = V m Y m ( t ) W m R n × p ,
where Y m solves the projected low-dimensional NDRE
Y ˙ m ( t ) = T m A Y m ( t ) Y m ( t ) T m D + Y m ( t ) S m Y m ( t ) + F m G m , Y m ( 0 ) = Y 0 = V m X 0 W m R 2 m s × 2 m s ,
instead of the exact solution to (1). Here S m = W m S V m R 2 m s × 2 m s , F m = V m F R 2 m s × s , G m = W m G R 2 m s × s and the block Hessenberg matrices T m A = V m A V m R 2 m s × 2 m s and T m D = W m D W m R 2 m s × 2 m s are obtained after transformation by the orthonormal matrices V m = V 1 , , V m R n × 2 m s and W m = W 1 , , W m R p × 2 m s composed of the orthonormal bases { V 1 , , V m } , ( V i R n × 2 s , i = 1 , . m ) and { W 1 , , W m } , ( W i R p × 2 s , i = 1 , . m ) . The orthonormal bases are generated after applying the Extended block Arnoldi algorithm to the pairs ( A , F ) and ( D , G ) ; see [7] for more details.
The classical theory of Radon (see, e.g., [5]) states that any solution Y m ( t ) of the low-dimensional NDRE (24) is locally equivalent to a solution of the initial value problem
Ψ ˙ ( t ) = H m ( t ) Ψ ( t ) , Ψ ( 0 ) : = I Y 0 R 4 m s × 2 m s ,
where H m = U m H U m : = T m D S m F m G m T m A R 4 m s × 4 m s , with H : = D S F G A and U m : = W m 0 0 V m , U m U m = I .
The solution of (25) is
Ψ ( t ) : = Y 1 , m ( t ) Y 2 , m ( t ) = e t H m Ψ ( 0 ) : = Ψ 11 ( t ) Ψ 12 ( t ) , Ψ 21 ( t ) Ψ 22 ( t ) Ψ ( 0 ) , = Ψ 11 ( t ) + Ψ 12 ( t ) Y 0 Ψ 21 ( t ) + Ψ 22 ( t ) Y 0 .
If the matrix Y 1 , m ( t ) is nonsingular, the solution Y m ( t ) of the projected low-order nonsymmetric differential Riccati Equation (24) is represented as [16]
Y m ( t ) = Y 2 , m ( t ) Y 1 , m 1 ( t ) = Ψ 21 ( t ) + Ψ 22 ( t ) Y 0 Ψ 11 ( t ) + Ψ 12 ( t ) Y 0 1 .
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 Z m = T m A , T m D , S m , F m , G m , Y 0 as the exact solution to a slightly perturbed problem with collection of data coefficients Z m + Δ Z m . The data perturbation Δ Z m Δ Z m : = Δ T m A , Δ T m D , Δ S m , Δ F m , Δ G m , Δ Y 0 with Δ Z δ Z , δ Z macheps ϕ ( n ) Z , reflects the effect of round-off errors and approximation errors in the computed solution to (24).
The perturbed projected low-dimensional NDRE is
( Y m ( t ) + Δ Y m ( t ) ) = ( T m A + Δ T m A ) ( Y m ( t ) + Δ Y m ( t ) ) ( Y m ( t ) + Δ Y m ( t ) ) ( T m D + Δ T m D ) + ( Y m ( t ) + Δ Y m ( t ) ) ( S m + Δ S m ) ( Y m ( t ) + Δ Y m ( t ) ) + ( F m + Δ F m ) ( G m + Δ G m ) , Y m ( 0 ) + Δ Y m ( 0 ) = Y 0 + Δ Y 0 .
The equivalent to (28) initial value problem is
( Ψ ( t ) + Δ Ψ ( t ) ) : = ( H m ( t ) + Δ H m ( t ) ) ( Ψ ( t ) + Δ Ψ ( t ) ) , Ψ ( 0 ) + Δ Ψ ( 0 ) : = Y 1 , m ( 0 ) Y 2 , m ( 0 ) + Δ Y 1 , m ( 0 ) Δ Y 2 , m ( 0 ) ,
where
Δ H m : = Δ T m D Δ S m Δ F m G m + F m Δ G m + Δ F m Δ G m Δ T m A a n d Δ Ψ ( t ) = Δ Y 1 , m ( t ) Δ Y 2 , m ( t ) : = Δ Ψ 11 ( t ) Δ Ψ 12 ( t ) Δ Ψ 21 ( t ) Δ Ψ 22 ( t ) .
The perturbations Δ Ψ 11 ( t ) , Δ Ψ 12 ( t ) , Δ Ψ 21 ( t ) , Δ Ψ 22 ( t ) are analytical functions of the data perturbations Δ Z m Δ Z m and reflect the errors in the solution Ψ ( t ) + Δ Ψ ( t ) to the perturbed linear differential system
Ψ ( t ) + Δ Ψ ( t ) = e t ( H m + Δ H m ) ( Ψ ( 0 ) + Δ Ψ ( 0 ) ) , = Y 1 , m ( t ) Y 2 , m ( t ) + Δ Y 1 , m ( t ) Δ Y 2 , m ( t ) , : = Ψ 11 ( t ) + Δ Ψ 11 ( t ) Ψ 12 ( t ) + Δ Ψ 12 ( t ) , Ψ 21 ( t ) + Δ Ψ 21 ( t ) Ψ 22 ( t ) + Δ Ψ 22 ( t ) ( Ψ ( 0 ) + Δ Ψ ( 0 ) ) .
According to (26) and (30), the perturbation Δ Ψ ( t ) is
Δ Ψ ( t ) = e t H m + Δ H m ( Ψ ( 0 ) + Δ Ψ ( 0 ) ) e t H m Ψ ( 0 ) = Δ Y 1 , m ( t ) Δ Y 2 , m ( t ) = Δ Ψ 11 ( t ) + Δ Ψ 12 ( t ) Y 0 + ( Ψ 12 ( t ) + Δ Ψ 12 ( t ) ) Δ Y 0 , Δ Ψ 21 ( t ) + Δ Ψ 21 ( t ) Y 0 + ( Ψ 22 ( t ) + Δ Ψ 22 ( t ) ) Δ Y 0 .
If the matrix
Y 1 , m ( t ) + Δ Y 1 , m ( t ) : = Ψ 11 ( t ) + Δ Ψ 11 ( t ) + ( Ψ 12 ( t ) + Δ Ψ 12 ( t ) ) ( Y 0 + Δ Y 0 )
is invertible, then the solution
Y m ( t ) + Δ Y m ( t ) = Y 2 , m ( t ) + Δ Y 2 , m ( t ) Y 1 , m ( t ) + Δ Y 1 , m ( t ) 1 ,
with Δ Y 1 , m ( t ) and Δ Y 2 , m ( t ) given in (31) to the perturbed projected low-dimensional Equation (28) exists.
The perturbation bound of the solution Y m ( t ) to the NDRE (24) consists of finding an interval T : [ 0 , t * ) such that for each t T , the matrix Y 1 , m ( t ) + Δ Y 1 , m ( t ) is invertible and then the perturbed solution Y m ( t ) + Δ Y m ( t ) given by (32) exists, as well as to derive a normwise bound in terms of spectral norm for the error Δ Y m ( t ) in the solution Y m ( t ) + Δ Y m ( t ) (32) as a function of the equivalent perturbations Δ Z m in the data coefficients Z m .
We formulate the following perturbation bound of the solution to the projected low-dimensional NDRE (24).
Theorem 2.
Let us denote
ω 1 ( t , δ m ) : = Ψ 12 ( t ) δ Y 0 + rank ( Δ Ψ ( t ) ) ( 1 + Y 0 + δ Y 0 ) Δ Ψ ( t ) , ω 2 ( t , δ m ) : = rank ( Δ Ψ ( t ) ) ( 1 + Y 0 + δ Y 0 ) Δ Ψ ( t ) + Ψ 22 ( t ) δ Y 0 ,
for Y 0 , Ψ 1 , i ( t ) , i = 1 , 2 , Ψ 22 ( t ) and Δ Ψ ( t ) as defined in (25), (26) and (29) respectively.
For t [ 0 , t * ) , where
t * = sup t T : ω 1 ( t , δ m ) Y 1 , m ( t ) 1 < 1 ,
Y 1 , m ( t ) as stated in (26) and δ m : = δ T m A δ T m D δ F m δ G m δ S m δ Y 0 , the spectral norm of the perturbation Δ Y m ( t ) in the calculated solution Y m ( t ) to (24) satisfies the inequality
Δ Y m ( t ) f m ( t , δ m ) : = ( ω 2 ( t , δ m ) + ω 1 ( t , δ m ) Y m ( t ) ) Y 1 , m 1 ( t ) 1 ω 1 ( t , δ m ) Y 1 , m 1 ( t ) .
Proof. 
The initial value of problem (25) is Ψ ( 0 ) = I Y 0 . Then, according to (26) Ψ 11 ( 0 ) = I n , Ψ 12 ( 0 ) = 0 . The matrix Y 1 , m ( 0 ) = Ψ 11 ( 0 ) + Ψ 12 ( 0 ) Y 0 = I n is invertible and its inverse is Y 1 , m ( 0 ) 1 = Ψ 11 ( 0 ) + Ψ 12 ( 0 ) Y 0 1 = I n . Denote by σ 1 ( t ) σ 2 ( t ) σ n ( t ) 0 the singular values of the matrix Ψ 11 ( t ) . Then the interval T = 0 , t * can be chosen from
t * : = sup t : Δ Y 1 , m ( t ) + Ψ 12 ( t ) Y 0 < σ n ( t ) .
From (32) and taking into account (27), the perturbation Δ Y m ( t ) in the solution to the projected low-dimensional NDRE satisfies
Δ Y m ( t ) = Y 2 , m + Δ Y 2 , m ( t ) Y 1 , m ( t ) + Δ Y 1 , m ( t ) 1 Y 2 , m ( t ) Y 1 , m 1 ( t ) = Δ Y 2 , m ( t ) Y m ( t ) Δ Y 1 , m ( t ) Y 1 , m ( t ) + Δ Y 1 , m ( t ) 1 .
Applying the property I n + X 1 Y 1 1 1 X 1 Y , which is valid for any matrices X , Y R n × n , with existing inverse X 1 and X 1 Y 1 [17], from (37), we obtain
Δ Y m ( t ) Δ Y 2 , m ( t ) + Y m ( t ) Δ Y 1 , m ( t ) × × Y 1 , m 1 ( t ) 1 Y 1 , m 1 ( t ) Δ Y 1 , m ( t )
provided that
Y 1 , m 1 ( t ) Δ Y 1 , m ( t ) < 1 .
Using the fact that for any matrix M = [ M i j ] R 2 m s × 2 m s , we have
M i j F < M F < rank ( M ) M 2 ,
the norms of the perturbations Δ Y 1 , m ( t ) and Δ Y 2 , m ( t ) can be estimated by
Δ Y 1 , m ( t ) Δ Ψ 11 ( t ) F + Ψ 12 ( t ) δ Y 0 + Δ Ψ 12 ( t ) F ( Y 0 + δ Y 0 Ψ 12 ( t ) δ Y 0 + ( 1 + Y 0 + δ Y 0 ) Δ Ψ ( t ) F Ψ 12 ( t ) δ Y 0 + rank ( Δ Ψ ( t ) ) ( 1 + Y 0 + δ Y 0 ) Δ Ψ ( t ) ω 1 ( t , δ m ) ,
and
Δ Y 2 , m ( t ) rank ( Δ Ψ ( t ) ) ( 1 + Y 0 + δ Y 0 ) Δ Ψ ( t ) + Ψ 22 ( t ) δ Y 0 ω 2 ( t , δ m ) .
Replacing Δ Y 1 , m ( t ) and Δ Y 2 , m ( t ) in (38) by ω 1 ( t , δ m ) and ω 2 ( t , δ m ) from (39), (40), we prove the non-local bound Δ Y m ( t ) f m ( t , δ m ) as stated in (35).
Finally, the expression Δ Y 1 , m ( t ) + Ψ 12 ( t ) Y 0 < σ n ( t ) from (36) in view of (39), becomes ω 1 ( t , δ m ) < Y 1 , m ( t ) . Then, since Y 1 , m ( 0 ) = I n and ω 1 ( t , 0 ) = 0 , the interval
t * = sup t T : ω 1 ( t , δ m ) Y 1 , m ( t ) 1 < 1
from (34) is correctly defined, which achieves the proof.  □
In order to represent the norm Δ Ψ ( t ) of the perturbation Δ Ψ ( t ) in terms of ω 1 and ω 2 by the norms of the perturbations in the data matrices T m A , T m D , F m , G m , S m and Y 0 , we consider the perturbed differential Equation (29). We have
Δ Ψ ( t ) = 0 t e H m ( t τ ) Δ H m e ( H m + Δ H m ) τ d τ .
Then, taking the spectral norm, we have
Δ Ψ ( t ) δ H m 0 t e H m ( t τ ) e ( H m + Δ H m ) τ d τ δ H m 0 t g ( t τ ) Δ Ψ ( τ ) + g ( τ ) d τ ,
where δ H m : = Δ H m < δ m and g ( t ) is an upper bound for e H m ( t ) , i.e., e H m ( t ) g ( t ) .
Some bounds for the matrix exponential e H m ( t ) based on Jordan and Schur matrix decompositions, logarithmic norm and power series are summarized in [18]:
g ( t ) = c 0 e ϱ t k = 0 p 1 ( ϖ t ) k / k ! ,
with constants c 0 , ϱ , ϖ and p, listed in Table 1.
Here μ ( H m ( t ) ) = λ max H m ( t ) + H m ( t ) ) / 2 ; ς 1 is the dimension of the maximum block in the Jordan canonical form J = Y 1 H m ( t ) Y of H m ( t ) , where the matrix Y is chosen so as the condition number c o n d ( Y ) = Y Y 1 to be minimized; d ς = cos π ς + 1 ; α ( H m ( t ) ) is the spectral abscissa of H m ( t ) , i.e., the maximum real part of the eigenvalues of H m ( t ) ; T = U H H m ( t ) U = Λ + N is the Schur decomposition of H m ( t ) with unitary matrix U, chosen so as ϖ = N to be minimized, diagonal matrix Λ and N - strictly upper triangular matrix with index of nilpotency l = min { s : N s = 0 } .
The results stated in Theorem 2 can be used to formulate a perturbation bound for the solution X ( t ) 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 Q = F G with F R n × s , G R p × s , ( s < < n ) be projected onto a pair of extended Krylov subspaces K m ( A , F ) and K m ( D , G ) . Let X m ( t ) = V m Y m ( t ) W m R n × p be its approximate solution as stated in (23), obtained by applying the Extended block Arnoldi algorithm to the projected low-dimensional NDRE
Y ˙ m ( t ) = T m A Y m ( t ) Y m ( t ) T m D + Y m ( t ) S m Y m ( t ) + F m G m , Y m ( 0 ) = Y 0 = V m X 0 W m R 2 m s × 2 m s .
with solution Y m ( t ) and perturbation bound Δ Y m ( t ) f m ( t , δ m ) (35) as defined in Theorem 2. A perturbation bound in terms of spectral norm for the approximate solution X ( t ) to (1) is given by
Δ X ( t ) f m ( t , δ m ) : = ( ω 2 ( t , δ m ) + ω 1 ( t , δ m ) Y m ( t ) ) Y 1 , m 1 ( t ) 1 ω 1 ( t , δ m ) Y 1 , m 1 ( t ) ,
for t [ 0 , t * ) , with t * as defined in (34) and Y 1 , m ( t ) stated in (26), ω 1 ( t , δ m ) , ω ( t , δ m ) stated in (33), δ m : = δ T m A δ T m D δ F m δ G m δ S m δ Y 0 .
Proof. 
The proof follows directly from the definition (23) of the approximate solution Y m ( t ) and the preservation of the spectral norm by unitary matrices.  □
Next, we apply the preceding results to estimate the approximation error E m = X ( t ) X m ( t ) of the approximate solution X m ( t ) 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.
[Theorem 4. form [19] Let X m be the approximate solution given by (23). Then we have
X ˙ m ( t ) = ( A Δ m A ) X m ( t ) X m ( t ) ( D Δ m D ) + X m ( t ) S X m ( t ) + F G T , R m ( t ) = Δ m A X m ( t ) + X m ( t ) Δ m D , a n d E ˙ m ( t ) = ( A X m ( t ) S ) E m ( t ) E m ( t ) ( D S X m ( t ) ) + E m ( t ) S E m ( t ) Δ m A X m ( t ) X m ( t ) Δ m D .
where Δ m A = V m + 1 T m + 1 , m A V m T , Δ m D = W m T m + 1 , m D W m T , E m ( t ) = X ( t ) X m ( t ) and X ( t ) is an exact solution X ( t ) of (1).
Let us rewrite the NDRE associated with the error E m ( t )
E ˙ m ( t ) = ( A X m ( t ) S ) E m ( t ) E m ( t ) ( D S X m ( t ) ) + E m ( t ) S E m ( t ) Δ m A X m ( t ) X m ( t ) Δ m D
in the equivalent form
E ˙ m ( t ) = A c , m ( t ) E m ( t ) E m ( t ) D c , m ( t ) + M m ( t , E m ( t ) ) ,
where A c , m ( t ) = A X m ( t ) S , D c , m ( t ) = D S X m ( t ) , M ( t , E m ) : = M 1 , m ( t , E m ) + M 2 , m ( t , E m ) with
M 1 , m ( t , E m ( t ) ) : = Δ m A E m ( t ) E m ( t ) Δ m D ; M 2 , m ( t , E m ( t ) ) : = E m ( t ) S E m ( t ) .
Here Δ m A = V m + 1 T m + 1 , n A V , , Δ m D = W m T m + 1 , n D W m + 1 . As the unitary matrices V m and W m have unit spectral norm, we have Δ m A = T m + 1 , n A and Δ m D = T m + 1 , n D . We notice that the fact that the term T m + 1 , n tends normwisely to 0 as m increases implies that the spectral norm of Δ m A , Δ m D decreases towards 0. This allows us to consider Δ m A , Δ m D 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 Δ X ( t ) 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 E m ( t ) .
Theorem 5.
For Δ m D , Δ m D , satisfying δ : = Δ m A Δ m D Ω t , m : = { a 0 ( δ ) a 2 ( δ ) 0.25 } , the spectral norm of the error E m ( t ) , solution to the NDRE (43), is bounded by
E m ( t ) f ( δ , t ) = 2 a 2 ( δ ) 1 + 1 4 a 0 ( δ ) a 2 ( δ ) ,
where
a 0 ( δ ) = ν S ; a 2 = ν X m ( t ) Δ m A + Δ m D + β E m ( 0 ) ,
for ν = max 0 t Φ A c , m ( τ , t ) Φ D c , m ( τ , t ) d τ , t T , β = max Φ A c , m ( 0 , t ) Φ D c , m ( 0 , t ) and Φ Z ( t , t 0 ) = e ( t t 0 ) Z being the fundamental matrix of equation η ˙ ( t ) = Z η ( t ) .
Proof. 
Comparing M 1 , m ( t , E m ( t ) ) , M 2 , m ( t , E m ( t ) ) (45) to M 1 ( t , P ) , M 2 ( t , P ) (6), for the coefficients a i ( δ ) (9) we obtain
a 0 ( δ ) = ν S ; a 1 ( δ ) = 0 ; a 2 ( δ ) = ν X m ( t ) ( Δ m A + Δ m D ) + β E m ( 0 ) .
Replacing the coefficients a i ( δ ) , i = 0 , 1 , 2 in the inequality of the set Ω t , m (8) and the bound f ( δ , t ) (13) we obtain
2 a 0 ( δ ) a 2 ( δ ) 1 , o r a 1 ( δ ) a 2 ( δ ) 0.25 .
Then the existence condition of the bound becomes
δ : = Δ m A Δ m D Ω t , m : = { a 0 ( δ ) a 2 ( δ ) 0.25 } ,
and we obtain the bound
f ( δ , t ) = 2 a 2 ( δ ) 1 + 1 4 a 0 ( δ ) a 2 ( δ ) .

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 T = [ 0 , 1 ] , 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 X ( t ) to the NDRE (1) and X ( t ) + Δ X ( t ) 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.
The matrix coefficients of the NDRE (1) are:
A = W ( n + 1 : 2 n , n + 1 : 2 n ) + α I ; D = W ( 1 : n , 1 : n ) + α I , S = W ( 1 : n , n + 1 : 2 n ) ; Q = W ( n + 1 : 2 n , 1 : n ) ,
where W is a singular M-matrix with nonzero elements: W = diag ( R e ) R , with R a 2 n × 2 n nonzero random matrix and e = 1 , 1 , , 1 R 2 n . The time interval T = 0 , 1 is chosen. For α 0 the existence of a positive definite solution to (1) is guaranteed.
Experiment 1.
In [10], an equation of size n = 3 is considered and the perturbations are chosen as:
Δ A = 0.3 0.2 0.1 0.1 0.2 0.3 0.1 0.1 0.3 10 j ; Δ D = 0.1 0.2 0.3 0 0.1 0.2 0.2 0.3 0.1 10 j Δ S = 0.2 0.1 0.3 0.1 0.2 0.3 0.1 0.1 0.3 10 j ; Δ Q = 0.2 0.3 0.1 0.1 0.1 0.1 0.1 0.1 0.2 10 j , f o r j = 12 , 11 , 10 , 9 , 8 , 7 , , 2 .
The results, obtained for the estimated value - the relative perturbation ρ 1 ( t ) = Δ X ( t ) X ( t ) and the estimate—the relative bound ρ 2 ( t ) = f ( t ) X ( t ) , with f ( t ) = f ( δ , t ) given by (8)–(13) for j = 12 , 10 , 8 , 6 , 4 , 2 and α = 0 are listed in Table 2.
Table 3 reports on the obtained results for the bound (8)–(13) from Theorem (1) for the case α = 5 .
As it is seen, the estimate based on the perturbation bound f ( δ , t ) from (8)–(13) is quite sharp.
The same experimental statement is used to test the accuracy of the estimate (34) and (35) from Theorem 2. The results obtained for j = 12 , 10 , 8 , 6 , 4 , 2 are listed in Table 4 for α = 0 and in Table 5 for α = 5 . 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 matrices A , D , S , Q R n × n varies from 5 to 50. The perturbations are randomly generated following the scheme Δ Z = ( r a n d ( s i z e ( Z ) ) / Z ) 10 j for Z = A , D , S , Q and j = 12 . The average values over 30 trials for the relative perturbation ρ 1 ( t ) = Δ X ( t ) X ( t ) and the bound ρ 2 ( t ) = f ( t ) X ( t ) , f ( t ) = f ( δ , t ) from (8)–(13), for t = 0.2 , 0.4 , 0.6 and 0.8 are displayed in Figure 1 for α = 0 .
It appears in Figure 1 that for α = 0 and j from 10 to 4, the bound ρ 2 ( t ) remains of the order of the estimated value ρ 1 ( t ) .
The average values over 30 trials for the relative perturbation ρ 1 ( t ) = Δ X ( t ) X ( t and the bound ρ 2 ( t ) = f ( t ) X ( t ) , f ( t ) = f ( δ , t ) from (8)–(13) for t = 0.2 , 0.4 , 0.6 and 0.8 are displayed in Figure 2 for α = 5 .
The results for the perturbation bound f ( δ , t ) , (8)–(13) from Theorem 1, visualized on Figure 1 and Figure 2 demonstrate that the perturbation bound f ( δ , t ) , (8)–(13) is an effective upper perturbation bound of X ( t ) in 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 n = 4000 , arising in neutron transport theory
X ˙ ( t ) = ( Δ e q ) X ( t ) X ( t ) ( Γ q e ) + X ( t ) q q X ( t ) + e e ,
on time interval T = 0 , 2 , with matrices
Δ = diag ( δ 1 , , δ n ) , δ i = 1 c ω i ( 1 + α ) , i = 1 , , n Γ = diag ( γ 1 , , γ n ) , γ i = 1 c ω i ( 1 α ) , i = 1 , , n , c = 0.5 , α = 0.5 e = ( 1 , , 1 ) , q = ( q 1 , , q n ) , w i t h   q i = c i 2 ω i , i = 1 , , n ,
where the sequences ( c i ) and ( ω i ) , i = 1 , , n are the nodes and weights of the Gaussian-Legendre quadrature on 0 , 1 , respectively:
c i > 0 , i n c i = 1 ,   a n d 0 < ω 1 < < ω n , i = 1 , , n .
The perturbation is chosen as:
δ q = ( r a n d ( s i z e ( q ) ) / q ) 10 j   f o r   j = 12 .
The results, obtained for the relative perturbation ρ 1 ( t ) = Δ X ( t ) X ( t ) and the nonlocal bound ρ 2 ( t ) = f ( t ) X ( t ) , f ( t ) = f ( δ , t ) , (8)–(13) for t = 0.4 , 0.8 , 1.2 , 1.6 and 2 are shown in Table 6.
As is seen, over all the interval of integration T 0 , 2 , the perturbation bound f ( δ , t ) from (8)–(13) is valid, i.e., the condition (8) for existence of the bound f ( δ , t ) is not deteriorated. The bound f ( δ , t ) is a quite sharp upper bound—remains in the order of the estimated value. The perturbation bound f ( δ , t ) 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

  1. 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] [Green Version]
  2. Juang, J. Global existence and stability of solutions of matrix Riccati equations. J. Math. Analy. Appl. 2001, 258, 1–12. [Google Scholar] [CrossRef] [Green Version]
  3. 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]
  4. 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]
  5. Freiling, G. A survey of nonsymmetric Riccati equations. Lin. Alg. Appl. 2002, 351, 243–270. [Google Scholar] [CrossRef] [Green Version]
  6. 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]
  7. 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]
  8. 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] [Green Version]
  9. 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]
  10. Liu, L. Mixed and componentwise condition numbers of nonsymmetric algebraic Riccati equation. Appl. Math. Comput. 2012, 218, 7595–7601. [Google Scholar] [CrossRef]
  11. 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]
  12. Konstantinov, M.; Pelova, G. Sensitivity of the solutions to differential matrix Riccati equations. IEEE Trans. Automat. Control 1991, 36, 213–215. [Google Scholar] [CrossRef]
  13. 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]
  14. Konstantinov, M.; Gu, D.; Mehrmann, V.; Petkov, P. Perturbation Theory for Matrix Equations; Elsevier: Amsterdam, The Netherlands, 2003. [Google Scholar]
  15. 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]
  16. 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]
  17. Lancaster, P. The Theory of Matrices; Academic Press: New York, NY, USA, 1969. [Google Scholar]
  18. Petkov, P.; Christov, N.; Konstantinov, M. Computational Methods for Linear Control Systems; Prentice-Hall: Hemel Hempstead, UK, 1991. [Google Scholar]
  19. 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]
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.
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.
Mathematics 09 00855 g001
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.
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.
Mathematics 09 00855 g002
Table 1. Values of the constants in the matrix exponential bounds.
Table 1. Values of the constants in the matrix exponential bounds.
Jordan ( 1 ) Jordan ( 2 ) Schur Log Norm Power Series
c 0 c o n d ( Y ) c o n d ( Y ) 111
ϱ α ( H m ( t ) ) α ( H m ( t ) ) + d ς α ( H m ( t ) ) μ ( H m ( t ) ) H m ( t )
ϖ 10 ϖ 00
pm-l--
Table 2. Relative perturbation ρ 1 ( t ) = Δ X ( t ) X ( t ) and bound ρ 2 ( t ) = f ( t ) X ( t ) .
Table 2. Relative perturbation ρ 1 ( t ) = Δ X ( t ) X ( t ) and bound ρ 2 ( t ) = f ( t ) X ( t ) .
α = 0
t = 0.2 t = 0.4 t = 0.6 t = 0.8 t = 1
ρ 1 ( t ) 2.57 × 10 13 2.46 × 10 13 2.40 × 10 13 2.37 × 10 13 2.36 × 10 13
ρ 2 ( t ) 2.97 × 10 12 1.75 × 10 12 1.36 × 10 12 1.16 × 10 12 1.05 × 10 12
j = 10
ρ 1 ( t ) 2.58 × 10 11 2.46 × 10 11 2.40 × 10 11 2.37 × 10 11 2.36 × 10 11
ρ 2 ( t ) 2.97 × 10 10 1.75 × 10 10 1.36 × 10 10 1.16 × 10 10 1.05 × 10 10
j = 8
ρ 1 ( t ) 2.58 × 10 09 2.46 × 10 09 2.40 × 10 09 2.37 × 10 09 2.36 × 10 09
ρ 2 ( t ) 2.97 × 10 08 1.75 × 10 08 1.36 × 10 08 1.16 × 10 08 1.05 × 10 08
j = 6
ρ 1 ( t ) 2.58 × 10 07 2.46 × 10 07 2.40 × 10 07 2.37 × 10 07 2.36 × 10 07
ρ 2 ( t ) 2.97 × 10 06 1.75 × 10 06 1.36 × 10 06 1.16 × 10 06 1.05 × 10 06
j = 4
ρ 1 ( t ) 2.58 × 10 05 2.46 × 10 05 2.40 × 10 05 2.37 × 10 05 2.36 × 10 05
ρ 2 ( t ) 2.97 × 10 04 1.75 × 10 04 1.36 × 10 04 1.16 × 10 04 1.05 × 10 04
j = 2
ρ 1 ( t ) 2.58 × 10 03 2.46 × 10 03 2.40 × 10 03 2.37 × 10 03 2.36 × 10 03
ρ 2 ( t ) 3.01 × 10 02 1.77 × 10 02 1.38 × 10 02 1.18 × 10 02 1.06 × 10 02
Example 1: Experiment 1, bound f(t)= f(δ, t), (8)–(13), Theorem 1, α = 0, j = 12, 10, 8, 6, 4, 2, t = 0.2 to 1.
Table 3. Relative perturbation ρ 1 ( t ) = Δ X ( t ) X ( t ) and bound ρ 2 ( t ) = f ( t ) X ( t ) .
Table 3. Relative perturbation ρ 1 ( t ) = Δ X ( t ) X ( t ) and bound ρ 2 ( t ) = f ( t ) X ( t ) .
α = 5
t = 0.2 t = 0.4 t = 0.6 t = 0.8 t = 1
j = 12
ρ 1 ( t ) 1.74 × 10 13 1.60 × 10 13 1.56 × 10 13 1.58 × 10 13 1.64 × 10 13
ρ 2 ( t ) 2.37 × 10 12 1.48 × 10 12 1.19 × 10 12 1.05 × 10 12 9.63 × 10 13
j = 10
ρ 1 ( t ) 1.72 × 10 11 1.60 × 10 11 1.56 × 10 11 1.58 × 10 11 1.63 × 10 11
ρ 2 ( t ) 2.37 × 10 10 1.48 × 10 10 1.19 × 10 10 1.05 × 10 10 9.63 × 10 11
j = 8
ρ 1 ( t ) 1.73 × 10 09 1.60 × 10 09 1.56 × 10 09 1.58 × 10 09 1.64 × 10 09
ρ 2 ( t ) 2.37 × 10 08 1.48 × 10 08 1.19 × 10 08 1.05 × 10 08 9.65 × 10 09
j = 6
ρ 1 ( t ) 1.73 × 10 07 1.59 × 10 07 1.56 × 10 07 1.58 × 10 07 1.64 × 10 07
ρ 2 ( t ) 2.37 × 10 06 1.48 × 10 06 1.19 × 10 06 1.05 × 10 06 9.63 × 10 07
j = 4
ρ 1 ( t ) 1.73 × 10 05 1.59 × 10 05 1.56 × 10 05 2 . 1.58 × 10 05 1.63 × 10 05
ρ 2 ( t ) 2.37 × 10 04 1.48 × 10 04 1.19 × 10 04 1.05 × 10 04 9.63 × 10 05
j = 2
ρ 1 ( t ) 1.74 × 10 03 1.59 × 10 03 1.56 × 10 03 1.58 × 10 03 1.64 × 10 03
ρ 2 ( t ) 2.40 × 10 02 1.50 × 10 02 1.21 × 10 02 1.06 × 10 02 9.77 × 10 03
Example 1: Experiment 1, bound f(t)= f(δ, t), (8)–(13), Theorem 1, α = 5, j = 12, 10, 8, 6, 4, 2, t = 0.2 to 1.
Table 4. Relative perturbation ρ 1 ( t ) = Δ X ( t ) X ( t ) and bound ρ 2 ( t ) = f ( t ) X ( t ) .
Table 4. Relative perturbation ρ 1 ( t ) = Δ X ( t ) X ( t ) and bound ρ 2 ( t ) = f ( t ) X ( t ) .
α = 0
t = 0.2 t = 0.4 t = 0.6 t = 0.8 t = 1
j = 12
ρ 1 ( t ) 2.17 × 10 13 2.11 × 10 13 2.09 × 10 13 2.11 × 10 13 2.16 × 10 13
ρ 2 ( t ) 1.01 × 10 12 1.82 × 10 12 3.23 × 10 12 5.63 × 10 12 9.80 × 10 12
j = 10
ρ 1 ( t ) 2.17 × 10 11 2.11 × 10 11 2.10 × 10 11 2.12 × 10 11 2.17 × 10 11
ρ 2 ( t ) 1.01 × 10 10 1.82 × 10 10 3.22 × 10 10 5.63 × 10 10 9.80 × 10 10
j = 8
ρ 1 ( t ) 2.17 × 10 09 2.11 × 10 09 2.11 × 10 09 2.12 × 10 09 2.16 × 10 09
ρ 2 ( t ) 1.01 × 10 08 1.82 × 10 08 3.22 × 10 08 5.63 × 10 08 9.80 × 10 08
j = 6
ρ 1 ( t ) 2.17 × 10 07 2.11 × 10 07 2.11 × 10 07 2.12 × 10 07 2.16 × 10 07
ρ 2 ( t ) 1.01 × 10 06 1.82 × 10 06 3.22 × 10 06 5.63 × 10 06 9.80 × 10 06
j = 4
ρ 1 ( t ) 2.17 05 2.52 × 10 05 2.42 × 10 05 2.36 × 10 05 2.31 × 10 05
ρ 2 ( t ) 1.01 × 10 04 1.82 × 10 04 3.22 × 10 04 5.64 × 10 04 9.80 × 10 04
j = 2
ρ 1 ( t ) 2.68 × 10 03 2.52 × 10 03 2.43 × 10 03 2.36 × 10 03 2.32 × 10 03
ρ 2 ( t ) 1.01 × 10 02 1.83 × 10 02 3.26 × 10 02 5.75 × 10 02 1.02 × 10 01
Example 1: Experiment 1, bound f(t)= fm(t, δm) from (34) and (35), Theorem 2, α = 0, j = 12, 10, 8, 6, 4, 2, t = 0.2 to 1.
Table 5. Relative perturbation ρ 1 ( t ) = Δ X ( t ) X ( t ) and bound ρ 2 ( t ) = f ( t ) X ( t ) .
Table 5. Relative perturbation ρ 1 ( t ) = Δ X ( t ) X ( t ) and bound ρ 2 ( t ) = f ( t ) X ( t ) .
α = 5
t = 0.2 t = 0.4 t = 0.6 t = 0.8 t = 1
j = 12
ρ 1 ( t ) 2.68 × 10 13 2.53 × 10 13 2.43 × 10 13 2.36 × 10 13 2.31 × 10 13
ρ 2 ( t ) 1.21 × 10 12 2.07 × 10 12 3.49 × 10 12 5.84 × 10 12 9.76 × 10 12
j = 10
ρ 1 ( t ) 2.68 × 10 11 2.52 × 10 11 2.42 × 10 11 2.36 × 10 11 2.31 × 10 11
ρ 2 ( t ) 1.21 × 10 10 2.07 × 10 10 3.49 × 10 10 5.85 × 10 10 9.74 × 10 10
j = 8
ρ 1 ( t ) 2.68 × 10 09 2.52 × 10 09 2.42 × 10 09 2.36 × 10 09 2.31 × 10 09
ρ 2 ( t ) 1.21 × 10 08 2.07 × 10 08 3.49 × 10 08 5.85 × 10 08 9.74 × 10 08
j = 6
ρ 1 ( t ) 2.68 × 10 07 2.52 × 10 07 2.43 × 10 07 2.36 × 10 07 2.31 × 10 07
ρ 2 ( t ) 1.21 × 10 06 2.07 × 10 06 3.49 × 10 06 5.85 × 10 06 9.74 × 10 06
j = 4
ρ 1 ( t ) 2.68 05 2.52 × 10 05 2.42 × 10 05 2.36 × 10 05 2.31 × 10 05
ρ 2 ( t ) 1.21 × 10 04 2.07 × 10 04 3.49 × 10 04 5.85 × 10 04 9.75 × 10 04
j = 2
ρ 1 ( t ) 2.68 × 10 03 2.52 × 10 03 2.43 × 10 03 2.36 × 10 03 2.32 × 10 03
ρ 2 ( t ) 1.21 × 10 02 2.08 × 10 02 3.53 × 10 02 5.96 × 10 02 1.01 × 10 01
Example 1: Experiment 1, bound f(t)= fm(t, δm), (34) and (35), Theorem 2, α = 5, j = 12, 10, 8, 6, 4, 2, t = 0.2 to 1.
Table 6. Relative perturbations ρ 1 = Δ X ( t ) X ( t ) and ρ 2 = f ( t ) X ( t ) .
Table 6. Relative perturbations ρ 1 = Δ X ( t ) X ( t ) and ρ 2 = f ( t ) X ( t ) .
t = 0.4 t = 0.8 t = 1.2 t = 1.6 t = 2
j = 10
ρ 1 ( t ) 3.25 × 10 10 4.09 × 10 10 4.26 × 10 10 4.29 × 10 10 4.29 × 10 10
ρ 2 ( t ) 3.80 × 10 09 4.09 × 10 09 4.12 × 10 09 4.13 × 10 09 4.13 × 10 09
Example 3. Results for size n = 4000, j = 12.
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Angelova, V.; Hached, M.; Jbilou, K. Sensitivity of the Solution to Nonsymmetric Differential Matrix Riccati Equation. Mathematics 2021, 9, 855. https://doi.org/10.3390/math9080855

AMA Style

Angelova V, Hached M, Jbilou K. Sensitivity of the Solution to Nonsymmetric Differential Matrix Riccati Equation. Mathematics. 2021; 9(8):855. https://doi.org/10.3390/math9080855

Chicago/Turabian Style

Angelova, Vera, Mustapha Hached, and Khalide Jbilou. 2021. "Sensitivity of the Solution to Nonsymmetric Differential Matrix Riccati Equation" Mathematics 9, no. 8: 855. https://doi.org/10.3390/math9080855

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop