Next Article in Journal
Open Quantum Dynamics: Memory Effects and Superactivation of Backflow of Information
Next Article in Special Issue
Nonlinear Optimal Control for Stochastic Dynamical Systems
Previous Article in Journal
Recycling Pricing and Government Subsidy Strategy for End-of-Life Vehicles in a Reverse Supply Chain under Consumer Recycling Channel Preferences
Previous Article in Special Issue
Modeling and Control of a DC-DC Buck–Boost Converter with Non-Linear Power Inductor Operating in Saturation Region Considering Electrical Losses
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Spectral Decomposition of Gramians of Continuous Linear Systems in the Form of Hadamard Products

V.A. Trapeznikov Institute of Control Sciences, 65 Profsoyuznaya, 117997 Moscow, Russia
Mathematics 2024, 12(1), 36; https://doi.org/10.3390/math12010036
Submission received: 9 October 2023 / Revised: 14 December 2023 / Accepted: 15 December 2023 / Published: 22 December 2023
(This article belongs to the Special Issue Dynamics and Control Theory with Applications)

Abstract

:
New possibilities of Gramian computation, by means of canonical transformations into diagonal, controllable, and observable canonical forms, are shown. Using such a technique, the Gramian matrices can be represented as products of the Hadamard matrices of multipliers and the matrices of the transformed right-hand sides of Lyapunov equations. It is shown that these multiplier matrices are invariant under various canonical transformations of linear continuous systems. The modal Lyapunov equations for continuous SISO LTI systems in diagonal form are obtained, and their new solutions based on Hadamard decomposition are proposed. New algorithms for the element-by-element computation of Gramian matrices for stable, continuous MIMO LTI systems are developed. New algorithms for the computation of controllability Gramians in the form of Xiao matrices are developed for continuous SISO LTI systems, given by the equations of state in the controllable and observable canonical forms. The application of transformations to the canonical forms of controllability and observability allowed us to simplify the formulas of the spectral decompositions of the Gramians. In this paper, new spectral expansions in the form of Hadamard products for solutions to the algebraic and differential Sylvester equations of MIMO LTI systems are obtained, including spectral expansions of the finite and infinite cross - Gramians of continuous MIMO LTI systems. Recommendations on the use of the obtained results are given.

1. Introduction

The first Gramian spectral decompositions for linear continuous and discrete systems with simple spectra were obtained in [1] by the spectral decomposition of the integral representation of the solution to the Lyapunov or Sylvester equations. It is well-known that Gramians are solutions to the Sylvester and Lyapunov equations, to which a great number of scientific papers have been devoted, among which we note [2,3,4,5,6,7,8,9,10,11,12,13]. These equations also play a fundamental role in control theory. Research in the field of linear control systems is closely related to the problem of lowering the model order by constructing an approximating model of lower dimensionality. Even in the case of linear systems of high dimensionality, the use of projection methods allows us to significantly reduce the dimensionality of the approximating model [6,10]. Among such methods, we note balanced truncation, singular value decomposition, the Krylov subspace method, methods for constructing a simplified model based on the Gramian H2-norm, optimal methods, and hybrid methods. Iterative algorithms for their realization have been developed for most of the methods. The Sylvester and Lyapunov matrix equations in applied problems of control theory were studied in [12,13]. In recent years, there has been an interest in developing methods for computing various energy metrics to analyze the stability and degree of controllability, reachability, and observability of these systems. A number of papers proposed such metrics for linear and unstable linear systems [14,15,16,17,18,19,20,21]. In another paper [16], simplified models of large networks based on controllability Gramians were proposed, allowing the computation of energy metrics. Some further papers considered the important problem of the optimal placement of sensors and actuators based on different energy functionals [15,17,18,20]. In [17], a general approach to solving the problem of the optimal placement of sensors and actuators for multivariable control systems was formulated, which is based on the decomposition of the system into stable and unstable subsystems. It is shown that the degree of controllability of the system is determined on the basis of energy metrics based on the use of finite and infinite controllability Gramians. A general method for computing the inverse Gramian of controllability for the equations of state given in the canonical forms of controllability is proposed. In [18], a method for the optimal placement of virtual inertia devices on the graph of an energy system is proposed. This method is based on the use of the energy metrics of the coherence of generators and the square of the H2-norm of the system transfer function, which is given by a standard dynamic model in the state space. The problem is formalized as a nonconvex optimization problem with constraints in the form of the values of the observability Gramians. It is known that energy-efficient control problems are also solved using Gramians. In recent years, these approaches have been developed for complex energy systems, as well as social, transportation, and biological networks in [17,18,19]. In [16,17], it was shown that the closer the eigenvalues of the dynamics matrix are located to the imaginary axis, the less energy is required to make the system or network fully controllable. In [19,20,21], these ideas were developed for digital ecosystems, vibroacoustic control systems, and thermal plant control systems. Thus, the degree of controllability (reachability) of a network is related to the minimum amount of energy, which allows us to introduce new metrics in the form of the minimum eigenvalue of the controllability Gramian and the maximum eigenvalue of its inverse Gramian, as well as the traces of these Gramians. Note that most of the mentioned works use the spectrum of the system dynamics matrix, which makes it quite natural to apply spectral analysis methods to solve the above problems. The use of canonical forms of controllability previously gave rise to a new approach to Gramian computation based on the use of Rouse–Gurwitz tables and Xiao matrices [22,23,24,25,26]. Almost 30 years ago, a paper [23] appeared in which a method and algorithm for computing solutions to Lyapunov equations are proposed for the case when the equations of state of a linear system are given in the canonical form of controllability or observability. It was shown that the solution matrices of the Lyapunov equations can be computed in a new way based on the use of Rouse tables that depends only on the coefficients of the characteristic equation of the dynamic matrix of the system. In recent years, due to the rapid growth of renewable generation in electric power systems, serious problems of controlling the modes of these systems have arisen due to the integration of renewable generation with conventional generation based on the use of conventional synchronous generators [27,28,29,30]. One of the directions for solving the problems of ensuring the stability of the modes of electric power systems is the use of virtual inertia devices in distributed power systems [27,28,29]. The main idea of virtual inertia is to use the synchronous generator model to stabilize the frequency control modes of distributed power systems. In [27], a method and algorithm for the optimal control of the grid frequency based on the use of a simplified synchronous generator model for a reduced-order model based on the model optimization criterion using the H2-norm of the transfer functions of the full and simplified models were proposed. It is well-known that the Gramian method [1,6] is used to solve this problem. In [30], a new method for the simultaneous estimation of unbalanced power and generation based on the inertia index of the system was developed. A mathematical model of a virtual inertia device was proposed, which guarantees accurate power imbalance estimation. The effectiveness of the proposed solutions was confirmed by the fact that the approach takes into account uncertainties in measurement errors, signal delays when using GPS networks, and telecommunication system failures. In large dynamical systems subject to noise or forced oscillations, the stability under small perturbations is determined by their energy that is stored in the power system [31]. To analyze this perturbation energy, this paper proposes a new physically motivated modal Lyapunov analysis (LMA), which combines selective modal analysis with spectral decompositions of specially selected Lyapunov stability indicators. New modal indicators are proposed that characterize individual modes and modal interactions and their relationships with specific state variables. These indicators estimate the integral energy associated with states and signals over an infinite or finite time interval. The new indicators characterize the pairwise interaction between modals in terms of their mutual actions produced in the states of the system over time. It is shown that the proposed modal indicators characterize the stability of individual modes and resonant modal interactions in linear systems with a variable parameter. In this paper, the application of these indices to analyze the stability of a two-zone model of a power system is investigated. This approach is based on the application of the Gramian method in power engineering and is innovative.

Main Contribution

In Section 2, the formulation of the problems of computing Gramian controllability and observability is considered within the framework of a unified concept. An important feature of the concept of this paper is the consideration of Hadamard products for spectral Gramian decompositions, which allows us to reduce the computation of sub-Gramian and Gramian matrices to the computation of numerical sequences of their elements. In this article we propose to improve this approach using Gramian spectral decompositions by extending its application to multidimensional linear control systems given by a standard (A,B,C) representation of the state space. In Section 3, we introduce modal Lyapunov equations of the second type for the state equations of MIMO LTI systems in diagonal canonical form. These equations allow us to compute various sub-Gramians in closed form. They obtain their spectral decompositions in the form of Hadamard products and derive formulas for the multiplier matrices. These equations also obtain spectral decompositions for the SISO LTI system in the canonical forms of controllability and observability. The multiplier matrices of these spectral decompositions, which also are Xiao matrices, play an important role in the following presentation. These equations allow us to compute various sub-Gramians in closed form. Their spectral decompositions in the form of Hadamard products are obtained, and formulas for the multiplier matrices are derived. It is proved that for stable systems the Xiao matrices are positively defined and invariant under similarity transformations. In the rest of this section, we consider the general case of linear continuous MIMO LTI systems represented by (A,B,C)-equations of state. New spectral decompositions of controllability and observability Gramians in the form of Hadamard products are obtained. It is shown that the multiplier matrices are the same in both the MIMO LTI and SISO LTI cases, provided that the system is stable, fully controllable, and observable for both the simple and the pairwise spectra of the dynamics matrix. A new analysis of the properties of multiplier matrices is given. An important property of multiplier matrices is their positive definiteness, which manifests itself in the positivity of the energy metric associated with this property [15,16]. In Section 4, the obtained results are developed to construct spectral decompositions of solutions to a wide class of matrix Sylvester differential equations. In particular, we obtain closed formulas for the Hadamard products of the spectral expansions matrices of cross-Gramian MIMO LTI systems, as well as their traces and diagonal elements.

2. Discussion of the Results and Problem Statement

We consider the Lyapunov equations for a continuous stationary MIMO LTI in diagonal canonical form
A P + P A T = B B T ,
A T P + P A = C T C .
x d = T x , x ˙ d = A d x d + B d u , y d = C d x d , A d = T A T 1 , B d = T B , C d = C T 1 ,
or
A = u 1 u 2 u n s 1 0 0 0 0 s 2 0 0 0 0 s n ν 1 * ν 2 * ν n * ,
where the matrix T is composed of the right eigenvector s u i , and the matrix T 1 is composed of the left eigenvectors ν i * , corresponding to the eigenvalue s i . Let us introduce the notations
β i j = e i T B B T T * e j T , γ i j = e i ( C T 1 ) * C T 1 e j T .
Let us further consider the SISO LTI systems in controllability canonical form [9]
x c t = R c F x t ,
x ˙ c t = A c F x c t + b F u t , x c 0 = 0 ,
y c t = c c F x c t ,
A c F = 0 1 0 0 0 0 1 0 0 0 0 0 0 0 0 1 a 0 a 1 a 2 a n 1 , b F = 0 0 . . 0 1 T ,
c F = ξ 0 ξ 1 . . ξ n 2 ξ n 1 .
The following relations are valid [15]
R c F A R c F 1 = A c F ,   R c F b = b γ F ,   c R c F 1 = c F ,
P c = R c F 1 P c F ( R c F 1 ) T ,
where the matrix P c is a solution of the corresponding Lyapunov equation. With respect to systems (1) and (2), we assume that various structural conditions for the stability, controllability, observability, and spectrum properties of the dynamic matrix are fulfilled. In [26], the following spectral decomposition of the controllability Gramian was obtained:
P c F = k = 1 n   η = 0 n 1   j = 0 n 1   s k j s k η N ˙ s k N s k 1 j + 1 η + 1 .
Let us consider the further SISO LTI of a linear system in observability canonical form [9]. In this case, the following formulas are valid:
x o ( t ) = R o F x ( t ) x ˙ o t = A o F x o t + b o F u t ,   x o 0 = 0 , y o F t = c o F x o t ,
According to the principle of duality, we obtain the expressions [26]
P o F = k = 1 n   η = 0 n 1   j = 0 n 1   s k j s k η N ˙ s k N s k 1 j + 1 η + 1 ,
In addition,
P o = R o F T P o F R o F .
Let us call the Xiao matrix (zero plaid structure) a matrix of the form [23]
Y = y 1 0 y 2 0 y 3 0 y 2 0 y 3 0 y 2 0 y 3 0 0 y 3 0 0 y 3 0 0 y n .
The corresponding matrix elements are calculated by the formulas
y j η = 0 , i f     j + η = 2 k + 1 ,   k = 1,2 n ; ( 1 ) j η 2 , i f     j + η = 2 k ,   k = 1,2 n .
The aim of this article is to develop a general approach and study the properties of spectral decompositions of solutions to differential and algebraic Sylvester and Lyapunov equations in the form of Hadamard products, including modal equations.

3. Main Results

Spectral Gramian decompositions allow us to represent the Gramian matrix as a sum of summands containing multiples of different indices. The role of indices can be different. Some indices play the role of leading indices, others play the role of slave indices. The distribution of the indices’ roles is determined by the specifics of the applied tasks of monitoring and controlling the system state. In addition, computations in the real or complex domain require a different approach to the choice of method and algorithm for computing or analyzing Gramian properties. The main idea of the derivation of modal Lyapunov equations is to decompose the matrix of the right-hand side of the Lyapunov equation into the sum of matrices corresponding to the individual eigenvalues of the dynamics matrix or their combinations and to transform the matrices of the left-hand side accordingly. The main types of spectral decompositions are decompositions by simple, multiple, or Raman (pairwise) spectra. The Gramian matrix is, in general, a complex Hermite matrix, which can be represented as the sum of a symmetric matrix and a oblique symmetric matrix. Many applications of the Lyapunov equations are based on the use of dynamics matrices, input–output matrices, and Faddeev matrices, and, in this case, the matrices of Gramian spectral expansions are valid [30].
A T P i + P i A = 1 2 ( R i * Q + Q R i ) ,
A P i + P i A T = 1 2 ( R i * Q + Q R i ) ,
or
A T P i j + P i j A = 1 2 ( R i * Q R j + R j * Q R i ) ,
A P i j + P i j A T = 1 2 ( R i * Q R j + R j * Q R i ) ,
where Q is the matrix of the right-hand side of the Lyapunov equations, R i , R j are residues of the dynamics matrix, their resolvent in its corresponding eigenvalue. Let us call Equations (5)–(8) modal Lyapunov equations of the first type. In contrast, there are applications in which it is possible to use complex matrices of Lyapunov equation solutions
A T P i + P i A = R i * Q ,
A P i + P i A T = R i * Q ,
or
A T P i j + P i j A = R i * Q R j ,
A P i j + P i j A T = R i * Q R j ,
Let us call Equations (9)–(12) modal Lyapunov equations of the second type.
Theorem 1
([32]). Consider the modal Lyapunov equations of the second type for a continuous stationary MIMO LTI system in diagonal canonical form.
A d P c i j + P c i j A d * = β i j e i e j T , A d P c i + P c i A d * = j = 1 n β i j e i e j T
A d P c i + P c i A d * = j = 1 n β i j e i e j T , A d P o i + P o i A d * = j = 1 n γ i j e i e j T
Above, the corresponding unit vectors are denoted by e i , e j T . Suppose that the system is stable and has a simple spectrum. Then, the controllability and observability Gramians exist, are singular, and can be represented in the form of Hadamard products as
P c = Ω c Ψ c , P o = Ω o Ψ o ,
Ψ c = β i j n × n ,   Ω c = 1 λ i + λ j n × n , Ψ o = γ i j n × n , Ω o = 1 λ i + λ j n × n ,
P c i j = Ω c Ψ c i j ,   Ψ c i j = e i β i j n × n e j T , P c i = j = 1 n Ω c Ψ c i j ,
If, in addition, the pair (A,B) is controllable and the pair (A,C) is observable, then the matrices of multipliers Ω c and Ω o are definitely positive, and their diagonal elements and traces are positive numbers. The Hermite components of the Gramians have the form [2]
P c H = 1 2 P c + P c * ,   P o H = 1 2 P o + P o * .
For Gramians and sub-Gramians of controllability and observability in the form of Hadamard’s products, the next formulas are valid
P c j η H = Ω c j η H Ψ c j η H , P o j η H = Ω o j η H Ψ o j η H ,
Ω c j η H = Ω o j η H = j = 0 n 1 η = 0 n 1 R e 1 λ i + λ η e j + 1 e η + 1 T ,
Ψ c j η H = 1 2 β j η + β j η * , Ψ o j η H = 1 2 γ j η + γ j η * ,
P c H = j = 1 n η = 1 n P c j η H ,   P o H = j = 1 n η = 1 n P o j η H .
Proof. 
The proof of the general formulas is based on the results of [32], taking into account the separability properties of spectral expansion ns of Gramians. The validity of the formulas of the modal Lyapunov Equations (16)–(19) is established by substituting the formulas into the original Lyapunov equations and taking into account the equalities
P c = i = 1 n j = 1 n P c i j ,   P o = i = 1 n j = 1 n P o i j , P c = i = 1 n P c i , P o = i = 1 n P o i
In [26], the general formulas for computing the spectral expansion of Gramians are derived, which are also applicable to the modal equations of MIMO LTI systems
P c = j = 0 n 1   η = 0 n 1   k = 1 n   ρ = 1 n   1 λ ρ + λ k λ k j λ ρ η N ˙ s k N ˙ s ρ A j B B T ( A η ) T .
P c = j = 0 n 1   ρ = 0 n 1   k = 1 n   λ k j λ k ρ N ˙ λ k N λ k A j B B T A ρ T ,
P o = j = 0 n 1   η = 0 n 1   k = 1 n   ρ = 1 n   1 λ ρ + λ k λ k j λ ρ η N ˙ s k N ˙ s ρ A j C T C ( A η ) T .
P o = j = 0 n 1   ρ = 0 n 1   k = 1 n   λ k j λ k ρ N ˙ λ k N λ k A j C T C A ρ T ,
Above, A j denotes the Faddeev matrices, which are expressed through linear combinations of the products of the coefficients of the characteristic equations and the degree of the dynamics matrix of the system [33,34]. When performing the transformations, it should be taken into account that the residues of the resolvent of the dynamics matrix in its eigenvalues for the diagonal canonical form are strongly simplified: Res ( I s A d ) 1 , λ k = e k e k T . Therefore, Formulas (20)–(23) pass to the following formulas:
P c = j = 0 n 1 η = 0 n 1 k = 1 n ρ = 1 n   1 λ ρ + λ k λ k j λ ρ η N ˙ s k N ˙ s ρ e j B B T e η T . P c = j = 0 n 1 η = 0 n 1 k = 1 n λ k j λ k ρ N ˙ λ k N λ k e j B B T e η T , P o = j = 0 n 1 η = 0 n 1 k = 1 n ρ = 1 n   1 λ ρ + λ k λ k j λ ρ η N ˙ s k N ˙ s ρ e j C T C e η T ,
 □
Theorem 2.
Consider the modal Lyapunov equations for a continuous stationary SISO LTI system in the canonical forms of controllability and observability,
A F P c i j + P c i j A F T = e i e j T , ( A F ) T P o i j + P o i j A F = e i e j T ,
A F P c i + P c i A F T = j = 1 n e i e j T , ( A F ) T P o i + P o i A F = j = 1 n e i e j T ,
Suppose that the system is stable and has a simple spectrum; then, pair (A,B) is controllable, and pair (A,C) is observable.
Then, the modal Gramians of controllability and observability exist and are singular. The modal Gramians of controllability for equations of state in the canonical form of controllability coincide with the Gramians of observability for equations of state in the canonical form of observability. The following decompositions of the Gramian matrices in the form of Hadamard’s products are valid:
P c = Ω ˜ o Ψ ˜ c ,    P o = Ω ˜ o Ψ ˜ o ,
The Hadamard decomposition on the pair and simple spectrum has the form
Ψ ˜ c = i = 1 n j = 1 n e i e j T , Ω ˜ c = k = 1 n ρ = 1 n 1 λ ρ + λ k λ k j λ ρ η N ˙ λ k N ˙ s ρ n × n = k = 1 n λ k j ( λ k ) η N ˙ λ k N λ k n × n
Ψ ˜ o = i = 1 n j = 1 n e i e j T , Ω ˜ o = Ω ˜ c ,
The Hadamard decomposition of the controllability and observability sub-Gramians over a simple spectrum has the form
P c i = j = 1 n Ω ˜ c Ψ ˜ c i j ,   P o i = j = 1 n Ω ˜ o Ψ ˜ o i j .
Hadamard products are invariant under the similarity transformations.
Remark 1.
The upper sign of the wave is used in the matrices of the co-multipliers in the Hadamard decomposition for the modal Gramians of controllability and observability for a continuous stationary SISO LTI system.
Proof. 
The singularity of solutions to modal equations follows from the stability of these equations. The coincidence of the solution matrices of the modal equations follows from the coincidence of the solution matrices of the original equations P c and P o [26]. In this article, analytical expressions of the solution matrices in the form of spectral expansions for a simple spectrum were derived as
P c = P o = k = 1 n j = 0 n 1 η = 0 n 1 λ k k j λ k η N ˙ λ k N λ k 1 j + 1 η + 1 ,
And, for a pair spectrum, in the form
P c = P o = k = 1 n ρ = 1 n j = 0 n 1 η = 0 n 1 1 λ ρ + λ k λ k j λ ρ η N ˙ λ k N ˙ λ ρ   1 j + 1 η + 1 ,
Let us represent the matrix factors of the Hadamard decomposition in the form
Ψ ˜ c = i = 1 n j = 1 n e i e j T   Ψ ˜ o = i = 1 n j = 1 n e i e j T .
We have scalar matrices of multipliers in the form
Ω ˜ o = k = 1 n ρ = 1 n 1 λ ρ + λ k λ k j λ ρ η N ˙ λ k N ˙ s ρ n × n = k = 1 n λ k j ( λ k ) η N ˙ λ k N λ k n × n .
Hence, Formulas (24)–(29) follow. Since multiplier matrices are the known functions of eigenvalues that serve as invariants under similarity transformations, multiplier matrices and Hadamard products are invariants under these transformations. □
Corollary 1.
The controllability and observability Gramians for the equations of state in the canonical forms of controllability and observability are Xiao matrices that are invariants under similarity transformations. The Xiao matrix is positively defined.
Proof. 
The following formulas are valid
P c = Ω ˜ c Ψ ˜ c , P o = Ω ˜ o Ψ ˜ o ,
P c = Ω ˜ c 1 1 1 1 . . 1 1 1 1 1 . . 1 1 1 1 1 . . 1 1 1 1 1 . . 1 1 1 1 1 . . 1 , P o = Ω ˜ o 1 1 1 1 . . 1 1 1 1 1 . . 1 1 1 1 1 . . 1 1 1 1 1 . . 1 1 1 1 1 . . 1 ,
Let us prove the fulfillment of the first property of Xiao matrices (3). The fulfillment for zero elements of matrices is proved in [26]. The alternation of signs of the side diagonal elements passing through diagonal element p j j follows from the sequence of these elements in the form
k = 1 n s k j + 2 ( s k ) j 2 N ˙ s k N 1 s k , k = 1 n s k j + 1 ( s k ) j 1 N ˙ s k N 1 s k , k = 1 n s k j ( s k ) j N ˙ s k N 1 s k , k = 1 n s k j 1 ( s k ) j + 1 N ˙ s k N 1 s k
The fulfillment of property (4) is similarly checked. Since the multiplier matrices are known functions of the eigenvalues, the Xiao matrices are invariant under the similarity transformation. We show the validity of this statement for its controllability Gramians. The transformation matrix R c F can be represented as the product of the Kalman controllability matrix and the Hankel matrix [9,24]
R c F = e n A c F e n A c F n 1 e n H c , H c = a n 1 a 1 a o . . 1 a 1 a o 1 . . 0 a 1 a o 1 0 . . 0 a o 1 0 0 . . 0 1 0 0 0 . . 0 ,
A substitution when calculating the controllability matrix leads to the equality
e n A c F e n A c F n 1 e n = H c 1 .
It follows that the controllability matrix is nondegenerate when transforming state equations into the canonical form of controllability or observability. So the multiplier matrix, which is the Xiao matrix, is positively defined. □
Theorem 3.
Let us consider the spectral decompositions of solutions to the equations of linear continuous stationary MIMO LTI systems. Suppose that the system is stable, matrices A, B, C are real, matrix A has a simple spectrum, the pair (A,B) is controllable, and the pair (A,C) is observable. Then, the following statements are true.
  • Spectral decompositions of its controllability and observability Gramians and controllability or observability sub-Gramians in the form of Hadamard products for the case of pair spectrum of the dynamics matrix have the following form
    P c j η = Ω ˜ c j η Ψ c j η ,   Ψ c j η = A j B B T ( A η ) T , P c = Ω ˜ c Ψ c ,
    Ω ˜ c = j = 0 n 1 η = 0 n 1 Ω ˜ c j η = j = 0 n 1 η = 0 n 1 ω ( n , λ k , λ ρ , j , η ) e j + 1 e η + 1 T
    ω n , λ k , λ ρ , j , η = k = 1 n ρ = 1 n 1 λ ρ + λ k λ k j λ ρ η N ˙ λ k N ˙ λ ρ , Ψ c j η = ν = 1 n μ = 1 n β ν μ ( j η ) e ν e μ T ,
    e ν A j B B T ( A η ) T e μ T = β ν μ ( j η ) n × n , e ν A j T C T C A η e μ T = γ ν μ ( j η ) n × n ,
    Ψ c = j = 0 n 1 η = 0 n 1 ν = 1 n μ = 1 n β ν μ ( j η ) e ν e μ T
  • For the case of the decomposition of the controllability Gramian by a simple spectrum of the dynamics matrix in the form of Hadamard products, we obtain the same Formulas (32)–(35), except for the formulas of the multiplier matrix  Ω ˜ c , which takes the form
    Ω ˜ c = j = 0 n 1 η = 0 n 1 Ω ˜ c j η = j = 0 n 1 η = 0 n 1 ω ( λ k , λ k , j , η ) e j + 1 e η + 1 T
    ω ( λ k , λ k , j , η ) = k = 1 n λ k j ( λ k ) η N ˙ λ k N λ k
  • Exactly the same formulas as (31)–(35) are valid for the observability Gramians in the form of Hadamard products. Only the formulas for the matrices Ψo are changing:
    P o = Ω ˜ c Ψ o ,   Ψ o = j = 0 n 1 η = 0 n 1 ν = 1 n μ = 1 n γ ν μ j η e ν e μ T .
  • The Hermite component of the controllability and observability Gramians has the form [2]
    P c H = 1 2 P c + P c * ,   P o H = 1 2 P o + P o * ,
    P c j η H = 1 2 P c j η + P c j η * ,   P o j η H = 1 2 P o j η + P o j η * ,
Spectral decompositions of the Hermite components of the controllability and observability Gramians have the form of Hadamard matrices
P c j η H = Ω c j η H Ψ c j η H ,   P o j η H = Ω o j η H Ψ o j η H ,
Ω c j η H = j = 0 n 1 η = 0 n 1 R e [ ω ( n , λ k , λ ρ , j , η ) ] e j + 1 e η + 1 T      = j = 0 n 1 η = 0 n 1 R e [ ω ( n , λ k , λ k , j , η ) ] e j + 1 e η + 1 T ,
Ψ c j η H = 1 2 A j B B T A η T + A η B B T A j T , Ψ o j η H = 1 2 A j T C T C A η + A η C T C A j T ,
Ψ o j η H = 1 2 A j T C T C A η + A η C T C A j T , Ω o j η H = j = 0 n 1 η = 0 n 1 R e [ ω ( n , λ k , λ ρ , j , η ) ] e j + 1 e η + 1 T ,
Ψ o j η H = 1 2 A j T C T C A η + A η C T C A j T , P c H = j = 1 n η = 1 n P c j η H ,   P o H = j = 1 n η = 1 n P o j η H ,
P c H = j = 1 n η = 1 n P c j η H , P o H = j = 1 n η = 1 n P o j η H ,
The multiplier matrices in all Gramian decompositions are Xiao matrices.
Proof. 
Let us return to the general formulas for Gramian spectral expansions (20)–(23). Let us first consider pairwise Gramian spectral expansions. We divide the summation indices into two groups: the first group covers the summation over the “j,η” indices of the resolvent decompositions into Faddeev series, and the second group covers the summation of the “j,η” indices over the pair spectrum. Let us distinguish the controllability sub-Gramian P c j η and represent its spectral decomposition as
P c j η = Ω ˜ c j η Ψ c j η ,   Ψ c j η = A j B B T ( A η ) T
Ω ˜ c = j = 0 n 1 η = 0 n 1 Ω ˜ c j η = j = 0 n 1 η = 0 n 1 ω ( n , λ k , λ ρ , j , η ) e j + 1 e η + 1 T
ω ( n , λ k , λ ρ , j , η ) = k = 1 n ρ = 1 n 1 λ ρ + λ k λ k j λ ρ η N ˙ λ k N ˙ λ ρ .
Taking into account the designation
e ν A j B B T ( A η ) T e μ T = β ν μ ( j η ) n × n , e ν A j T C T C A η e μ T = γ ν μ ( j η ) n × n ,
we have
Ψ c j η = ν = 1 n μ = 1 n β ν μ ( j η ) e ν e μ T
Taking into account the previous calculations, we obtain the spectral decomposition of the controllability Gramian of the system in the form
P c = Ω ˜ c Ψ c ,   Ψ c = j = 0 n 1 η = 0 n 1 ν = 1 n μ = 1 n β ν μ ( j η ) e ν e μ T
Repeating similar reasoning for the case of the decomposition of the controllability Gramian over the simple spectrum of the dynamics matrix, we obtain the same Formulas (47)–(51) as in the previous case, except for the formulas for the matrix Ω ˜ c
Ω ˜ c = j = 0 n 1 η = 0 n 1 Ω ˜ c j η = j = 0 n 1 η = 0 n 1 ω ( λ k , λ k , j , η ) e j + 1 e η + 1 T
ω ( n , λ k , λ k , j , η ) = k = 1 n λ k j ( λ k ) η N ˙ λ k N λ k .
In [27], it is proved that the multiplier matrices Ω ˜ c are Xiao matrices. They coincide with Formulas (27) and (28) of Theorem 2. It is easy to find that exactly the same formulas are true for the observability Gramian’s multipliers if the conditions of the theorem are preserved. Only the formulas for the matrices Ψ o are changing
P o = Ω ˜ c Ψ o ,   Ψ o = j = 0 n 1 η = 0 n 1 ν = 1 n μ = 1 n γ ν μ ( j η ) e ν e μ T .
Note that the developed method and algorithms for computing Gramians in the form of Hadamard products provide a convenient way to compute and subsequently analyze elements of Gramian matrices, which is an advantage when computing diagonal elements and traces of Gramians and sub-Gramians as well as spectral decompositions of energy functionals [31].
In all the cases discussed above, we are talking about the complex Gramians and sub-Gramians of controllability and observability. Under the conditions of the theorem, the controllability and observability Gramians are always real matrices, but the sub-Gramians can be complex. As can be seen from the last expressions, when calculating the Hermite components of the Hadamard products of sub-Gramians, we obtain the formulas
P c j η H = 1 2 P c j η + P c j η * ,   P o j η H = 1 2 P o j η + P o j η * ,
Therefore, the matrix part of the sub-Gramians in the form of the Hadamard product becomes a symmetric matrix, and its multiplier matrix becomes a real matrix. As a result of these transformations, we obtain Formulas (41)–(46). □

4. Spectral Expansions of Solutions to Sylvester Differential Equations on a Finite Interval

Let us consider two linear stationary continuous MIMO LTI dynamic systems of the form
x ˙ t = A x t + B u t , x 0 = 0 ,
y t = C x t ,
where x t R n , u t R d , y t R d . We consider real matrices of corresponding sizes A,B,C. Let us assume that system (53) is stable, unless otherwise stated, completely controllable, and observable, and all eigenvalues of matrix A are different.
x m t = A m x m t + B m u t , x m 0 = 0 ,
y m ( t ) = C m x m ( t ) ,
where x m t R n 1 , u t R d , y m t R d . We consider real matrices of corresponding sizes A, B, C, A m , B m , C m . Let us assume that system (54) is stable, unless otherwise stated, completely controllable, and observable, and all eigenvalues of matrix A m are different and do not coincide with the eigenvalues of matrix A. Following [27], consider the following continuous differential equations associated with these systems of the form
d P ( t ) d t = A P t + P t A T + R ,   P 0 = 0 n × n ,
d P ( t ) d t = A m P t + P t B m + R 1 ,   P 0 = 0 n × n ,
where R 1 is a real matrix of size (n × n 1 ). This section focuses on the Sylvester differential equation. The main method for constructing a solution and its spectral expansions is operational calculus and the expansion of the resolvents of dynamics matrices A m and B m into the Faddeev–Leverrier series. The latter have the form [33,34]
( I s A m ) 1 = j = 0 n 1 A m j s j N m ( s ) 1 ,   A m j = i = j + 1 n a m i A m i j + 1 , ( I s B m ) 1 = j = 0 n 1 B m j s j N m ( s ) 1 ,   B m j = i = j + 1 n 1 b m i B m i j + 1 ,
where A m j , B m j are Faddeev matrices constructed for resolvent matrices A m ,   B m using the Faddeev–Leverrier algorithm; N m s , N m 1 s —are the characteristic polynomials of matrices A m , B m ;   a m i , b m i are the coefficients of these polynomials.
The first method for spectral expansions of solutions to Sylvester differential equations is based on the following lemma:
Lemma 1
([32]). Let us consider solving equations on a finite interval [0,t) ∈ [0,T]. Let us assume that systems (53) and (54) are stable, matrices A m , B m , R, R 1 are real, matrices A m , B m have a simple spectrum, their eigenvalues s k , s ρ are different, they do not belong to the imaginary axis of the eigenvalue plane, and the conditions are valid.
s k + s ρ 0 ,   k = 1 , n ¯ ;   ρ = 1 , n ¯ ;   s k s p e c   A m ,   s ρ s p e c   B m .
Let us transform the dynamics matrices to diagonal form
A m d = d i a g s k = Q 1 A m Q 1 1 ,   B m d = d i a g s ρ = Q 2 B m Q 2 1 ,
where Q 1 ,   Q 2 are matrices of dimensions [n × n] u [ n 1 × n 1 ].
Then, the Sylvester differential equation solution on finite interval [0,t) 0 ,   T has the form
P d t = p d j η ( t ) , p d j η t = r d j η e s j + s η t s j + s η + p d j η ,   p d j η = r d j η s j + s η , P t = Q 1 1 P d t ( Q 2 T ) 1 .
The second method of spectral decompositions of solutions to the Sylvester differential equations is based on using the Laplace transform to compute the Lyapunov integral and decomposing the resolvents of dynamics matrices A m and B m into a Faddeev–Leverier series.
Theorem 4.
Let us consider spectral expansions of solutions to Sylvester differential equations for MIMO LTI systems (53) and (54). Let us assume that these systems are stable, matrices Am, Bm and R1 are real, have a simple spectrum, their eigenvalues s m k , s m ρ are different, they do not belong to the imaginary axis of the eigenvalue plane, and the conditions are met.
s m k + s m ρ 0 ,   k = 1 , n ¯ ;   ρ = 1 , n 1 ¯ ;   s m k s p e c   A m ,   s m ρ s p e c   B m .
Then, the following statements are true.
  • Spectral expansions of solutions to Sylvester differential Equation (56) in the form of Hadamard products for the case of the combination spectrum of dynamics matrices have the form
    P j η ( t ) = Ω j η ( t ) Ψ j η ,   Ψ j η = A m j R 1 B m η ,
    P j η t = k = 1 n ρ = 1 n 1 s m k j s m ρ η N ˙ s m k N ˙ s m ρ 1 exp s m k + s m ρ t s m k + s m ρ A m j R 1 B m η ,
    Ω j η t = k = 1 n ρ = 1 n 1 s m k j s m ρ η N ˙ s m k N ˙ s m ρ 1 exp s m k + s m ρ t s m k + s m ρ , P t = Ω t Ψ , Ψ = j = 0 n 1 η = 0 n 1 1 A m j R 1 B m η ,
    Ω t = k = 1 n ρ = 1 n j = 0 n 1 η = 0 n 1 1 s m k j s m ρ η N ˙ s m k N ˙ s m ρ   1 exp s m k + s m ρ t s m k + s m ρ e j e η T .
  • For the case of the expansion of solutions to Sylvester’s differential equations over the simple spectrum of the dynamics matrix, the same Formulas (57) and (58) are valid, but with new multiplier matrices:
    P j η t = k = 1 n s m k j ( s m k ) η N ˙ s m k N 1 s m k ( exp s m k t 1 ) A m j R 1 B m η = Ω j η ( t ) Ψ j η
    Ω j η t = k = 1 n s m k j ( s m k ) η N ˙ s m k N 1 s m k ( exp s m k t 1 ) ,   Ψ j η = A m j R 1 B m η ,
    P t = Ω t Ψ ,   Ψ = j = 0 n 1 η = 0 n 1 1 A m j R 1 B m η
    Ω t = k = 1 n j = 0 n 1 η = 0 n 1 1 s m k j ( s m k ) η N ˙ s m k N 1 s m k ( exp s m k t 1 )
The Hermitian component of spectral expansions of solutions to the Sylvester equations has the form
P H ( t ) = 1 2 P ( t ) + P * ( t ) ,   P j η H ( t ) = 1 2 P j η ( t ) + P j η * ( t ) ,
where the spectral decompositions of matrices P , P * ,   P j η ,   P j η * are determined by Formulas (59)–(62).
Proof. 
The solution to the differential equation (56) is an integral of the form [1,3]:
P ( t ) = o t e A m τ R e B m τ d τ .
Let us apply the Laplace transform to both sides of the equation, considering the initial conditions to be zero and using the theorem on the Laplace transform of the product of real functions of time, the image of which is a fractional–rational algebraic fraction. In our case, this fraction contains one zero pole, and all other poles are simple. In this case, the direct transformation has the form
f ( s ) s F ( s ) = f ( 0 ) s F ( 0 ) + i = 1 q f ( s i ) s i F ( s i ) ,
where functions f ( 0 ) s F ( 0 ) a n d   F s have the form
f ( 0 ) s F ( 0 ) = 1 s k = 1 n ρ = 1 n 1 j = 0 n 1 η = 0 n 1 1 1 s m k + s m ρ s m k j s m ρ η N ˙ s k N ˙ s m ρ A m j R 1 B m η , F s = k = 1 n ρ = 1 n 1 j = 0 n 1 η = 0 n 1 1 1 s m k + s m ρ s m k j s m ρ η N ˙ s m k N ˙ s m ρ 1 s s m k s m ρ .
Substituting these expressions into (63), we obtain an image of the expansion of the solution to Sylvester’s differential Equation (56), in terms of the combination spectrum of the dynamics matrices, in the form
P s = k = 1 n ρ = 1 n 1 j = 0 n 1 η = 0 n 1 1 1 s m k + s m ρ s m k j s m ρ η N ˙ s m k N ˙ s m ρ   A m j R 1 B m η + k = 1 n ρ = 1 n 1 j = 0 n 1 η = 0 n 1 1 1 s m k + s m ρ s m k j s m ρ η N ˙ s m k N ˙ s m ρ   A m j R 1 B m η 1 s s m k s m ρ .
Having performed the inverse transformation, we obtain the spectral expansion of the solution to the Sylvester differential Equation (56), in the combination spectrum of the dynamics matrices, in the time domain:
P j η t = k = 1 n ρ = 1 n 1 s m k j s m ρ η N ˙ s m k N ˙ s m ρ 1 s m k + s m ρ A m j R 1 B m η = Ω j η t Ψ j η ,
Ω j η ( t ) = k = 1 n ρ = 1 n 1     s m k j s m ρ η N ˙ s k N ˙ s m ρ exp ( s m k + s m ρ ) t 1 s m k + s m ρ , Ψ j η = A m j R 1 B m η ,
Ω t = k = 1 n ρ = 1 n 1 j = 0 n 1 η = 0 n 1 1 s m k j s m ρ η N ˙ s m k N ˙ s m ρ s m k j s m ρ η   N ˙ s m k N ˙ s m ρ exp ( s m k + s m ρ ) t 1 s m k + s m ρ e j e η T ,
P t = Ω t Ψ ,
Equality (64) expresses the spectral expansion of the Sylvester differential equations’ solutions in the combination spectrum of matrices A m and B m . This proves the first statement of the theorem.
Using the identity
k = 1 n ρ = 1 n 1 1 s m k + s m ρ s m k j s m ρ η N ˙ s m k N ˙ s m ρ k = 1 n s m k j ( s m k ) η N ˙ s m k N s m k
one can obtain similar expansions for the simple spectrum of matrix A m :
P j η t = k = 1 n s m k j ( s m k ) η N ˙ s m k N 1 s m k ( exp s m k t 1 ) A m j R 1 B m η = Ω j η ( t ) Ψ j η , Ω j η t = k = 1 n s m k j ( s m k ) η N ˙ s m k N 1 s m k ( exp s m k t 1 ) = Ω j η ( t ) Ψ j η , Ψ j η = A m j R 1 B m η , P t = Ω t Ψ ,
Ψ = j = 0 n 1 η = 0 n 1 A m j R 1 B m η ,
The resulting expansions prove the second statement of the theorem. The third statement follows from statements 1 and 2. Equality (66) expresses the spectral expansion of solutions to the Sylvester equations in the simple spectrum of matrix A m . □
Let us apply the results of the theorem to the calculation of spectral decompositions of the finite cross-Gramian of a continuous stable MIMO LTI system,
x ˙ t = A x t + B u t , x 0 = 0 ,
y t = C x t ,
which is a solution to the simple Sylvester differential equation
d P ( t ) d t = A P t + P t A + B C , P ( 0 )   = 0 .
Corollary 2.
Let us consider the spectral expansions of solutions to Sylvester differential equations and renumber for the MIMO LTI system (69). Let us assume that the system is stable, matrix A, B and C, are real, their dimensions have been harmonized, matrix A has a simple spectrum, and the conditions are met.
s k + s ρ 0 , k = 1 , n ¯ ; s k s p e c   A .
Then the following statements are true.
  • The spectral decomposition of the cross-Gramian image has the form
    P ( s ) = k = 1 n ρ = 1 n j = 0 n 1 η = 0 n 1 1 s k + s ρ s k j s ρ η N ˙ s k N ˙ s ρ   A j B C A η 1 s s k s ρ
  • The spectral decomposition of the cross-Gramian over the pair spectrum of matrix A in the time domain has the form
    P ( t ) = k = 1 n ρ = 1 n j = 0 n 1 η = 0 n 1 1 s k + s ρ s k j s ρ η N ˙ s k N ˙ s ρ exp ( s k + s ρ ) t 1 s k + s ρ
    The Hadamard decomposition for a finite cross-Gramian has the form
    P ( t ) = Ω c r t Ψ c r ,   Ω c r t Ω c r t = k = 1 n ρ = 1 n j = 0 n 1 η = 0 n 1 s k j s ρ η N ˙ s k N ˙ s ρ   A j B C B j exp ( s k + s ρ ) t 1 s k + s ρ Ψ c r = j = 0 n 1 η = 0 n 1 A j B C B η ,
  • The diagonal terms and trace of the cross-Gramian have the for
    p j j t = k = 1 n ρ = 1 n s k j 1 s ρ j 1 N ˙ s k N ˙ s ρ e s k + s ρ t 1 s k + s ρ A j 1 B C A j 1 ,     j = 1 , n ¯ . t r P ( t ) = t r k = 1 n ρ = 1 n j = 0 n 1 s k j s ρ j N ˙ s k N ˙ s ρ exp s k + s ρ t 1 s k + s ρ A j B C A η .
Example 1.
Let us consider the linear stationary continuous SISO LTI dynamic system of the form
x ˙ t = A x t + B u t , x 0 = 0 ,
y t = C x t ,
where
A = 0.5 0 0 1 ,   b = 0.5 1 ,   c = 0 1 .
Let us, then, obtain spectral expansions of the cross-Gramian in Hadamard form for the system (70). In this case, it is possible to calculate the expressions:
N s = a 2 s 2 + a 1 s + a 0 = s s 1 s s 2 , s 1 = 0.5 ,   s 2 = 1 , a 2 = 1 ,   a 1 = 1.5 ,   a 0 = 0.5 ,
N ˙ s = 2 s + 1.5 , I s A 1 = A 1 s + A 0 ,   N 1 s , s + 5 0 0 s + 1 1 = s + 1 0 0 s + 0.5 N 1 s ,
A 1 = 1 0 0 1 ,   A 0 = 1 0 0 0.5 , b c = 0 0.5 0 1 , N ˙ s 1 = 0.5 ,   N ˙ s 2 = 0.5 ,   N s 1 = 1.5 ,
N s 2 = 3 ,
A P + P A + b c = 0 , d P d t = A P + P A + b c , P ( 0 ) = 0 , P = j = 0 n 1   η = 0 n 1   k = 1 n   s k j s k η N ˙ s k N s k A j b c A η ,
Ψ 00 = A 0 b c A 0 = 0 0.25 0 0.25 ,   Ψ 01 = A 0 b c A 1 = 0 0.5 0 0.5 ,
Ψ 10 = A 1 b c A 0 = 0 0.25 0 0.5 ,   Ψ 11 = A 1 b c A 1 = 0 0.5 0 1 .
Let us calculate multiplier matrices Ω j η = k = 1 2 ω ( 1 , s k , s k , j , η ) e j + 1 e η + 1 T ,   k = 1,2 .
ω 1 , s 1 , s 1 , j , η : ω 1 , s 1 , s 1 , 0,0 = 4 3 ,   ω 1 , s 1 , s 1 , 1,0 = 2 3 , ω 1 , s 1 , s 1 , 0,1 = 2 3 ,   ω 1 , s 1 , s 1 , 1,1 = 1 3 , ω 1 , s 2 , s 2 , j , η : ω 1 , s 2 , s 2 , 0,0 = 2 3 ,   ω 1 , s 2 , s 2 , 1,0 = 2 3 , ω 1 , s 2 , s 2 , 0,1 = 2 3 ,   ω 1 , s 2 , s 2 , 1,1 = 2 3 .
Finally, we obtain the spectral decomposition of the cross-Gramian in Hadamard form:
P j η = Ω j η   Ψ j η ,
Ω 00 = 2 3 1 1 1 1   Ω 01 = 0 ,   Ω 10 = 0 ,   Ω 11 = 1 3 1 1 1 1 .
P = 0 1 3 0 1 2 .
It is easy to see that this matrix is a solution to the original algebraic Sylvester equation. Note that the multiplier matrix is the Xiao matrix. Let us proceed to consider solutions to the Sylvester differential equations that are finite cross-Gramians. Consider spectral decompositions of cross-Gramians over the simple spectrum of the dynamics matrix A. For this purpose, we use Formulas (59)–(62).
P j η t = Ω j η   t Ψ j η , Ω j η   t = k = 1 2 { ω ( 1 , s k , s k , j , η ) 1 exp s k t } e j + 1 e η + 1 T ,
Ω 00 t = 2 3 k = 1 2 1 exp s k t e 1 e 1 T = 2 3 4 3 exp 0.5 t 2 3 exp t ,
Ω 01 t = 0 , Ω 10 t = 0 ,
Ω 11 t = 1 3 k = 1 2 1 exp s k t e 2 e 2 T = 1 3 + 1 3 exp 0.5 t 2 3 exp t ,
Finally, we obtain the formulas of the finite cross-Gramian in Hadamard form:
P t = j = 0 1 η = 0 1 ω ( 1 , s 1 , s 1 , j , η 1 exp s 1 t + ω ( 1 , s 2 , s 2 , j , η 1 exp s 2 t A j b c A η .
The matrices of multipliers of finite cross-Gramians preserve the structure of Xiao matrices of infinite controllability and observability Gramians (zero plaid structure [23,24,25]), but their elements depend not only on the eigenvalues of the dynamics matrix but also on time. Therefore, such matrices can be called generalized Xiao matrices, in contrast to the controllability and observability Gramians defined in [23,24,25].
Limit formulas are valid for the elements of matrices multipliers of finite and infinite cross-Gramians defined by Formula (72):
lim t Ω j η   t = Ω j η   ,   i , j = 1,2 ¯ ,   t 0 , .
Note that, unlike the controllability and observability Gramians of the original system, the cross-Gramians matrix is not symmetric, although the matrices of their multipliers are symmetric.

5. Conclusions

This paper shows that the Gramians’ Hadamard decomposition and their multiplier matrices play an important role in the problems of analyzing structural properties for a wide class of continuous linear dynamical systems given by their different equations of state. In the Introduction, we noted the important role of the scientific direction of works [22,23,24,25,26,27] based on the use of Rouse tables and Xiao matrices to compute finite and infinite Gramians by transforming the equations of state into canonical forms. Let us discuss the question, what is the difference between the methods and algorithms developed in this paper and those of the first direction? In [23], iterative procedures for computing solutions to algebraic Lyapunov equations using elements of Rouse tables and coefficients of the system’s characteristic equation, leading to a Gramian representation in the form of Xiao matrices, are proposed. The methods and algorithms developed in this paper are based on direct methods for computing Gramian elements in closed form, for which Hadamard products and expansions of the resolvent dynamics matrix into the Faddeev–Leverrier series are used. Spectral expansions of infinite Gramians for the cases of simple and pair spectra were first obtained in the monograph [1]. In the monograph [25], there appeared formulas for computing the elements of the controllability Gramian for a system in which the equations of state are represented in diagonal canonical form. A similar result was previously obtained, by a different method in [32], for computing the controllability and observability Gramians in a broader setting, taking into account the multiplicity of the eigenvalues of the dynamics matrix. It is shown that Gramian matrices are pseudo-Hankel matrices—Xiao matrices. The advantages of this approach are obvious:
  • Rouse tables are easier to compute compared to computing the eigenvalues of the matrix;
  • the computation of Gramians using spectral decompositions leads to cumbersome expressions for the multiple spectra of the dynamics matrix, which makes it problematic to apply this method for high-dimensional systems, while in the first direction such problems do not arise;
  • the computation of inverse controllability Gramians is reduced to solving systems of linear algebraic equations [24];
  • the method can be used not only to compute Gramians but also to analyze the stability of the system according to the Rouse–Gurwitz criterion.
The disadvantage of the method is its limited application: it is recommended for use in systems of small and medium dimensionalities [24]. The works of the first direction did not use the Hadamard decomposition of Gramian matrices, the decomposition of the resolvent of the dynamics matrix into the Faddeev–Leverrier series, or the Laplace transform for computing Gramians. The results obtained in this paper also present a new method for computing Xiao matrices in closed form based on the information of the spectrum of the dynamics matrix and its characteristic equation. The decomposition of the Hadamard for Gramians and cross-Gramians of continuous systems given by equations of state in basic canonical forms changes the very paradigm of computation from the computation of matrices to the computation of their elements. This is a useful technique for computing the Gramians of weakly filled dynamics matrices and computing mixed Gramians for unstable systems [35]. Another advantage of the Hadamard decomposition: the proposed method gets rid of Faddeev matrices in spectral decompositions by transforming the equations of state into canonical forms of controllability and observability. The disadvantage of the second direction method compared to the first one is the cumbersome formulas of Gramian spectral decompositions for the case of the multiple spectra of the dynamics matrix. New possibilities of Gramian computation by using canonical transformations into diagonal, controllable, and observable canonical forms are shown in this article. In this case, Gramian matrices can be represented as the Hadamard product matrices of the multiplier matrices and matrices of the transformed right-hand side of the Lyapunov equations. It is shown that the multiplier matrices are invariant under various canonical transformations of linear continuous systems. We obtain modal Lyapunov equations for continuous SISO LTI systems in diagonal form and new algorithms for the elementwise computation of Gramian matrices for stable continuous MIMO LTI systems. We develop new algorithms for the computation of controllability Gramians and their traces in the form of Hadamard products of Xiao matrices for continuous SISO LTI systems in controllable and observable canonical forms. The use of transformations into canonical forms of controllability and observability made it possible to simplify the formulas of spectral decompositions in the form of Xiao matrices and simplify the calculations of Gramians. This article obtains new spectral expansions in Hadamard form for solutions to algebraic and differential Sylvester equations and spectral expansions of finite and infinite cross-Gramians of continuous MIMO LTI systems. The obtained results can be used for the optimal selection of locations for sensors and actuators in multivariable control systems and dynamic networks, for calculations and analysis of empirical Gramians, for assessing the risk of loss of stability in electric power systems, and in problems of analysis and synthesis of modal control systems [23].

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Data are contained within the article.

Conflicts of Interest

The author declares no conflict of interest.

Nomenclature

SISO LTI systema linear time invariant system with one input and one output
MIMO LTI systema linear time invariant system with many inputs and many outputs
Xiao matrixa pseudo-Hankel matrix depending on the coefficients of the characteristic polynomial of the dynamics matrix [23,24]
Faddeev matrixa matrix arising from the decomposition of the resolvent of the dynamics matrix of a linear dynamical system [33,34]
Faddeev’s seriesa recursive method for computing the coefficients of the characteristic polynomial of a matrix [33,34]
Kalman controllability matrixa matrix used in Kalman decomposition to transform the system state equations into the canonical form of controllability [8,9]
Gramiana matrix that is a solution of a special kind of Lyapunov equation [1]
Sub-Gramiana matrix that is a summand of the sum of matrices in the spectral decomposition of the Gramian matrix [1,4,6]
Hadamard’s producta matrix whose every element is the product of the corresponding elements of the input matrices (wiki) [2,4,6]
Hermite componenta matrix that is a complex square matrix equal to its conjugate transpose matrix [2]

References

  1. Antoulas, A.C. Approximation of Large-Scale Dynamical Systems; SIAM Press: Philadephia, PA, USA, 2005. [Google Scholar]
  2. Horn, R.A.; Johnson, C.R. Matrix Analysis; Cambridge University Press: Cambridge, UK, 1984. [Google Scholar]
  3. Polyak, B.T.; Khlebnikov, M.V.; Rapoport, L.B. Theory of Automatic Control; Textbook; LENAND: Moscow, Russia, 2019; 504p. (In Russian) [Google Scholar]
  4. Zubov, N.E.; Zybin, E.Y.; Mikrin, E.A.; Misrikhanov, M.S.; Ryabchenko, V.N. General analytical forms of the solution of the Sylvester and Lyapunov equations for continuous and discrete dynamic systems. J. Comput. Syst. Sci. Int. 2017, 56, 1–18. [Google Scholar] [CrossRef]
  5. Ikramov, K.D. Numerical Solution of Matrix Equations; Faddeev, D.K., Ed.; Nauka: Moscow, Russia, 1984. (In Russian) [Google Scholar]
  6. Benner, P.; Damm, T. Lyapununov equations, Energy Functionals and Model Order Reduction of Bilinear and Stochastic Systems. SIAM J. Control Optim. 2011, 49, 686–711. [Google Scholar] [CrossRef]
  7. Andreev, Y.N. Control of Finite-Dimensional Linear Objects; Nauka: Moscow, Russia, 1976; 424p. (In Russian) [Google Scholar]
  8. Gantmacher, F.R. The Theory of Matrices; Chelsea Publishing Company: New York, NY, USA, 1959. [Google Scholar]
  9. Kailath, T. Linear Systems; Prentice-Hall Information and System Sciences Series; Prentice Hall: New York, NY, USA, 1980. [Google Scholar]
  10. Simoncini, V. Computational methods for linear matrix equations. SIAM Rev. 2014, 58, 377–441. [Google Scholar] [CrossRef]
  11. Tynda, A.N.; Sidorov, D.N. Inverse Problem for the Integral Dynamic Models with Discontinuous Kernels. Mathematics 2022, 10, 3945. [Google Scholar] [CrossRef]
  12. Himpe, C. The Empirical Gramian Framework. Algorithms 2018, 11, 91. [Google Scholar] [CrossRef]
  13. Krasnova, S.A.; Utkin, V.A. Cascade Synthesis of State Observers of Dynamic Systems; Nauka Publishing House: Moscow, Russia, 2006; 272p. (In Russian) [Google Scholar]
  14. Lindmark, G.; Altafini, C. A driver mode selection strategy for minimizing the control energy for complex networks. IFAC-PapersOnLine 2018, 50, 8309–8314. [Google Scholar] [CrossRef]
  15. Dilip, A.S.A. The controllability Gramian, the Hadamard product and the optimal actuator/leader and sensor selection problem. Nat. Phys. 2015, 11, 779–786. [Google Scholar] [CrossRef]
  16. Casadei, G.; Wit, C.C.D.; Zampieri, S. Model Reduction Based Approximation of the Output Controllability Gramians in Large-Scale Networks. IEEE Trans. Control. Netw. Syst. 2020, 7, 1778–1788. [Google Scholar]
  17. Pasqualetti, F.; Zampieri, S.; Bullo, F. Controllability metrics, limitations and algorithms for complex networks. In Proceedings of the 2014 American Control Conference, Portland, OR, USA, 4–6 June 2014; pp. 3287–3292. [Google Scholar] [CrossRef]
  18. Poolla, B.K.; Bolognani, S.; Dörfler, F. Optimal Placement of Virtual Inertia in Power Grids. arXiv 2021, arXiv:1510.01497v5. [Google Scholar] [CrossRef]
  19. Bakhtadze, N.N.; Novikov, D.A.; Elpashev, D.V.; Suleikin, A.S. Integrated Resource Management in the Digital Ecosystem of the Enterprise Based on Intelligent Consorts. IFAC-PapersOnLine 2022, 55, 2330–2335. [Google Scholar]
  20. Kumar, R.; Khan, M. Pole placement techniques for active vibration control of smart structures: A feasibility study. J. Vib. Acoust. 2007, 125, 601–615. [Google Scholar] [CrossRef]
  21. Solodusha, S.; Bulatov, M. Integral equations related to volterra series and inverse problems: Elements of theory and applications in heat power engineering. Mathematics 2021, 9, 1905. [Google Scholar] [CrossRef]
  22. Sreeram, V.; Agathoklis, P. Solution of Lyapunov equation with system matrix in companion form. IEE Proc. D Control Theory Appl. 1991, 138, 529–534. [Google Scholar] [CrossRef]
  23. Xiao, C.S.; Feng, Z.M.; Shan, X.M. On the Solution of the Continuous-Time Lyapunov Matrix Equation in Two Canonical Forms. IEE Proc.-D 1992, 139, 286–290. [Google Scholar] [CrossRef]
  24. Hauksdottir, A.S.; Sigurdsson, S.P. The continuous closed form controllability Gramian and its inverse. In Proceedings of the 2009 American Control Conference Hyatt Regency Riverfront, St. Louis, MO, USA, 10–12 June 2009; pp. 5345–5351. [Google Scholar] [CrossRef]
  25. Mehr, F. Determination of Design of Optimal Actuator Location Based on Control Energy; University of London: London, UK, 2018. [Google Scholar]
  26. Yadykin, I.B. Spectral Decompositions of Gramians of Continuous Stationary Systems Given by Equations of State in Canonical Forms. Mathematics 2022, 10, 2339. [Google Scholar] [CrossRef]
  27. Tuo, M.; Li, X. Optimal Allocation of Virtual Inertia Devices for Enhancing Frequency Stability in Low-Inertia Power Systems. In Proceedings of the 2021 North American Power Symposium (NAPS), College Station, TX, USA, 14–16 November 2021; pp. 1–6. [Google Scholar] [CrossRef]
  28. Bevrani, H.; Golpîra, H.; Messina, A.R.; Hatziargyriou, N.; Milano, F.; Ise, T. Power system frequency control: An updated review of current solutions and new challenges. Electr. Power Syst. Res. 2021, 194, 107114. [Google Scholar] [CrossRef]
  29. Mir, A.S.; Singh, A.K.; Senroy, N. Robust Observer Based Methodology for Frequency and Rate of Change of Frequency Estimation in Power Systems. IEEE Trans. Power Syst. 2021, 36, 5385–5395. [Google Scholar] [CrossRef]
  30. Golpira, H.; Atarodi, A.; Amini, S.; Messina, A.R.; Francois, B. Optimal Energy Storage System-Based Virtual Inertia Placement: A Frequency Stability Point of View. IEEE Trans. Power Syst. 2022, 35, 4824–4835. [Google Scholar] [CrossRef]
  31. Iskakov, A.B.; Yadykin, I.B. Lyapunov modal analysis and participation factors applied to small-signal stability of power systems. Automatica 2021, 132, 109814. [Google Scholar] [CrossRef]
  32. Yadykin, I.B.; Galyaev, A.A. On the methods for calculation of grammians and their use in analysis of linear dynamic systems. Autom. Remote Control 2013, 74, 207–224. [Google Scholar] [CrossRef]
  33. Hanzon, B.; Peeters, R.L.M. A Faddeev Sequence Method for solving Lyapunov and Sylvester Equations. Linear Algebra Its Appl. 1996, 241–243, 401–430. [Google Scholar] [CrossRef]
  34. Faddeev, D.K.; Faddeeva, V.N. Computational Methods of Linear Algebra; Freeman: San-Francisko, CA, USA, 2016. [Google Scholar]
  35. Yadykin, I.B.; Galyaev, I.A. Spectral Decompositions of Gramians and Energy Metrics of Continuous Unstable Control Systems. Autom. I Telemekhanika 2023, 132–149. (In Russian) [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Yadykin, I. Spectral Decomposition of Gramians of Continuous Linear Systems in the Form of Hadamard Products. Mathematics 2024, 12, 36. https://doi.org/10.3390/math12010036

AMA Style

Yadykin I. Spectral Decomposition of Gramians of Continuous Linear Systems in the Form of Hadamard Products. Mathematics. 2024; 12(1):36. https://doi.org/10.3390/math12010036

Chicago/Turabian Style

Yadykin, Igor. 2024. "Spectral Decomposition of Gramians of Continuous Linear Systems in the Form of Hadamard Products" Mathematics 12, no. 1: 36. https://doi.org/10.3390/math12010036

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