Doubly structured mapping problems of the form and
Abstract
For a given class of structured matrices , we find necessary and sufficient conditions on vectors and for which there exists with and such that and . We also characterize the set of all such mappings and provide sufficient conditions on vectors , and to investigate a with minimal Frobenius norm. The structured classes we consider include (skew)-Hermitian, (skew)-symmetric, pseudo(skew)-symmetric, -(skew)-symmetric, pseudo(skew)-Hermitian, positive (semi)definite, and dissipative matrices. These mappings are then used in computing the structured eigenvalue/eigenpair backward errors of matrix pencils arising in optimal control.
keywords:
structured matrix, backward error, minimal Frobenius norm, Hermitian, positive definite, positive semidefinite, Hamiltonian , dissipative matrix AMS subject classification. 15A04, 15A60, 15A63, 65F20, 65F35,1 Introduction
Problem 1 (Doubly structured mapping problem).
For a given class of structured matrices , and vectors and , we consider the following mapping problem:
-
1.
Existence: Find necessary and sufficient conditions on vectors , and for the existence of , where and such that and .
We call such a mapping as doubly structured mapping (DSM) as it has two structures defined on it; (i) conjugate transpose of satisfies , and (ii) has the form with .
-
2.
Characterization: Determine the set
(1) of all such doubly structured mappings.
-
3.
Minimal Frobenius norm: Characterize all solutions to the doubly structured mapping problem that have minimal Frobenius norm.
The structures we consider on in a DSM problem include symmetric, skew-symmetric, pseudosymmetric, pseudoskew-symmetric, Hermitian, skew-Hermitian, pseudo-Hermitian, pseudoskew-Hermitian, positive (negative) semidefinite, and dissipative matrices.
The minimal norm solutions to such doubly structured mappings can be very handy in the perturbation analysis of matrix pencils arising in control systems [14]. In particular, for the computation of structured eigenvalue/eigenpair backward errors of matrix pencils of the form
(2) |
where , and satisfy , is positive semidefinite, , and is positive definite. The pencil arises in control problems and in the passivity analysis of dynamical systems [10, 16]. One example of such a system is a port-Hamiltonian descriptor system [5, 18]. Our work is motivated by [14], where the eigenpair backward errors have been computed while preserving the block and symmetry structures of pencils of the form , where only the Hermitian structure was considered on . The definiteness structure on describes the energy dissipation in the system and guarantees the stability of the underlying port-Hamiltonian system [15, 9]. This makes it essential to preserve the definiteness of to preserve the system’s port-Hamiltonian structure.
The standard mapping problem for matrices is to find for given vectors and , such that . Such mapping problems have been well studied in [11], where authors provide complete, unified, and explicit solutions for structured mappings from Lie and Jordan algebras associated with orthosymmetric scalar products. The minimal norm solutions to the structured mappings provide an important tool in solving nearness problems for control systems, e.g. [6, 7, 12, 13, 4]. The DSMs extend the mapping problem of finding for given vectors such that and [12, 13].
This paper is organized as follows: In Section 2, we review some preliminary results on mapping problems. In Section 3, we present necessary and sufficient conditions for the existence of DSMs with structures belonging to a Jordan or a Lie algebra. In particular, we consider doubly structured Hermitian, skew-Hermitian, symmetric, and skew-symmetric mapping problems. We provide solutions to the doubly structured semidefinite mapping problem in Section 4. In Section 5, we introduce two types of doubly structured dissipative mappings. The minimal norm solutions to the DSM problems are then used in estimating various structured eigenpair backward errors for the pencil arising in control systems, see Section 6.
Notation
In the following, we denote the identity matrix of size by , the spectral norm of a matrix or a vector by and the Frobenius norm by . The Moore-Penrose pseudoinverse of a matrix or a vector is denoted by and denotes the orthogonal projection onto the null space of matrix . For a square matrix , its Hermitian and skew-Hermitian parts are respectively denoted by and . For , where , we denote () and () if is Hermitian positive definite (negative definite) and Hermitian positive semidefinite (negative semidefinite). denotes the set of all eigenvalues of the matrix . , , , and stand respectively for the set of Hermitian, skew-Hermitian, symmetric, and skew-symmetric matrices.
2 Preliminaries
In this section, we state some elementary lemmas and recall some mapping results that will be necessary to solve the DSM problem.
Lemma 1.
[3] Let the integer be such that , and be partitioned as with , and . Then if and only if
-
1.
,
-
2.
, and
-
3.
, where denotes the Moore-Penrose pseudoinverse of .
Lemma 2.
[4] Let . Suppose that and consider the reduced singular value decomposition with and . If , then .
Lemma 3.
Let with . Suppose that and consider the reduced singular value decompositions and , where , , and are the diagonal matrices containing the nonzero singular values of and , respectively. If , then
(3) |
Proof.
The proof follows using the fact that and . In fact, we have
∎
Lemma 4.
[8, P.57] Let . If , then where is any unitarily invariant matrix norm.
2.1 Mapping results
Here, we recall some mapping results from the literature that will be useful in solving DSM problem for various structures. We start with a result from [17] that solves the standard mapping problem with no structure on it.
Theorem 1.
We next recall a few mapping results from [1] that give a characterization and minimal Frobenius norm solution for the Hermitian, skew-Hermitian, complex symmetric, and complex skew-symmetric mapping problems.
Theorem 2.
Theorem 3.
[1] Let and let . Then if and only if . If the later condition holds, then
Moreover, , where the infimum is uniquely attained by .
Theorem 4.
Theorem 5.
The next result from [13] solves the mapping problem of finding for given vectors such that and .
Theorem 6.
[13] Let and let
Then if and only if . If the later condition holds, then
Moreover, , where the infimum is uniquely attained by .
We close this subsection by stating two results that provide solutions to the positive semidefinite mapping problem and dissipative mapping problem, respectively.
Theorem 7.
[12, Theorem 2.3] Let and let . Then if and only if . If the later condition holds, then
Moreover, and infimum is uniquely attained by the rank one matrix .
3 DSM problems with structures belonging to a Jordan or a Lie algebra
In this section, we define the structures on in a DSM problem that are associated with some orthosymmetric scalar product. Let be unitary such that is either symmetric or skew-symmetric or Hermitian or skew-Hermitian. Define the scalar product by
Then the adjoint of a matrix with respect to the scalar product is denoted by and defined by
We also have a Lie algebra and a Jordan algebra , associated with defined by
respectively, see [11] for more details. We refer to [11, Table 2.1] for some known structured matrices in some or associated with a scalar product. This include symmetric, skew-symmetric, pseudosymmetric, pseudoskew-symmetric, Hermitian, skew-Hermitian, pseudo-Hermitian, pseudoskew-Hermitian, etc.
If and if we define , then it is easy to check that
(9) |
In view of (9), the following result shows that the doubly structured mapping problems with are prototypes of more general structured matrices belonging to Jordan and Lie algebras [11, 2].
Theorem 9.
Consider a Lie algebra and a Jordan algebra , associated with a scalar product and let . Then for given vectors and , if and only if for some . Further, is of minimal Frobenius norm in if and only if is of minimal Frobenius norm in .
Given Theorem 9, the DSM problem with structures belonging to or can be solved by reducing it to the DSM problem for . Thus, in the following, we only consider the DSMs with structures .
3.1 Doubly structured Hermitian mappings
This section considers the doubly structured Hermitian mapping (DSHM) problem, i.e., when in Problem 1. We have the following result that completely solves the existence and characterization problem for DSHMs and provides sufficient conditions for the minimal norm solution to the DSHM problem.
Theorem 10.
Given with and , , and with and . Define
(10) |
Then if and only if and . If the later conditions hold true, then
(11) |
where and with given by
(12) | |||||
(13) | |||||
(14) | |||||
(15) |
and
(16) |
Moreover, if for some nonzero , then equality holds in (10) and we have
where infimum is uniquely attained by the matrix .
Proof.
Let us suppose that . Then there exists with and such that , and . This implies that . Also, , since and . This implies that . Conversely, if , then satisfies that , and , which implies that .
Next, we prove (11). First suppose that , i.e., , such that , and . This implies that
(17) |
Since is a Hermitian matrix taking to , from Theorem 2 has the form
(18) |
for some Hermitian matrix . By substituting from (18) in (17), we get
(19) |
i.e., a mapping of the form and , where . The vectors , and satisfy
Therefore, from Theorem 6, can be written as
(20) |
for some .
Conversely, let , where , and are defined by (12)-(15) for some matrices and such that . Then it is easy to check that and since . Also since and . Hence . This shows “” in (11).
In view of (11), we have
(24) |
where the first inequality in (LABEL:eq:firstineq) follows due to the fact that for any two real valued functions and defined on the same domain, . Also equality in (3.1) follows since the infimum in the first term is attained when . In fact, for any such that , we have , which implies from Theorem 2 that the minimum of is attained when . Further, for a fixed and for any , is a matrix satisfying and . This implies from Theorem 6 that for any fixed , the minimum of over is attained when , which yields (24). This proves (10).
Next suppose if for some nonzero , then for every . This implies from (24) that
(25) |
and in this case the lower bound is attained since . This completes the proof.
3.2 Doubly structured skew-Hermitian mappings
A result analogous to Theorem 10 can be obtained for doubly structured skew-Hermitian mappings (DSSHMs), i.e., when in Problem 1. In the following, we state the result for DSSHMs and skip its proof as it is similar to the proof of Theorem 10.
Theorem 11.
Given with and , , and with and . Define
Then if and only if and . If the later conditions hold true, then
where and with given by
and
(26) |
Moreover, if for some nonzero , then equality holds in (26) and we have
where infimum is uniquely attained by the matrix .
3.3 Doubly structured complex symmetric/skew-symmetric mappings
In this section, we consider the doubly structured symmetric mapping (DSSM) problem, i.e., when in Problem 1. We have the following result for DSSMs, proof of which is kept in A.
Theorem 12.
Given with and , , and with and . Define
(27) |
Then if and only if . If the later conditions hold true, then
(28) |
where and with given by
(29) | |||||
(30) | |||||
(31) | |||||
(32) |
and
(33) |
Moreover, if for some nonzero , then equality holds in (33) and we have
where infimum is uniquely attained by the matrix .
Proof.
See A.
A result analogous to Theorem 12 can be obtained for doubly structured skew-symmetric mappings, i.e., when in Problem 1 as follows.
Theorem 13.
Given with and , , and with and . Define
(34) |
Then if and only if and . If the later conditions hold true, then
(35) |
where and with given by
(36) | |||||
(37) | |||||
(38) | |||||
(39) |
and
(40) |
Moreover, if for some nonzero , then equality holds in (40) and we have
where infimum is uniquely attained by the matrix .
4 Solution to the doubly structured semidefinite mapping problem
This section considers the doubly structured positive semidefinite mapping (DSPSDM) problem, i.e., when is the set of all positive semidefinite matrices in Problem 1. We first prove a lemma that will be needed in characterizing the set of all solutions to the DSPSD mapping problem.
Lemma 5.
Let such that . If implies that , then .
Proof.
Let be the eigenvalues of . Then by assumption for all . Also, implies that there exists a unitary matrix such that , where with for all . Thus we have
(41) |
where . This implies that
since and are unitary similar and have the same eigenvalues, and and for all .
We have the following result that completely solves the existence and characterization problem for DSPSDMs and provides sufficient conditions for the minimal norm solution to the DSPSDM problem.
Theorem 14.
Given with and , , and with and . Define
(42) |
Then if and only if and . If the later conditions hold true, then
(43) |
where and with given by
(44) | |||||
(45) | |||||
(46) | |||||
(47) |
and
(48) |
Moreover, if for some nonzero , or, if all eigenvalues of the matrix lie in the left half of the complex plane, i.e., implies that , then we have
where the infimum is uniquely attained by the matrix .
Proof.
Suppose that and let . Then with such that , , and . This implies that . Also, , since and . In fact, we have , since if , then this implies that and hence , which is a contradiction as . Conversely, let and . Then it is easy to see that the matrix satisfies . Also for being a rank one symmetric matrix, which implies that .
Next, we prove (43). For this, let , i.e., such that , and . This implies that
(49) |
Since taking to , from Theorem 7 has the form
(50) |
for some positive semidefinite matrix . By substituting from (50) in (49), we get
(51) |
where . Again since , in view of Theorem 6 has the form
(52) |
for some . Thus in view of (50) and (52), we have
(54) | |||||
(57) |
This proves “” in (43).
Conversely, let and and consider , where , and given by (44)-(47) for some matrices and such that . Then, it is easy to verify that and . Also, , being the sum of two positive semidefinite matrices. This implies and hence shows in (43).
In view of (43) and by following the arguments similar to the proof of (10) in Theorem 10, we have that
(58) |
Next we show that equality holds in (58) for two cases. First suppose that for some nonzero . Then and thus for any . This implies from (58) that
and the lower bound is uniquely attained since . Now suppose that , where implies that . Then for any such that , we have
(59) | |||||
(60) |
where (59) follows by repeated use of the identity for matrix , and the fact that . The last inequality (60) follows because of the fact that , this is due to Lemma 5, since as , and by assumption that implies . This implies from (60) that
(61) |
Thus from (58) and (61), we have that
and again the lower bound is uniquely attained since . This completes the proof.
Remark 1.
We note that although in Theorem 14, we considered only the DSPSDM problem, there is a corresponding result for the doubly structured negative semidefinite mapping (DSNSDM) problem, i.e. when is the set of negative semidefinite matrices in Problem 1. The corresponding result for DSNSDMs follows from Theorem 14 by replacing with and with .
5 Solution to the doubly structured dissipative mapping problem
Let denote the set of all dissipative matrices, i.e., implies that . In this section, we consider two types of doubly structured dissipative mapping (DSDM) problems: (i) for given vectors , find such that , and . We call this mapping problem as Type-1 DSDM problem; (ii) for given vectors , and , find with and such that and . We call this mapping problem a Type-2 DSDM problem.
5.0.1 Type-1 doubly structured dissipative mappings
In the following, we tackle the type-1 DSDM problem in a general case when , and are matrices of size . The result provides a complete, unified, and explicit solution to the Type-1 DSDM problem when and share the same range space.
Theorem 15.
Let with , and let be the singular value decompositions of and with , where . Define . Suppose that and . Then if and only if
(62) |
Moreover, if , then
-
1.
Characterization:
(65) where
(66) with .
-
2.
Minimal norm mapping:
(67) where the infimum is uniquely attained by the matrix
(70) which is obtained by setting and in (65).
Proof.
First suppose that , i.e., , , and . Then clearly and . Also, and . Conversely, suppose that , and satisfy (62). Then the matrix defined in (70) satisfies and . Further, we have
with . Clearly and in fact from Lemma 2, since . Thus in view of Lemma 1, we have , since from Lemma 2 , by assumption , and . This implies that .
Next, we prove (65). First suppose that , i.e., , , and . Let , where , , and such that and become the reduced SVDs of and , respectively. Now consider
(72) |
where
Clearly, , since Frobenius norm is unitarily invariant, and also if and only if . As , we have which implies that
(83) |
This implies that
(84) |
Thus from (84), we have
(85) |
and
(86) |
since and . Similarly, implies that and we have
since and . This implies that
Thus, we have
(88) |
and
(89) |
since and . Thus from (85) and (88),
(90) |
and
(91) |
where in (90) and (91), we have used Lemma 3. Similarly, from (86) and (89)
(92) |
Note that since , in view of Lemma 2 , we have that . Therefore
(93) |
where are such that and . That means, satisfies that , and in view of Lemma 1 satisfies the constraints and with . Thus from (72), we have
(99) |
By setting and in (99), we obtain that
(100) |
For the other side inclusion in (65), let be any matrix of the form
where and satisfy the conditions (66). Then using the fact that , , , and , can be written as
(101) |
Clearly satisfies that and , since , , and . Further, in view of (66) and Lemma 1 we have that
since from Lemma 2 as , by assumption , and , since satisfies that . This implies that and hence . This proves in (65).
Suppose that and let , then from (65) we have that
where the last equality follows as for any square matrix we have . This implies that
(105) | |||
(106) |
where the first inequality in (105) is obvious since for any and the second inequality is due to Lemma 4, since is unitarily invariant and implies that for any such that we have . Thus by setting and , we obtain a unique matrix that attains the lower bound in (106), i.e.,
This competes the proof. ∎
The vector case Type-1 DSDMs, i.e., when in Theorem 15, is particularly interesting. This is because (i) the conditions on the free matrices in (65) are more simplified, and (ii) it will be used in computing the structured eigenpair backward errors for pencil defined in (2), see Section 6. For future reference, we state the vector case separately.
Theorem 16.
Let and let for some nonzero . Suppose that . Then if and only if and .
Moreover, if , then
(107) |
where
(108) |
where . Further,
where the infimum is uniquely attained by , which is obtained by setting and in (107).
5.0.2 Type-2 doubly structured dissipative mappings
In this section, we consider the Type-2 DSDM problem, i.e. when in Problem 1. We have the following result that completely solves the existence and characterization problem of the Type-2 DSDM problem and derives sufficient conditions for computing the minimal norm solution to the Type-2 DSDM problem.
Theorem 17.
Given with and , , and with and . Define
(109) |
Then if and only if and . If and , then
(110) |
where
(111) |
and with , , , given by
(112) | |||||
(113) | |||||
(114) | |||||
(115) |
and
(116) |
where
(117) |
Moreover, if for some and is orthogonal to , then
(118) |
where is defined by (117) and , and the infimum in (118) is uniquely attained by the matrix .
Proof.
First suppose that and let . Then with , such that , , and . This implies that . Since , we have which implies that
since . Conversely, let and . Then it is easy to check that with and satisfies and . Further,
since and being a rank one symmetric matrix. This implies that .
Next we prove (110). For this, let , i.e., such that , , and . This implies that
(119) |
Since with taking to , from Theorem 8
or, equivalently,
(120) |
for some such that
By substituting from (120) in (119), we get
(121) |
where . Again since , in view of Theorem 6 has the form
(122) |
for some . In view of (120) and (122), we have
(123) |
This proves “” in (110).
Conversely, let and , consider , where , , , and be given by (112)–(115) for some matrices and satisfying (111). Then a straight-forward calculation shows that and . Also . To see this, let and be such that becomes unitary. This implies that
(126) | |||||
(129) |
where we have used the fact that and . Thus in view of Lemma 1 and (129), we have that , since satisfy (111). This proves “” in (110).
In view of (110), we have
(132) |
where the first inequality in (5.0.2) follows due to the fact that for any two real valued functions and defined on the same domain, . Also equality in (LABEL:eq:proofdissnorm2) follows since the infimum in the first term is attained when , , and . In fact, for any satisfying (111), the matrix is a dissipative map taking to , which implies from Theorem 8 that the minimum of is attained when , , and , i.e., for defined by (117). Similarly, for a fixed satisfying (111) and for any , the matrix satisfies that and . This implies from Theorem 6 that for any fixed , the minimum of over is attained when . This justifies (132) and hence proves (116).
Next we prove (118) under the assumption that for some and is orthogonal to . For this, let us first estimate the infimum in the right hand side of (132). For any satisfying (111), we have
(133) | |||
where the equality in (133) follows from (115) and (113) using the fact that is orthogonal to and by setting . This implies that
(134) |
In view of (132) and (134), when for some and , we have that
(135) |
Notice that the lower bound in (135) is uniquely attained for which is obtained by taking , , , and in (110). This completes the proof.
Remark 3.
A remark similar to Remark 2 also holds for Type-2 DSDMs.
6 DSM’s in computing structured eigenpair backward errors of pencils
Consider the pencil in the form (2) that arises in passivity analysis of port-Hamiltonian systems. In this section, we exploit the minimal-norm DSMs from Section 5 to develop eigenpair backward error estimates under block- and symmetry-structure-preserving perturbations. These results extend the work done in [14], where the pencil was considered without semidefinite structure on the block . Let us introduce the perturbation of the pencil , where
(136) |
for and , that affect the blocks of . Thus motivated by [14], we define various structured eigenpair backward errors of for a given pair as follows:
-
1.
the block-structure-preserving eigenpair backward error of with respect to perturbations from the set
(137) is defined by
(138) -
2.
the symmetry-structure-preserving eigenpair backward error of with respect to perturbations from the set
(139) is defined by
(140) -
3.
the semidefinite-structure-preserving eigenpair backward error of with respect to perturbations from the set
(141) is defined by
(142)
We note that by choosing different perturbation sets in (137), (139), and (141), the corresponding backward errors can be defined by allowing perturbations only to specific blocks of . For example, if we chose , where and in (137) to allow perturbation only in blocks and of , then the corresponding backward error is given by . Similarly, the backward errors and can be defined by restricting the perturbation sets as and , where and in (139) and (141), respectively.
The block- and symmetry-structure-preserving eigenpair backward errors and were studied in [14] for different combinations of perturbation blocks , and of . In the following, we obtain results only for the semidefinite-structure-preserving backward error . The backward errors for other combination of the blocks of can be obtained analogously, see B.
Remark 4.
Let be a pencil in the form (2), , and be such that , and . Then for any , where and are defined by (136) for and , we have if and only if
if and only if
(146) | |||||
(150) |
since . Thus for any and , is equivalent to solving the doubly structured mapping defined by (146)-(150), where the structure on depends on the structures imposed on the perturbations , , and .
In view of (146) and (150), the following lemma is analogous to [14, Lemma 6.2] that will be useful in preserving the semidefinite structure on in the backward error .
Lemma 6.
Proof.
The proof is similar to the proof of [14, Lemma 6.2] due to Type-2 doubly structured dissipative mapping from Theorem 17.
Theorem 18.
Let be a pencil as in (2), let and . Partition such that , and . Set and . Then is finite if and only if . If the later condition holds and if satisfies that and for some nonzero , then
(153) |
where
(154) |
and .
Proof.
In view of Remark 4 and Lemma 6, we obtain that is finite if and only if . Thus by substituting in (146) and (150), and using Lemma 6 in (142), we have that
(155) |
If for some nonzero and , then from Theorem 15 and Remark 2 there always exists a Type-1 doubly structured dissipative mapping such that and
(156) |
This is because of Theorem 16 as the necessary and sufficient conditions and for the existence of such a are satisfied, since , , , and . Further, the minimal Frobenius norm of such a is attained by the unique matrix defined in (154). Similarly, from Theorem 1, for any there always exists such that and the minimal Frobenius norm of such a is attained by .
6.1 Numerical experiments
In Table 1, we present some numerical experiments to illustrate the results of this section. We generate a random pencil of the form (2) with no eigenvalues on the imaginary axis and compare the various eigenpair backward errors for perturbations to all the blocks , , , and of . The -values are chosen randomly on the imaginary axis, and is chosen to satisfy the conditions of Theorem 18. The block structured backward error and the symmetry structured eigenpair backward error were obtained in [14, Theorem 6.3]. The semidefinite structure-preserving backward error is obtained in Theorem 18. We observe that the eigenpair backward error is significantly larger when semidefinite structure-preserving perturbations are considered instead of block structure-preserving ones or symmetry structure-preserving ones. The tightness of the lower and upper bounds for depends on the value of , as shown in Theorem 18.
l.b. of | u.b. of | l.b. of | u.b. of | ||
[14] | [14, Theorem 6.3] | [14, Theorem 6.3] | Theorem 18 | Theorem 18 | |
The eigenpair backward errors of when only specific blocks in the pencil are perturbed also follow similar lines and have been kept in B for future reference. In Table 2, we summarize the results for symmetry and semidefinite structure-preserving backward errors with respect to other combinations of the perturbation blocks , , , and of . Table 2 also covers the cases of symmetry structure-preserving backward errors left open in [14] .
perturbation blocks | ||
J and R | [14, Theorem 4.14] | Theorem 19 |
J and E | [14, Theorem 4.6] | [14, Theorem 4.6] |
J and B | Theorem 20 | Theorem 20 |
R and E | [14, Theorem 4.10] | Theorem 24 |
R and B | Theorem 21 | Theorem 22 |
E and B | Theorem 23 | Theorem 23 |
J,R and E | [15, Theorem 5.11] | Theorem 25 |
J,R and B | [14, Theorem 5.4] | Theorem 28 |
R,E and B | [15, Theorem 5.7] | Theorem 27 |
J,E and B | Theorem 26 | Theorem 26 |
J,R,E and B | [15, Theorem 6.3] | Theorem 18 |
References
References
- [1] Bibhas Adhikari, Backward Perturbation and Sensitivity analysis of Structured polynomial Eigenomial Eigenvalue Problem, PhD thesis, Department of Mathematics, IIT Guwahati, Assam, India, 2008.
- [2] Bibhas Adhikari and Rafikul Alam, Structured procrustes problem, Linear Algebra and its Applications, 490 (2016), pp. 145–161.
- [3] A. Albert, Conditions for positive and nonnegative definiteness in terms of pseudoinverses, SIAM Journal on Applied Mathematics, 17 (1969), pp. 434–440.
- [4] Mohit Kumar Baghel, Nicolas Gillis, and Punit Sharma, Characterization of the dissipative mappings and their application to perturbations of dissipative-hamiltonian systems, Numerical Linear Algebra with Applications, (2021).
- [5] Christopher Beattie, Volker Mehrmann, Hongguo Xu, and Hans Zwart, Linear port-hamiltonian descriptor systems, Mathematics of Control, Signals, and Systems, 30 (2018), p. 17.
- [6] Shreemayee Bora, Michael Karow, Christian Mehl, and Punit Sharma, Structured eigenvalue backward errors of matrix pencils and polynomials with hermitian and related structures, SIAM Journal on Matrix Analysis and Applications, 35 (2014), pp. 453–475.
- [7] , Structured eigenvalue backward errors of matrix pencils and polynomials with palindromic structures, SIAM Journal on Matrix Analysis and Applications, 36 (2015), pp. 393–416.
- [8] Philippe G Ciarlet, Philippe Gaston Ciarlet, Bernadette Miara, and Jean-Marie Thomas, Introduction to numerical linear algebra and optimisation, Cambridge University Press, 1989.
- [9] Nicolas Gillis and Punit Sharma, Finding the nearest positive-real system, SIAM Journal on Numerical Analysis, 56 (2018), pp. 1022–1047.
- [10] P. Kunkel and V. Mehrmann, Optimal control for unstructured nonlinear differential-algebraic equations of arbitrary index, Math. Control Signals Systems, 20 (2008), pp. 227–269.
- [11] D S. Mackey, N. Mackey, and F. Tisseur, Structured mapping problems for matrices associated with scalar products. part i: Lie and jordan algebras, SIAM Journal on Matrix Analysis and Applications, 29 (2008), pp. 1389–1410.
- [12] C. Mehl, V. Mehrmann, and P. Sharma, Stability radii for linear Hamiltonian systems with dissipation under structure-preserving perturbations, SIAM Journal on Matrix Analysis and Applications, 37 (2016), pp. 1625–1654.
- [13] , Stability radii for real linear Hamiltonian systems with perturbed dissipation, BIT Numerical Mathematics, 57 (2017), pp. 811–843.
- [14] Christian Mehl, Volker Mehrmann, and Punit Sharma, Structured eigenvalue/eigenvector backward errors of matrix pencils arising in optimal control, Electronic Journal of Linear Algebra, 34 (2018).
- [15] Christian Mehl, Volker Mehrmann, and Marek Wojtylak, Linear algebra properties of dissipative hamiltonian descriptor systems, SIAM Journal on Matrix Analysis and Applications, 39 (2018), pp. 1489–1519.
- [16] V. Mehrmann, The Autonomous Linear Quadratic Control Problem, Theory and Numerical Solution, vol. 163 of Lecture Notes in Control and Inform. Sci., Springer-Verlag, Heidelberg, Jul 1991.
- [17] Ji-Guang Sun, Backward perturbation analysis of certain characteristic subspaces, Numerische Mathematik, 65 (1993), pp. 357–382.
- [18] A. J. Van der Schaft, Port-Hamiltonian differential-algebraic systems, in Surveys in Differential-Algebraic Equations, Springer, 2013, pp. 173–226.
Appendix A Proof of Theorem 12
Proof.
Let us suppose that . Then there exists with and such that , and . This implies that . Conversely, if , then satisfies that , and , which implies that .
Next, we prove (28). First suppose that , i.e., , such that , and . This implies that
(158) |
Since is a Complex-Symmetric matrix taking to , from Theorem 4 has the form
(159) |
for some Complex-symetric matrix . By substituting from (159) in (158), we get
(160) |
i.e., a mapping of the form and , where
The vectors , and satisfy
Therefore, from Theorem 6, can be written as
(161) |
for some .
Conversely, let , where , and are defined by (29)-(32) for some matrices and such that . Then it is easy to check that and since . Also since . Hence . This shows “” in (28).
In view of (28), we have
(165) |
where the first inequality in (LABEL:eq:firstineq_T) follows due to the fact that for any two real valued functions and defined on the same domain, . Also equality in (A) follows since the infimum in the first term is attained when . In fact, for any such that , we have , which implies from Theorem 4 that the minimum of is attained when . Further, for a fixed and for any , is a matrix satisfying and . This implies from Theorem 6 that for any fixed , the minimum of over is attained when , which yields (165). This proves (33).
Next suppose if for some nonzero , then for every . This implies from (165) that
(166) |
and in this case the lower bound is attained since . This completes the proof.
Appendix B Estimation of and when perturbing any two/three of the blocks , , and of the pencil
Let be a pencil of the form (2), and with and .
B.1 Perturbing only and
Suppose that only and blocks of are subject to perturbation. Then in view of (138), (140) and (142), the corresponding backward errors are denoted by , , and . In this case, the block-structured and the symmetry-structured backward errors and were obtained in [14, Theorem 4.14]. Thus, we provide estimation only for the semidefinte-structured backward error . In view of (146) and (150) , when we obtain
(167) | |||||
(168) | |||||
(169) |
This gives us the following lemma which is analogous to Lemma 6.
Lemma 7.
Proof.
The proof is analogous to [14, Lemma 4.13] due to Type-1 doubly structured dissipative mapping from Theorem 16.
Theorem 19.
Let be a pencil as in (2), let and . Partition such that , and . Set and . Let for some nonzero . Then is finite if and only if and . If the later condition holds and if satisfies that , then
(170) |
where
B.2 Perturbing only and
In this section, suppose that only and blocks of are subject to perturbation. Then in view of (138), (140) and (142), the corresponding backward errors are denoted by , and . Note that the block-structured backward error was obtained in [14, Theorem 4.17], but the symmetry-structured backward error were not known in [14] due to unavailability of the doubly structured skew-Hermitian mappings. Also note that , because we are not perturbing and there is no semidefinite structure on and . To estimate from (146) and (150), when and , we obtain
(174) | |||||
(178) |
This leads to the following lemma.
Lemma 8.
Proof.
The proof is immediate from Theorem 11 since , , and .
Theorem 20.
Let be a pencil as in (2), let and . Partition such that , and . Set and , . Then is finite if and only if and . If the later condition holds and if and if for some nonzero , then
(179) |
where
(180) |
Proof.
In view of Remark 4 and Lemma 8, we obtain that is finite if and only if and . Thus by using and in (174) and (178), and using Lemma 8 in the definition of from (140), we have that
(181) |
If and for some nonzero , then from [1, Theorem 2.2.3], there always exists a skew-Hermitian mapping such that and . The minimal Frobenius norm of such a is attained by the unique matrix defined in (180). Similarly, from Theorem 1, for any there always exists such that and the minimal Frobenius norm of such a is attained by . Using the minimal Frobenius norm mappings and , we obtain (179). This completes the proof.
B.3 Perturbing only and
Here, suppose that only and blocks of are subject to perturbation. Then in view of (138), (140) and (142), the corresponding backward errors are denoted by , , and . Note that the backward error was obtained in [14, Remark 4.18]. In this section, we compute the eigenpair backward errors and .
For this, observe from (146) and (150) that when and , we have
(185) | |||||
(189) |
In view of Theorem 10, there exists and such that satisfying (185) and (189) if and only if and . We have the following result for .
Theorem 21.
Let be a pencil as in (2), let and . Partition such that , and . Set and , . Then is finite if and only if and . If the later condition holds and if and if for some nonzero , then
(190) |
where
(191) |
Proof.
In view of Remark 4 and (185)-(189), we obtain that is finite if and only if and . Thus by using (185) and (189), we have from (140) that
(192) |
If and for some nonzero , then from [1, Theorem 2.2.3], there always exists a Hermitian mapping such that and . From [1, Theorem 2.2.3], the minimal Frobenius norm of such a is attained by the unique matrix defined in (191). Similarly, from Theorem 1, for any there always exists such that and the minimal Frobenius norm of such a is attained by . Using minimal Frobenius norm mappings and , we obtain (190). This completes the proof.
Next, we estimate the semidefinite structured backward error . For this, we need the following lemma.
Lemma 9.
Proof.
The proof is immediate from the doubly structured semidefinite mapping from Theorem 14.
Theorem 22.
Let be a pencil as in (2), let and . Partition such that , and . Set and , . Then is finite if and only if , , and . If the later condition holds and if and if for some nonzero , then
(193) |
where
(194) |
Proof.
In view of Remark 4 and Lemma 9, we obtain that is finite if and only if , , and . Thus by using in (190) and (191), and using Lemma 9 in (140), we have that
(195) |
If , and for some nonzero , then from [13, Theorem 2.2], there always exists a negative definite mapping such that and . From [13, Theorem 2.2] the minimal Frobenius norm of such a is attained by the unique matrix defined in (194). Similarly, from Theorem 1, for any there always exists such that and the minimal Frobenius norm of such a is attained by . Thus using the minimal Frobenius norm mappings and , we obtain (193).
B.4 Perturbing only and
In this section, suppose that only and blocks of are subject to perturbation. Then in view of (138), (140) and (142), the corresponding backward errors are denoted by , , and . Again note that was obtained in [14, Theorem 4.19], and we have because we are not perturbing and there is no semidefinite structure on or .
In view of (146) and (150), when and , we have
(199) | |||||
(203) |
As and , we have that is skew-Hermitian. Then a direct application of the doubly structured skew-Hermitian mapping from Theorem 11 yields the following emma.
Lemma 10.
The following result provides bounds for the backward error .
Theorem 23.
Let be a pencil as in (2), let and . Partition such that , and . Set and , . Then is finite if and only if and . If the later conditions holds and if and if for some nonzero , then
(204) |
where
(205) |
B.5 Perturbing only and
Here suppose that only and blocks of are subject to perturbation. Then in view of (138), (140) and (142), the corresponding backward errors are denoted by , , and . We note that the backward errors and were considered in [14, Theorem 4.10]. Thus, in this section, we consider only . From (146) and (150), when and we get
(206) | |||||
(207) | |||||
(208) |
This leads to the following lemma which will be useful in estimating .
Lemma 11.
Proof.
The proof is analogous to [14, Lemma 4.9], due to Type-1 doubly structured dissipative mapping from Theorem 16.
Theorem 24.
Let be a pencil as in (2), let and . Partition such that , and . Set and . If for some nonzero , then is finite if and only if and . If the later condition holds and if satisfies that , then
and
where
(209) |
B.6 Perturbing only , and
Suppose that the blocks , and of are subject to perturbation. Then in view of (138), (140) and (142), the corresponding backward errors are denoted by , , and . The block- and symmetry-structured backward errors and were obtained in [14, Theorem 5.11]. In this section, we focus on estimating the backward error .
From (146) and (150), when we have
(210) | |||||
(211) | |||||
(212) |
In view of (210) and (212), we have the following lemma which is analogous to 6 for estimting .
Lemma 12.
Proof.
The proof is analogous to [14, Lemma 5.10], due to Type-1 doubly structured dissipative mapping from Theorem 16.
Theorem 25.
Let be a pencil as in (2), let and . Partition such that , and . Set and . If for some nonzero , then is finite if and only if and . If the later condition holds and if satisfies that , then
where
B.7 Perturbing only J,E and B
In this section, suppose that the blocks , and of are subject to perturbation. Then in view of (138), (140) and (142), the corresponding backward errors are denoted by , , and . The backward error was given in [14, Remark 5.8], and we have because there is no semidefinite structure on or or . Thus we focus on computing .
From (146) and (150), when we have
(216) | |||||
(220) |
Thus using doubly structured skew-Hermitian mapping from Theorem 11 in (216) and (220) gives the following lemma.
Lemma 13.
Proof.
The proof is similar to [14, Lemma 5.6] due to doubly structured skew Hermitian mapping from Theorem 11.
Theorem 26.
Let be a pencil as in (2), let and . Partition such that , and . Set and , . Then is finite if and only if and . If the later condition holds and if , if for some nonzero , then
(221) |
where
(222) |
Proof.
In view of Remark 4 and Lemma 13, we have that is finite if and only if and . Thus by using in (216) and (220), and using Lemma 13 in (140), we have that
(223) |
If and for some nonzero , then from [1, Theorem 2.2.3], there always exists a skew-Hermitian mapping such that and . The minimal Frobenius norm of such a is attained by the unique matrix defined in (222). Similarly, from Theorem 1, for any there always exists such that and the minimal Frobenius norm of such a is attained by . Thus using the minimal Frobenius norm mappings and , we obtain (221). This completes the proof.
B.8 Perturbing only R,E and B
Here, suppose that the blocks , and of are subject to perturbation. Then in view of (138), (140) and (142), the corresponding backward errors are denoted by , , and . The block and symmetry structured backward errors and were obtained in [14, Theorem 5.7]. In this section we compute bounds for semidefinite structured backward error .
For this, from (146) and (150), when we have
(227) | |||||
(231) |
The following lemma is analogous to [14, Lemma 6.2] that will be useful in computing .
Lemma 14.
Proof.
The proof is similar to the proof of [14, Lemma 5.6] due to Type-2 doubly structured dissipative mapping from Theorem 17.
Theorem 27.
Let be a pencil as in (2), let and . Partition such that , and . Set and . Then is finite if and only if . If the later condition holds and if satisfies that and for some nonzero , then
when , and
when , where
where and .
B.9 Perturbing only J,R and B
Finally, suppose that the blocks , and of are subject to perturbation. Then in view of (138), (140) and (142), the corresponding backward errors are denoted by , , and . Again note that the block and symmetry structured backward errors and were respectively obtained in [14, Theorem 5.3] and [14, Theorem 5.4]. Thus, in this section, we focus only on computing the semidefinite structured backward error .
From (146) and (150), when we have
(235) | |||||
(239) |
Then a direct use of Type-2 doubly structured dissipative mapping from Theorem 17 in (235) and (239), gives the following lemma.
Lemma 15.
Theorem 28.
Let be a pencil as in (2), let and . Partition such that , and . Set and . Then is finite if and only if . If the later condition holds and if satisfies that and for some nonzero , then
(240) |
where
(241) |
and .