Relative Gain Array

From HandWiki

The Relative Gain Array (RGA) is a classical widely-used[citation needed] method for determining the best input-output pairings for multivariable process control systems.[1] It has many practical open-loop and closed-loop control applications and is relevant to analyzing many fundamental steady-state closed-loop system properties such as stability and robustness.[2]

Definition

Given a linear time-invariant (LTI) system represented by a nonsingular matrix [math]\displaystyle{ \mathrm{G} }[/math], the relative gain array (RGA) is defined as

[math]\displaystyle{ \mathrm{R} = \Phi (\mathrm{G}) = \mathrm{G} \circ {(\mathrm{G}^{-1})}^T. }[/math]

where [math]\displaystyle{ \circ }[/math] is the elementwise Hadamard product of the two matrices, and the transpose operator (no conjugate) is necessary even for complex [math]\displaystyle{ \mathrm{G} }[/math]. Each [math]\displaystyle{ {i,j} }[/math] element [math]\displaystyle{ \mathrm{R}_{i,j} }[/math] gives a scale invariant (unit-invariant) measure of the dependence of output [math]\displaystyle{ j }[/math] on input [math]\displaystyle{ i }[/math].

Properties

The following are some of the linear-algebra properties of the RGA:[3]

  1. Each row and column of [math]\displaystyle{ \Phi (\mathrm{G}) }[/math] sums to 1.
  2. For nonsingular diagonal matrices [math]\displaystyle{ \mathrm{D} }[/math] and [math]\displaystyle{ \mathrm{E} }[/math], [math]\displaystyle{ \Phi (\mathrm{G}) = \Phi (\mathrm{D} \mathrm{G} \mathrm{E}) }[/math].
  3. For permutation matrices [math]\displaystyle{ \mathrm{P} }[/math] and [math]\displaystyle{ \mathrm{Q} }[/math], [math]\displaystyle{ \mathrm{P}\Phi (\mathrm{G})\mathrm{Q} = \Phi (\mathrm{P} \mathrm{G} \mathrm{Q}) }[/math].
  4. Lastly, [math]\displaystyle{ \Phi (\mathrm{G}^{-1}) = \Phi (\mathrm{G})^T = \Phi {(\mathrm{G}^T)} }[/math].

The second property says that the RGA is invariant with respect to nonzero scalings of the rows and columns of [math]\displaystyle{ \mathrm{G} }[/math], which is why the RGA is invariant with respect to the choice of units on different input and output variables. The third property says that the RGA is consistent with respect to permutations of the rows or columns of [math]\displaystyle{ \mathrm{G} }[/math].

Generalizations

The RGA is often generalized in practice to be used when [math]\displaystyle{ \mathrm{G} }[/math] is singular, e.g., non-square, by replacing the inverse of [math]\displaystyle{ \mathrm{G} }[/math] with its Moore–Penrose inverse (pseudoinverse).[4] However, it has been shown that the Moore–Penrose pseudoinverse fails to preserve the critical scale-invariance property of the RGA (#2 above) and that the unit-consistent (UC) generalized inverse must therefore be used.[5] [6]

References

  1. Bristol, E.H. (1966), "On a new measure of interaction for multivariable process control", IEEE Transactions on Automatic Control 1: 133–134, doi:10.1109/TAC.1966.1098266 
  2. Chen, Dan; Seborg, D.E. (2002), "Relative Gain Array Analysis for Uncertain Process Models", AIChE Journal 48 (2): 302–310, doi:10.1002/aic.690480214 
  3. Johnson, C.R.; Shapiro, H.M. (1986), "Mathematical aspects of the relative gain array (A◦A−T)", SIAM Journal on Algebraic and Discrete Methods 7 (4): 627–644, doi:10.1137/0607069 
  4. van de Wal, M.; de Jager, B. (2001), "A review of methods for input/output selection", Automatica 37 (4): 487–510, doi:10.1016/S0005-1098(00)00181-3 
  5. Uhlmann, Jeffrey (2019), "On the Relative Gain Array (RGA) with Singular and Rectangular Matrices", Applied Mathematics Letters 93: 52–57, doi:10.1016/j.aml.2019.01.031, Bibcode2018arXiv180510312U 
  6. Qasim Al Yousuf, Rafal; Uhlmann, Jeffrey (2021), "On Use of the Moore-Penrose Pseudoinverse for Evaluating the RGA of Non-Square Systems", Iraqi Journal of Computers, Communications, Control & Systems Engineering 3 (21): 89–97, doi:10.33103/uot.ijccce.21.3.8