Sensitivity analysis of the differential matrix Riccati equation based on the associated linear differential system

Similar documents
COMPARISON OF PERTURBATION BOUNDS FOR THE MATRIX. Abstract. The paper deals with the perturbation estimates proposed by Xu[4],Sun,

Two Results About The Matrix Exponential

Matrix Mathematics. Theory, Facts, and Formulas with Application to Linear Systems Theory. Dennis S. Bernstein

Numerical Methods in Matrix Computations

PROOF OF TWO MATRIX THEOREMS VIA TRIANGULAR FACTORIZATIONS ROY MATHIAS

Automatica, 33(9): , September 1997.

Exponentials of Symmetric Matrices through Tridiagonal Reductions

MATH 425-Spring 2010 HOMEWORK ASSIGNMENTS

c 2005 Society for Industrial and Applied Mathematics

Quadratic Matrix Polynomials

Here is an example of a block diagonal matrix with Jordan Blocks on the diagonal: J

Computation of a canonical form for linear differential-algebraic equations

Contents. Preface for the Instructor. Preface for the Student. xvii. Acknowledgments. 1 Vector Spaces 1 1.A R n and C n 2

On rank one perturbations of Hamiltonian system with periodic coefficients

AN ELEMENTARY PROOF OF THE SPECTRAL RADIUS FORMULA FOR MATRICES

STRUCTURE PRESERVING DEFLATION OF INFINITE EIGENVALUES IN STRUCTURED PENCILS

Ir O D = D = ( ) Section 2.6 Example 1. (Bottom of page 119) dim(v ) = dim(l(v, W )) = dim(v ) dim(f ) = dim(v )

Definite versus Indefinite Linear Algebra. Christian Mehl Institut für Mathematik TU Berlin Germany. 10th SIAM Conference on Applied Linear Algebra

Research CharlieMatters

A Note on Simple Nonzero Finite Generalized Singular Values

A Backward Stable Hyperbolic QR Factorization Method for Solving Indefinite Least Squares Problem

N. J. Higham. Numerical Analysis Report No January Manchester Centre for Computational Mathematics Numerical Analysis Reports

Large-scale eigenvalue problems

A Note on Eigenvalues of Perturbed Hermitian Matrices

arxiv: v1 [math.na] 1 Sep 2018

AN ESTIMATE OF GREEN S FUNCTION OF THE PROBLEM OF BOUNDED SOLUTIONS IN THE CASE OF A TRIANGULAR COEFFICIENT

The Eigenvalue Shift Technique and Its Eigenstructure Analysis of a Matrix

2 Computing complex square roots of a real matrix

Structured Condition Numbers of Symmetric Algebraic Riccati Equations

UMIACS-TR July CS-TR 2721 Revised March Perturbation Theory for. Rectangular Matrix Pencils. G. W. Stewart.

arxiv: v3 [math.ra] 10 Jun 2016

Index. for generalized eigenvalue problem, butterfly form, 211

Math Introduction to Numerical Analysis - Class Notes. Fernando Guevara Vasquez. Version Date: January 17, 2012.

Error estimates for the ESPRIT algorithm

A Simple Derivation of Right Interactor for Tall Transfer Function Matrices and its Application to Inner-Outer Factorization Continuous-Time Case

On the closures of orbits of fourth order matrix pencils

THE nth POWER OF A MATRIX AND APPROXIMATIONS FOR LARGE n. Christopher S. Withers and Saralees Nadarajah (Received July 2008)

Lecture 2: Computing functions of dense matrices

Diagonalizing Matrices

Background Mathematics (2/2) 1. David Barber

Notes on matrix arithmetic geometric mean inequalities

Multiplicative Perturbation Analysis for QR Factorizations

A Divide-and-Conquer Algorithm for Functions of Triangular Matrices

Scientific Computing

GENERAL ARTICLE Realm of Matrices

We first repeat some well known facts about condition numbers for normwise and componentwise perturbations. Consider the matrix

Index. book 2009/5/27 page 121. (Page numbers set in bold type indicate the definition of an entry.)

Stable iterations for the matrix square root

ELA THE OPTIMAL PERTURBATION BOUNDS FOR THE WEIGHTED MOORE-PENROSE INVERSE. 1. Introduction. Let C m n be the set of complex m n matrices and C m n

BOUNDS OF MODULUS OF EIGENVALUES BASED ON STEIN EQUATION

EE/ACM Applications of Convex Optimization in Signal Processing and Communications Lecture 2

ETNA Kent State University

Linear Algebra Massoud Malek

Some Notes on Least Squares, QR-factorization, SVD and Fitting

Numerical methods for matrix functions

An error estimate for matrix equations

Elementary linear algebra

Preliminary/Qualifying Exam in Numerical Analysis (Math 502a) Spring 2012

MATH 511 ADVANCED LINEAR ALGEBRA SPRING 2006

ELA MATRIX FUNCTIONS PRESERVING SETS OF GENERALIZED NONNEGATIVE MATRICES

Basic Calculus Review

Notes on Eigenvalues, Singular Values and QR

Lecture 4: Analysis of MIMO Systems

MS&E 318 (CME 338) Large-Scale Numerical Optimization

On (T,f )-connections of matrices and generalized inverses of linear operators

Jim Lambers MAT 610 Summer Session Lecture 2 Notes

On the Skeel condition number, growth factor and pivoting strategies for Gaussian elimination

Block Lanczos Tridiagonalization of Complex Symmetric Matrices

Hands-on Matrix Algebra Using R

WEIGHTED LIMITS FOR POINCARÉ DIFFERENCE EQUATIONS. Rotchana Chieocan

MATH 581D FINAL EXAM Autumn December 12, 2016

THE RELATION BETWEEN THE QR AND LR ALGORITHMS

Lecture 7: Positive Semidefinite Matrices

October 7, :8 WSPC/WS-IJWMIP paper. Polynomial functions are renable

WHEN MODIFIED GRAM-SCHMIDT GENERATES A WELL-CONDITIONED SET OF VECTORS

Numerical Methods I Eigenvalue Problems

Numerical Methods for Solving Large Scale Eigenvalue Problems

Key words. Strongly eventually nonnegative matrix, eventually nonnegative matrix, eventually r-cyclic matrix, Perron-Frobenius.

Numerically Stable Cointegration Analysis

Jordan Journal of Mathematics and Statistics (JJMS) 5(3), 2012, pp A NEW ITERATIVE METHOD FOR SOLVING LINEAR SYSTEMS OF EQUATIONS

QR-decomposition. The QR-decomposition of an n k matrix A, k n, is an n n unitary matrix Q and an n k upper triangular matrix R for which A = QR

Finite dimensional indefinite inner product spaces and applications in Numerical Analysis

Linear Algebra: Characteristic Value Problem

Absolute value equations

ON THE HÖLDER CONTINUITY OF MATRIX FUNCTIONS FOR NORMAL MATRICES

LINEAR ALGEBRA BOOT CAMP WEEK 4: THE SPECTRAL THEOREM

STABILITY OF INVARIANT SUBSPACES OF COMMUTING MATRICES We obtain some further results for pairs of commuting matrices. We show that a pair of commutin

Abed Elhashash, Uriel G. Rothblum, and Daniel B. Szyld. Report August 2009

e jk :=< e k, e j >, e[t ] e = E 1 ( e [T ] e ) h E.

Singular Value Decompsition

Lecture notes: Applied linear algebra Part 2. Version 1

A fast randomized algorithm for overdetermined linear least-squares regression

Recurrence Relations and Fast Algorithms

THE PERTURBATION BOUND FOR THE SPECTRAL RADIUS OF A NON-NEGATIVE TENSOR

Chapter 3 Transformations

forms Christopher Engström November 14, 2014 MAA704: Matrix factorization and canonical forms Matrix properties Matrix factorization Canonical forms

Mathematical foundations - linear algebra

Math Ordinary Differential Equations

Invertibility and stability. Irreducibly diagonally dominant. Invertibility and stability, stronger result. Reducible matrices

Mathematical Methods for Engineers and Scientists 1

Transcription:

Advances in Computational Mathematics 7 (1997) 295 31 295 Sensitivity analysis of the differential matrix Riccati equation based on the associated linear differential system Mihail Konstantinov a and Vera Angelova b a University of Architecture and Civil Engineering, 1 Hr. Smirnenski Blv., 1421 Sofia, Bulgaria E-mail: mmk fte@bgace5.uacg.acad.bg b Institute of Information Technologies, Akad. G. Bontchev Str., Bl.2, 1113 Sofia, Bulgaria E-mail: vera@bgcict.acad.bg Received February 1995; revised December 1996 Communicated by S. Hammarling Perturbation bounds are given for the solution of the nth order differential matrix Riccati equation using the associated linear 2nth order differential system. The new bounds are alternative to those existing in the literature and are sharper in some cases. Keywords: differential matrix Riccati equation, matrix exponential, sensitivity analysis, linear quadratic optimization, optimal filtering AMS subject classification: 93B35, 93B4 1. Introduction The solution of the differential matrix Riccati equation (DMRE) arising in the theory of linear quadratic optimization and optimal filtering is usually contaminated with rounding and parameter errors. This may lead to significant loss of accuracy and, in particular, to breaking of symmetry and divergence of the numerical procedure, carried out in floating-point computing environment. In turn, the actual error in the computed solution depends on the sensitivity of the solution of DMRE to perturbations in its matrix coefficients. Hence obtaining perturbation bounds for DMRE is important from both the theoretical and computational point of view. The sensitivity of the solution to DMRE is studied in several papers, see, e.g., [3] and [4]. However, these estimates may be pessimistic in some cases. In [6] a new approach is presented to estimate the sensitivity of the solution of DMRE. It is based on the sensitivity analysis of the associated linear differential system and exploits the existing sensitivity estimates [1,2,5,8,9] for the matrix exponential. This paper was partially supported by the National Scientific Research Foundation under Grants TH 44/94 and I 612/96. J.C. Baltzer AG, Science Publishers

296 M. Konstantinov, V. Angelova / Sensitivity analysis of differential matrix Riccati equation In this paper we propose an improved sensitivity estimate for DMRE in 2-norm, based on the approach from [6]. An experimental analysis is made to compare the effectiveness of the different approaches. It is shown that in some cases the new bound is superior relative to the known ones [3,4], i.e., all these bounds are complementary. In what follows we denote by R m n the space of real m n matrices, R + = [, ), is the 2- (or spectral) norm in R m n, A T R n m is the transpose of the matrix A R m n, I n is the unit n n matrix, and the symbol := stands for equal by definition. 2. Statement of the problem Consider the DMRE P (t) = P (t)sp(t) + A T P(t) + P(t)A + Q, t R +, P () = F, where A, S, Q, F, P (t) R n n and the matrices S, Q, F, P (t) are symmetric and nonnegative definite. The linear 2n-dimensional differential equation associated to (1) is Ψ (t) = MΨ(t), Ψ() = I 2n ; M := [ ] A S Q A T := (1) [ ] M11 M 12. (2) M 21 M 22 The solution of (2) is [ ] Ψ(t) = e Mt Ψ11 (t) Ψ := 12 (t). (3) Ψ 21 (t) Ψ 22 (t) If the inverse of the matrix J (t) :=Ψ 11 (t) + Ψ 12 (t)f exists, then the solution of the initial value problem (1) is represented as P (t) = ( Ψ 21 (t) + Ψ 22 (t)f )( Ψ 11 (t) + Ψ 12 (t)f ) 1 := H(t)J 1 (t). (4) Let the round-off and parameter errors accompanying the numerical computations be represented by equivalent perturbations in the data: A A = A + A, S S = S + S, Q Q = Q + Q, F F = F + F, where Z (Z = A, S, Q, F ) is a matrix perturbation in Z with Z Z. Usually only a bound Z on the norm of the perturbation Z is known. When Z is the equivalent perturbation caused by the implementation of a numerically stable method for the solution of (1), then Z eps ϕ(n) Z, where eps is the round-off unit of the machine arithmetic and ϕ(n) is a low order polynomial in n. Denote by P = P + P the solution of the perturbed equation (1) in which Z is replaced by Z (Z = A, S, Q, F ). Then knowing the sensitivity of Ψ(t)

M. Konstantinov, V. Angelova / Sensitivity analysis of differential matrix Riccati equation 297 to perturbations in A, S, Q, F we may estimate the sensitivity of P (t) which is measured by the quantity P (t). The main problems to be solved in this paper are: (i) Find an interval T = [, t ) such that for each t T the matrix J (t) + J (t) :=Ψ 11 (t) + Ψ 11 (t) + ( Ψ 12 (t) + Ψ 12 (t) ) (F + F ) is invertible and a representation of type (4) holds for the perturbed solution where P (t) + P (t) = ( H(t) + H(t) )( J (t) + J (t) ) 1, (5) H(t):= Ψ 21 (t) + Ψ 22 (t) F + Ψ 22 (t)f + Ψ 22 (t) F, J (t):= Ψ 11 (t) + Ψ 12 (t) F + Ψ 12 (t)f + Ψ 12 (t) F. (ii) Find a domain Ω R 4 +, Ω, and an estimate P (t) f(t, ), := [ A, S, Q, F ] T, (6) where the function f : T Ω R + is real analytic, non-decreasing in each component of and f(t,)=. 3. Main results From (3) we have that Ψ 11 () = I n, Ψ 12 () = and(ψ 11 ()+Ψ 12 ()F ) 1 = I n. Denote by σ 1 (t) σ 2 (t) σ n (t) the singular values of the matrix Ψ 11 (t) and let Ψ(t) be the perturbation in Ψ(t), which results from the data perturbations when solving the perturbed system (2), i.e., Ψ(t) = e (M+ M)t e Mt. Then the interval T = [, t ) may be chosen from t := sup { t: Ψ11 (t) + ( Ψ12 (t) + Ψ12 (t) )( F + F ) σn (t) }. (7) Using (5) we get P (t) = ( H(t) + H(t) )( J (t) + J (t) ) 1 H(t)J 1 (t) = ( H(t) P(t) J(t) ) (J(t)+ J(t) ) 1. (8) It is known [7] that for any matrices X, Y R n n such that X 1 exists and X 1 Y <1 the quantity (I n + X 1 Y ) 1 may be estimated as ( I n + X 1 Y ) 1 1 1 X 1 Y.

298 M. Konstantinov, V. Angelova / Sensitivity analysis of differential matrix Riccati equation Hence (8) yields the following bound for the norm of P (t) ( ) P (t) H(t) + P (t) J (t) J 1 (t) 1 J 1 (t) J (t) provided J 1 (t) J (t) < 1. (9) To obtain bounds for J (t) and H(t) we use the fact that for M = [M ij ] R 2n 2n it is fulfilled M ij f M f ( M f := tr(m T M) is the Frobenius norm of M) and M M f r M, r := rank(m).hencewehave J(t) Ψ 11 (t) f + Ψ 12 (t) F + ( F + F ) Ψ 12 (t) f ( 1 + F + F ) Ψ(t) f + Ψ12 (t) F r ( 1 + F + F ) Ψ(t) + Ψ12 (t) F := ω 1 (t, ). (1) Similarly, H(t) r ( 1 + F + F ) Ψ(t) + Ψ22 (t) F := ω 2 (t, ). (11) Since J () = I n and ω 1 (t,)= the quantity τ := sup { t T : ω 1 (t, ) J 1 (t) < 1 } is correctly defined. Hence, as a corollary of (9) (11) we can formulate the following perturbation result: Theorem 1. For t [, τ) the spectral norm of the perturbation P (t) satisfies the estimate P (t) (ω 2 (t, )+ω 1 (t, ) P(t) ) J 1 (t) f(t, ) := 1 ω 1 (t, ) J 1. (12) (t) To represent the norm Ψ(t) of the perturbation Ψ(t) involved in the expressions for ω i by the known quantities A, S, Q, F consider the perturbed system (2) Ψ (t) + Ψ (t) = (M + M) ( Ψ(t) + Ψ(t) ), [ A M := Q ] S A T. We have Ψ(t) = t e M(t s) M e (M+ M)s ds

M. Konstantinov, V. Angelova / Sensitivity analysis of differential matrix Riccati equation 299 Table 1 Power series Log norm Jordan (1) Jordan (2) Schur c 1 1 cond(y ) cond(y ) 1 β M µ(m) α(m) α(m)+d m α(m) γ 1 ν p m l and t Ψ(t) M e M(t s) e (M+ M)s ds t M g(t s) ( ) Ψ(s) + g(s) ds, (13) where M := M and g(t) is an upper bound for e Mt, i.e., e Mt g(t). There are several bounds g for the norm of the matrix exponential based on the power series for e Mt, the logarithmic norm of M, the Jordan form and the Schur decompositions of M, see [8]: p 1 g(t) = c e βt (γt) k /k!, k= where the values of the constants c, β, γ and p are given in table 1. Here µ(m) is the maximum eigenvalue of the matrix (M + M H )/2, J = Y 1 MY is the Jordan canonical form of M and m 1 is the dimension of the maximum block in J (the matrix Y is chosen so that the condition number cond(y ) = Y Y 1 is minimized), α(m) is the spectral abscissa of M, i.e., the maximum real part of the eigenvalues of M, d m := cos(π/(m + 1)), and T = U H MU = Λ + N is the Schur decomposition of M, where U is unitary, Λ is diagonal and N is strictly upper triangular matrix (the matrix U is chosen so that the norm ν = N of the matrix N is minimized), and l = min{s: N s = } is the index of nilpotency of N. For each estimate g we have Ψ(t) u(t), where u is the solution to the majorant integral equation corresponding to (13): t u(t) = M g(t s) ( g(s) + u(s) ) ds. 4. Numerical example Consider the third order matrix differential Riccati equation of type (1) with matrices A = VA V, F = VF V, S = VS V, Q = VQ V, where V is the

3 M. Konstantinov, V. Angelova / Sensitivity analysis of differential matrix Riccati equation Table 2 t δ P δ P1 δ P2 δ P3 8.33 1 2 1.76 1 7 7.87 1 5 1.17 1 4 2.47 1 5 1.67 1 1 7.31 1 7 4.44 1 4 9.25 1 5 4.4 1 5 2.5 1 1 2.23 1 6 3.8 1 4 9.4 1 5 6.86 1 5 3.33 1 1 5.57 1 6 3.94 1 4 9.1 1 5 9.89 1 5 4.17 1 1 1.16 1 5 4.25 1 4 9.1 1 5 1.26 1 4 5. 1 1 2.7 1 5 4.66 1 4 9.1 1 5 1.53 1 4 5.83 1 1 3.31 1 5 5.9 1 4 9.1 1 5 1.8 1 4 6.67 1 1 4.8 1 5 5.5 1 4 9.1 1 5 2.9 1 4 7.5 1 1 6.45 1 5 5.83 1 4 9.1 1 5 2.43 1 4 8.33 1 1 8.11 1 5 6.7 1 4 9.1 1 5 2.83 1 4 Table 3 k δ P1 δ P2 δ P3 of same order as δ P of same order as δ P of same order as δ P 1 exceeds δ P by 1 order of same order as δ P of same order as δ P 2 exceeds δ P by 3 orders exceeds δ P by 1 order exceeds δ P by 1 order 3 exceeds δ P by 5 orders exceeds δ P by 2 orders exceeds δ P by 2 orders elementary reflection V = I 3 2vv T /3, v := [1,1,1] T and the matrices A, F, S, Q are chosen as A = diag ( 1 1 k, 2, 3 1 k), F = diag(,,), S =diag ( 1 k,1,1 k), Q =diag ( 3 1 k,5,7 1 k) for some positive integer k. The sensitivity of this equation increases with increasing k. The perturbations in the data are taken as: A = V A V, F = V F V, S = V S V, Q = V Q V,where A =diag(3 1 k,2,1 k )1 j,forj=1, 8,...,2, and F =, S =, Q =. The exact relative perturbation P (t) δ P := P (t) in the solution of DMRE is compared with the estimate f(t, ) δ P3 := P (t) following from the above given estimate (12), the estimate δ P1 following from the linear estimate K L of Kenney and Hewer [3] and the estimate δ P2 resulting from the non-linear bound proposed by Konstantinov and Pelova [4]. In table 2 the results

M. Konstantinov, V. Angelova / Sensitivity analysis of differential matrix Riccati equation 31 for k = 1, j = 6 are presented and in table 3 the results for k =, 1, 2, 3 and j = 1, 8, 6, 4, 2 are generalized. The results show that with the deterioration of the conditioning of the system (i.e., of the matrix A) the estimate δ P3 from (12) is superior to the other two methods with respect to the closeness to the estimated quantity and size of the domain of validity. Moreover the estimate proposed in this paper has the advantage that it is not related with the solution of the DMRE and hence with the problem of possible loss of symmetry and divergence of the numerical procedure. References [1] G. Golub and C. Van Loan, Matrix Computations (Johns Hopkins University Press, Baltimore, MD, 1983). [2] B. Kågström, Bounds and perturbation bounds for the matrix exponential, BIT 17 (1977) 39 57. [3] C. Kenney and G. Hewer, The sensitivity of the algebraic and differential Riccati equation, SIAM J. Control Optim. 28 (199) 5 69. [4] M. Konstantinov and G. Pelova, Sensitivity of the solution to differential matrix Riccati equations, IEEE Trans. Autom. Control 36 (1991) 213 215. [5] M. Konstantinov, P. Petkov, D. Gu and I. Postlethwaite, Perturbation techniques for linear control problems, Report 95-7, Department of Engineering, Leicester University (February 1995). [6] M. Konstantinov, I. Popchev and V. Angelova, A new approach to the sensitivity analysis of differential matrix Riccati equation, in: National Conference Automatica 94, Sofia, Bulgaria (1994). [7] P. Lancaster, Theory of Matrices (Academic Press, New York, 1969). [8] P. Petkov, N. Christov and M. Konstantinov, Computational Methods for Linear Control Systems (Prentice-Hall, Hemel Hempstead, 1991). [9] C. Van Loan, The sensitivity of the matrix exponential, SIAM J. Numer. Anal. 14 (1977) 971 981.