Mathematical Problems in Engineering

Volume 2016, Article ID 2452746, 9 pages

http://dx.doi.org/10.1155/2016/2452746

## Recursive Reduced-Order Algorithm for Singularly Perturbed Cross Grammian Algebraic Sylvester Equation

^{1}Electrical and Computer Engineering Department, Rutgers University, New Brunswick, NJ, USA^{2}Electrical Engineering Department, College of Engineering, University of Basrah, Basrah, Iraq

Received 10 July 2016; Accepted 24 October 2016

Academic Editor: Guangming Xie

Copyright © 2016 Intessar Al-Iedani and Zoran Gajic. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

A new recursive algorithm is developed for solving the algebraic Sylvester equation that defines the cross Grammian of singularly perturbed linear systems. The cross Grammian matrix provides aggregate information about controllability and observability of a linear system. The solution is obtained in terms of reduced-order algebraic Sylvester equations that correspond to slow and fast subsystems of a singularly perturbed system. The rate of convergence of the proposed algorithm is , where is a small singular perturbation parameter that indicates separation of slow and fast state variables. Several real physical system examples are solved to demonstrate efficiency of the proposed algorithm.

#### 1. Introduction

Singularly perturbed systems have multiple time scales corresponding to fast and slow state space variables. For a system with two time scales, the slow time scale is related to the eigenvalues that are close to the imaginary axis and that represent the slow state space variables (slow modes) of the system, while the fast time scale is related to those that are far from the imaginary axis and that represent the fast state space variables (fast modes) of the system. Many algorithms exist in the literature for solving diverse problems related to analysis and control of singularly perturbed linear systems. Fixed point recursive numerical methods were first proposed in [1] and used in [2–4] to solve the closed and open loop optimal control problems. Those methods led thereafter to the Hamiltonian approach, which solves the linear-quadratic optimal control and filtering problem by decomposing the algebraic Riccati equations into pure-slow and pure-fast reduced-order algebraic Riccati equations [5]. The exact decomposition into pure-slow and pure-fast subsystems led to the use of parallel algorithms [6, 7] to solve the algebraic Riccati equation of the linear-quadratic optimal control problem. Moreover, some iterative methods were also used to solve this problem (see, e.g., [8] and the references therein). Most of the previous studies consider solving the algebraic Riccati equation, as it represents the most important equation of the optimal control and filtering problems.

The system under investigation in this paper must be asymptotically stable, controllable, and observable. The test for controllability and observability of the system is usually done separately using the controllability and observability Grammians. In many applications, the reduced-order system is welcome to lower computational complexity. Model order reduction retains only state space variables that are both strongly controllable and strongly observable. This requires investigating the behavior of state space variables and balancing the controllability and observability Grammians, such that they are diagonal and identical. It has been shown in [9] that studying the controllability and observability of the system, separately, can be misleading; a method that directly assesses the combination of the two properties is preferred. Therefore, the cross Grammian matrix was defined in [10] as an alternative approach to the existing controllability and observability Grammian matrices. Unlike the controllability and observability Grammians, the cross Grammian contains information about both controllability and observability of the system.

In this paper, a new recursive algorithm is proposed to solve the algebraic Sylvester equation of linear singularly perturbed systems whose solution defines the cross Grammian matrix. The algorithm is obtained in terms of* reduced-order* algebraic Sylvester equations corresponding to slow and fast subsystems. The solutions of full-order algebraic Sylvester equations for finding the cross Grammian matrix were considered in [11, 12].

The remainder of the paper is organized as follows. Section 2 reviews the controllability, observability, and the cross Grammian matrices. The proposed recursive algorithm is then described in Section 3. In Section 4, several case studies are considered to demonstrate the performance of the proposed algorithm. Then, the conclusions follow in Section 5.

#### 2. The Cross Grammian Matrix

Consider a linear dynamic systemwhere are state variables, are control inputs, and are measured outputs. Assume that system (1) is asymptotically stable, controllable, and observable. Controllability and observability of the system can be measured using the controllability and the observability Grammians defined, respectively, as

For asymptotically stable, controllable, and observable systems, Grammians (2) and (3) are positive definite and represented the solutions of the algebraic Lyapunov equations

Assuming system (1) is square, that is, the number of inputs equals the number of outputs , the cross Grammian matrix was defined in [10] for single-input single-output (SISO) systems asand represented by the solution to the algebraic Sylvester equationIn this context, the Sylvester algebraic equation (6) has a unique solution if and only if and have distinct eigenvalues [13]. Several numerical solutions for the Sylvester equation were proposed in the literature; see, for example, [14–16] and the references therein. The definition in (5) was extended in [17–19] to include multi-input multioutput (MIMO) systems.

Furthermore, for MIMO symmetric systems, the relation between controllability and observability, on the one hand, and the cross Grammian, on the other hand, is given by [20]

#### 3. A Recursive Algorithm for Finding Cross Grammians for Singularly Perturbed Linear Systems

The singularly perturbed structure can be obtained by partitioning the system matrices in (1) as follows [6, 21]:where is a small positive singular perturbation parameter. , , and are constant matrices of appropriate dimensions. Based on the singular perturbation theory [6, 21], a singularly perturbed linear system in the explicit state variable standard form is given bywhere are the slow state variables and are the fast state variables. Assuming that is nonsingular, the eigenvalues of matrix consist of two disjoint groups: one corresponds to the slow subsystem ) and the other corresponds to the fast subsystem ). If the two subsystems have a mixture of slow and fast eigenvalues, then a technique has to be applied to convert the system into its standard singularly perturbed form defined in (9). We will give examples on this case in Sections 4.2 and 4.3.

The nature of the cross Grammian matrix defined in (6) corresponding to the system singularly perturbed form defined in (9) isUsing (8) and (10) in (6), we get the partitioned form of the algebraic Sylvester equation as follows:Setting , we get the following approximate algebraic equations:

The solution of equations (12) is given in terms of the following reduced-order algebraic Sylvester equations corresponding to the slow and fast subsystems:In addition, we have from (12)where To find a unique solution of (13), we impose the following assumption.

*Assumption 1. *Matrices and are asymptotically stable. In consequence, unique solutions of (13)-(14) exist.

Defining the approximation error asand subtracting (12) from (11), we get the following error equations, after some algebra:

From the first equation in (18), we can observe that the unknown errors and are multiplied by a small parameter . A similar situation is in the second and the third equations of (18). Therefore, we propose the following algorithm for solving error equations (18).

##### 3.1. The Proposed Algorithm

Start with and and recursively evaluate

Theorem 2. *Assuming that matrices and are asymptotically stable, algorithm (19) converges to the exact solution of (18) with a rate of convergence ; that is,for and .*

Therefore, the exact solution can be obtained with an accuracy of after performing iterations on the proposed algorithm (19) as follows:

*Proof. *Using Assumption 1, that is, and are asymptotically stable, it can be shown that (19) represents a contraction mapping [22]; that is,Formula (22) will be also valid if Formula (22) implies that algorithm (19) is convergent. Using , for , in (19) and comparing it to (18), it can be seen that algorithm (19) converges to the unique solution of (18).

#### 4. Case Studies

Three case studies are considered to demonstrate the proposed algorithm: a fourth-order aircraft example whose mathematical model is in the explicit singularly perturbed form defined in (9) in which with accuracy of the slow eigenvalues are all contained in the approximate slow subsystem represented by and all fast eigenvalues are contained in the approximate fast subsystem represented by ; a fifth-order chemical plant model given in implicit singularly perturbed form (it has two slow and three fast eigenvalues, but the state variables have to be reordered to achieve explicit singularly perturbed form defined in (9)); a tenth-order hydrogen gas reformer used to provide hydrogen to a fuel cell from hydrogen rich fuels (natural gas, methanol).

##### 4.1. L-1011 Aircraft

Here, we consider the lateral axis equations of the rigid body model of L-1011 aircraft at cruise condition [23]. The state variables are the bank angle, roll rate, yaw rate, and sideslip angle, which are represented in the state vector in the same order. The input vector consists of two variables, the rudder deflection and the aileron deflection , and is given as . The system matrices are given asThe eigenvalues of the matrix are −0.1016, −, and −2.0162. The system is asymptotically stable (all eigenvalues are in the left half plane), controllable, and observable. Moreover, there is only one slow mode with eigenvalue −0.0899, and there are three fast modes with eigenvalues − and −2.1017. The singular perturbation parameter , which is the ratio between the fastest slow eigenvalue and the slowest fast eigenvalue. Solving the algebraic Sylvester’s equation (6), the cross Grammian matrix can be obtained as follows:

Using the proposed algorithm, the initial cross Grammian matrix (first-order approximate solution) is obtained as follows:

Comparing the exact solution to the first-order approximate solution of the cross Grammian matrix by calculating the error norm, we getThen, the cross Grammian matrix is calculated using the proposed recursive algorithm. The error norm at each iteration is shown in Table 1. By taking the error norm, it can be seen that the algorithm converges rapidly to the exact solution.