Next Article in Journal
EPiC: A Four-Valued Evidential Constraint Calculus for First-Order Reasoning
Previous Article in Journal
Hysteresis and Optimal Pricing of Subscriptions with Cancellation Cost
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Stability Conditions in Multiple-Input Multiple-Output Systems

by
Macarena Boix
1,† and
Begoña Cantó
2,*,†
1
Departamento de Matemática Aplicada, Universitat Politècnica de València, 46071 Valencia, Spain
2
Instituto de Matemática Multidisciplinar, Universitat Politècnica de València, 46071 Valencia, Spain
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Axioms 2026, 15(7), 507; https://doi.org/10.3390/axioms15070507
Submission received: 13 May 2026 / Revised: 30 June 2026 / Accepted: 3 July 2026 / Published: 6 July 2026
(This article belongs to the Section Mathematical Analysis)

Abstract

This paper investigates the stabilization of unstable third-order Multiple-Input Multiple-Output (MIMO) systems whose interaction structure is described by a doubly stochastic combined matrix, also known as the Relative Gain Array (RGA). Starting from systems with negative Niederlinski index, we derive necessary and sufficient conditions under which stability can be recovered through diagonal perturbations while preserving the doubly stochastic structure of the combined matrix. By exploiting the canonical representation of matrices associated with a prescribed combined matrix and the invariance properties under diagonal equivalence, the problem is reduced to a structured parametric form that allows a complete algebraic characterization. Special attention is given to perturbations involving the (1, 1) entry and one additional diagonal entry, leading to explicit bounds on the perturbation parameters that guarantee stabilization. The results extend previous papers on diagonal perturbations of combined matrices and provide a constructive method for stabilizing MIMO systems without altering their interaction pattern. Numerical examples illustrate the applicability of the proposed approach.

1. Introduction

The stability of Multiple-Input Multiple-Output (MIMO) systems is an important concept in control theory, systems engineering, industrial process control, and many other areas of engineering and applied science. Many industrial plants are operated using decentralized control architectures because of their simplicity, robustness, ease of maintenance, and low implementation cost [1,2]. In these settings, the stability and interaction structure among inputs and outputs play a crucial role in system performance and controller design. Typical examples include distillation columns, heat-exchanger networks, chemical reactors, and power systems, where significant interactions among control loops are unavoidable.
The Relative Gain Array (RGA) [3], also known in matrix-theoretic terms as the combined matrix, is an essential mathematical tool for analyzing multivariable systems in control engineering. From the work of [3,4], these indices have been extensively used in the analysis of industrial processes, where several manipulated and controlled variables interact through a coupled steady-state gain matrix. This matrix captures the steady-state coupling between inputs and outputs and provides valuable information for pairing decisions and decentralized control design. In particular, the sign of the Niederlinski index provides information regarding the feasibility of decentralized stabilization [5], while the RGA quantifies the degree of interaction among control loops. When the combined matrix is doubly stochastic, it represents a balanced interaction structure in which each input and output contributes uniformly. Preserving this property is often desirable in practical applications, as it reflects intrinsic symmetries and interaction patterns of the system. Several authors, including [6,7,8], have studied the specific algebraic and structural properties of combined and doubly stochastic matrices.
The stability of MIMO systems can be assessed through several criteria, among which the Niederlinski criterion plays a prominent role due to its simplicity and effectiveness [4]. This criterion relates stability to the sign of the Niederlinski index, which depends on the determinant of the system matrix and its diagonal entries. A negative index indicates instability, even when all individual loops are stable, highlighting the importance of interaction effects. From an engineering viewpoint, diagonal perturbations correspond to modifications of local loop dynamics while preserving the interaction structure among subsystems. Such perturbations naturally arise when retuning Proportional–Integral–Derivative (PID) controllers, adjusting valve gains, modifying local actuator sensitivities, or updating controller parameters after plant aging or operating-point changes.
Distillation columns constitute one of the most representative examples; reflux and boilup rates simultaneously affect tray temperatures and product compositions, leading to highly coupled MIMO systems. In such situations, negative Niederlinski indices may indicate difficulties in decentralized control design. Similar situations arise in heat-exchanger networks, where several flow rates influence multiple outlet temperatures simultaneously, and in continuously stirred tank reactors (CSTRs), where interactions between concentration and temperature control loops often generate coupled dynamics. Analogous problems appear in small-signal stability analysis of power systems, where local controller retuning modifies generator damping coefficients while transmission-network couplings remain essentially unchanged.
In practice, replacing the physical plant or modifying its interaction structure is often impossible or prohibitively expensive. Instead, engineers typically improve performance by retuning local controllers, modifying actuator gains, or adjusting damping coefficients, actions that can be mathematically interpreted as diagonal perturbations while preserving the underlying interaction pattern. This naturally raises the following question: under what conditions can stabilization be achieved through diagonal perturbations while maintaining the original interaction structure?
The present paper provides an answer to this question for a class of third-order systems with doubly stochastic combined matrices. In recent years, several works have investigated the interplay between combined matrices and stability properties, as well as the effect of structural transformations such as diagonal equivalence. In particular, diagonal perturbations have been proposed as a mechanism for modifying the properties of the system while preserving certain structural features [9].
This work is closely related to our previous study, where the role of the combined matrix and diagonal equivalence in the analysis of MIMO systems was investigated. While the methodology in both studies shares a similar theoretical foundation, a fundamental distinction in the present paper is the explicit incorporation of perturbations involving the ( 1 , 1 ) entry together with an additional diagonal element. This specific setting prevents the direct use of the canonical matrix (where the ( 1 , 1 ) entry is fixed to 1) and necessitates working directly with the general system matrix A, leading to a substantially more involved algebraic structure.
Consequently, the analysis cannot rely on the reduction techniques used in [9], and new explicit parametric conditions must be derived. This shift in perspective allows us to characterize, in a constructive and unified way, the admissible perturbation regions that simultaneously guarantee stabilization, through a sign change of the Niederlinski index, and preservation of the doubly stochastic interaction structure. In contrast to previous approaches, where either the perturbation mechanism or the structural constraints were more restrictive, the proposed paper provides explicit bounds for multiple perturbation patterns and extends the applicability of diagonal perturbation techniques to a broader class of structured MIMO systems.
The aim of this paper is to address this problem in the context of third-order MIMO systems. More precisely, we consider unstable systems whose combined matrix is doubly stochastic and investigate whether stability can be achieved through diagonal perturbations that preserve this property. We focus on perturbations involving the ( 1 , 1 ) entry together with one additional diagonal entry. The obtained results extend [9].
The paper is organized as follows. Section 2 recalls the necessary definitions and known results on combined matrices and the Niederlinski criterion. Section 3 contains the main theoretical results on diagonal perturbations and stability conditions. Section 4 presents a numerical example illustrating the applicability of the proposed method. Finally, conclusions are discussed in Section 5.

2. Preliminaries and Known Results

In this section, we recall definitions and established theoretical results that will be used throughout the paper. To improve the structural clarity and readability of the manuscript, the key mathematical symbols and their corresponding engineering interpretations are summarized in Table 1.
Building upon the notation established in Table 1, we formally introduce the fundamental definitions and theoretical results that will be used throughout the paper, starting with the concept of the combined matrix.
Definition 1.
Let A = ( a i j ) R n × n be a nonsingular matrix. The combined matrix of A, also known in control theory as the Relative Gain Array (RGA), is defined by
C ( A ) = ( c i j ) = A A T
where ∘ means the Hadamard (entrywise) product. Equivalently,
c i j = a i j A i j d e t ( A ) ,
where A i j is the cofactor of the ( i , j ) entry of A.
Definition 2.
A real matrix U = ( u i j ) of order n is said to be doubly stochastic matrix if
u i j 0 , i = 1 n u i j = 1 , j = 1 , 2 , , n j = 1 n u i j = 1 , i = 1 , 2 , , n .
It is well known that for any nonsingular matrix A, the rows and columns of C ( A ) sum to one; therefore, if C ( A ) is entrywise nonnegative, it is automatically doubly stochastic. Properties of combined matrices, including their invariance under diagonal equivalence and permutation similarity, can be found in [6].
Lemma 1.
The combined matrix C ( A ) = ( c i j ) = A A T of a nonsingular matrix A = ( a i j ) satisfies
(a) 
If D 1 and D 2 are two nonsingular diagonal matrices, then C ( A ) = C ( D 1 A D 2 ) .
(b) 
If P and Q are two permutation matrices, then C ( P A Q ) = P C ( A ) Q .
(c) 
C ( A T ) = C ( A ) .
In this paper, we focus on combined matrices of order 3. As shown in [6], if U = ( u i j ) is a doubly stochastic matrix of order 3 with no zero entries in its first row and first column, it can be written as
U = u 11 1 u 11 u 13 u 13 1 u 11 u 31 1 + u 11 + u 13 + u 31 + u 33 1 u 13 u 33 u 31 1 u 31 u 33 u 33 .
There exists a nonsingular matrix A such that C ( A ) = U if and only if the polynomial
P ( x ) = u 11 x 2 + u 22 u 13 u 31 u 33 u 11 x + u 33 u 13 u 31
has at least one real root distinct from u 13 u 31 u 21 + u 31 , with u 21 + u 31 0 .
Following [6], each real root x i , i = 1 , 2 of P ( x ) defines a canonical matrix T i of the form
T = 1 1 1 1 t 22 t 23 1 t 32 t 33 ,
where the entries can be expressed in terms of the matrix U given in (1),
t 22 = u 13 u 31 + ( 1 + u 13 + u 31 + u 33 ) x i ( u 13 + x i ) ( u 31 + x i ) t 23 = 1 + u 13 + u 33 u 13 + x i t 32 = 1 + u 31 + u 33 u 31 + x i t 33 = u 33 x i .
It is well known that any matrix A satisfying C ( A ) = U is diagonally equivalent to one of these canonical matrices T, that is, A = D 1 1 T D 2 1 , where D 1 and D 2 are nonsingular diagonal matrices. By Lemma (1) we have C ( A ) = C ( T ) .
Throughout the paper, system stability refers to the closed-loop MIMO system associated with the system matrix under consideration. To ensure the stability of the system, we recall the Niederlinski criterion; see [4].
Theorem 1.
Consider a 2 × 2 multivariable closed loop plant with C ( s ) = diag { c 1 ( s ) , c 2 ( s ) } . Also, assume that:
  • G ( s ) is stable.
  • P ( s ) = G ( s ) C ( s ) is a rational and proper matrix.
  • All single-input single-output closed loops, obtained from a one-opening feedback loop, are stable.
  • The system is unstable for all k > 0 if and only if the Niederlinski index N I [ G ( 0 ) ] < 0 , being N I [ G ( 0 ) ] = det [ G ( 0 ) ] i = 1 m g i i ( 0 ) .
The condition given in Theorem 1 is a sufficient condition for multivariable systems of size greater than or equal to 2.

3. Diagonal Perturbations and Stability Conditions

Without loss of generality, we focus on the root x 1 of the polynomial P ( x ) and assume that the associated closed-loop MIMO system is unstable, that is, N I [ A ] < 0 . Throughout this section, system stability is characterized by the sign of the Niederlinski index associated with the system matrix A; consequently, the analysis of MIMO system stability is reduced to the study of algebraic properties of the matrix A. Moreover, the diagonal perturbations under consideration are restricted to those that preserve the doubly stochastic structure of the associated combined matrix.
Under these assumptions, we analyze how diagonal perturbations affect the entries of the canonical matrix T = T 1 corresponding to the root x 1 , and we determine whether suitable perturbations can be used to recover system stability.
Theorem 2.
Let T be the nonsingular matrix given in (2) such that C ( T ) = U , where U is a doubly stochastic matrix of order 3, given in (1). Assume that the associated closed-loop MIMO system is unstable, that is, N I [ T ] < 0 . Then
det ( T ) < 0 , t 22 > 0 , t 33 > 0 , and x 1 > 0 ,
where x 1 is a root of the polynomial P ( x ) .
Proof. 
Since N I [ T ] = det ( T ) t 22 t 33 < 0 , det ( T ) and the product t 22 t 33 must have opposite signs. On the other hand, since U = C ( T ) is doubly stochastic, its diagonal entries satisfy u i i > 0 , which implies that the cofactors T i i have the same sign as det ( T ) . In particular, this imposes compatibility conditions between the signs of t 22 , t 33 and det ( T ) .
We proceed by analyzing the possible sign configurations. If det ( T ) > 0 , then t 22 t 33 < 0 , and 1 + u 33 x 1 > 0 and ( u 13 + x 1 ) ( u 31 + x 1 ) > 0 or 1 + u 33 x 1 < 0 and ( u 13 + x 1 ) ( u 31 + x 1 ) < 0 . If x 1 > 0 then u 33 < 1 + x 1 , which implies 1 + u 33 x 1 < 0 , leading to a contradiction. If x 1 < 0 , then t 33 = u 33 x 1 < 0 . From the expression u 22 = t 22 ( t 33 1 ) det ( T ) , we obtain t 22 < 0 , which gives t 22 t 33 > 0 and it is a contradiction. Thus, if det ( T ) > 0 , then t 22 t 33 < 0 , which contradicts the positivity constraints induced by the doubly stochastic structure of U.
Conversely, if det ( T ) < 0 , then necessarily t 22 t 33 > 0 . Then 1 + u 33 x 1 > 0 and ( u 13 + x 1 ) ( u 31 + x 1 ) < 0 or 1 + u 33 x 1 < 0 and ( u 13 + x 1 ) ( u 31 + x 1 ) > 0 . If x 1 < 0 , then t 33 = u 33 x 1 < 0 , which together with u 22 = t 22 ( t 33 1 ) det ( T ) implies t 22 > 0 and t 22 t 33 < 0 and it is a contradiction. If x 1 < 0 then u 33 > 1 + x 1 , and 1 + u 33 x 1 < 0 .
The expressions of the entries in terms of the root x 1 show that any admissible configuration requires x 1 > 0 , which ensures that t 33 = u 33 x 1 > 0 . Substituting this relation into the expression for u 22 yields t 22 > 0 .
Therefore, the only admissible configuration compatible with instability and the doubly stochastic structure is det ( T ) < 0 , t 22 > 0 , t 33 > 0 , and x 1 > 0 . □
This work extends the results given in [9]. Thus, our start hypothesis is N I [ T ] < 0 and we use the following result:
Theorem 3.
Let T i , i = 1 , 2 be matrices given in (2). N I [ T i ] < 0 and U = C ( T i ) is a doubly stochastic matrix. Then,
N I [ T i ] < 0 if and only if det ( T i ) < 0 , t 22 > 0 , 0 < t 33 < 1 , t 23 < 0 , t 32 < 0 ,
being t 33 = u 33 x i , x i > 0 .
In this paper we use a perturbation in the entry ( 1 , 1 ) . This fact requires working directly with matrix A = D 1 1 T D 2 1 . We assume x 1 is a nonzero root of the polynomial P ( x ) and, in this case, T is given by (2). Using D 1 1 = diag ( 1 , a 21 / a 11 , a 31 / a 11 ) and D 2 1 = diag ( a 11 , a 12 , a 13 ) , we can write A as
A = ( a i j ) = a 11 a 12 a 13 a 21 a 12 a 21 t 22 a 11 a 13 a 21 t 23 a 11 a 31 a 12 a 31 t 32 a 11 a 13 a 31 t 33 a 11 .
Using Lemma 1, C ( A ) = C ( T ) = U . We prove the relationship between the Niederlinski index of these matrices.
Lemma 2.
Let A be a nonsingular matrix given in (4) and let T be the matrix of order 3 with the structure given in (2). Then N I [ A ] = N I [ T ] .
Proof. 
By Theorem 1, N I [ A ] = det ( A ) i = 1 m a i i = det ( D 1 1 ) det ( T ) det ( D 2 1 ) i = 1 m a i i = det ( T ) t 22 t 33 . Thus, N I [ A ] = N I [ T ] . □
In the next result, we give the relationship between the matrices A and T.
Proposition 1.
Let T and A be nonsingular matrices given in (2) and (4). If N I [ A ] < 0 and C ( A ) is a doubly stochastic matrix, then t 22 < 1 and t 22 t 33 < t 23 t 32 .
Proof. 
Using Lemma 1 and since { t 22 , t 33 } > 0 by (3), det ( T ) < 0 . Since C ( A ) = U is doubly stochastic, all entries c i j 0 and det ( T ) < 0 . Then, the entries of the following matrix must be nonpositive. This matrix is given by:
C ( A ) det ( T ) = t 22 t 33 t 23 t 32 t 23 t 33 t 32 t 22 t 32 t 33 t 22 ( t 33 1 ) t 23 t 23 t 32 t 23 t 22 t 32 t 23 t 32 t 33 ( t 22 1 ) .
From the entry t 33 ( t 22 1 ) < 0 , since t 33 > 0 , we conclude t 22 1 . Similarly, t 22 ( t 33 1 ) < 0 implies t 33 1 . Finally, t 22 t 33 t 23 t 32 < 0 yields the interaction bound t 22 t 33 t 23 t 32 . □
We suppose that our system is unstable. In the following result, we show how it affects the entries of the matrix A.
Proposition 2.
Let A be the matrix given in (4). If N I [ A ] < 0 then
det ( A ) a 11 a 12 a 21 a 13 a 31 < 0 .
Proof. 
Using Lemma 2, we have N I [ A ] = N I [ T ] . By (3), the condition N I [ A ] < 0 implies t 22 > 0 and t 33 > 0 . From the structure of A we have
i = 1 3 a i i = a 12 a 21 a 13 a 31 a 11 t 22 t 33 .
Thus,
N I [ A ] = det ( A ) i = 1 3 a i i = det ( A ) a 11 a 12 a 21 a 13 a 31 t 22 t 33 .
Since t 22 t 33 > 0 , it follows that N I [ A ] < 0 if and only if det ( A ) and a 11 a 12 a 21 a 13 a 31 have opposite signs, which yields the stated alternatives. □
In [9] we analyzed diagonal perturbations of the ( 2 , 2 ) and ( 3 , 3 ) entries of the matrix T. Here, we focus on perturbations acting on the ( 1 , 1 ) entry and one other diagonal entry of the matrix A. Moreover, we restrict our study to perturbations for which the combined matrix C ( A p ) remains doubly stochastic.

3.1. Case det ( A ) < 0 and a 11 a 12 a 21 a 13 a 31 > 0

We choose a pattern, and for this study we select this one as a reference case, a 11 < 0 , a 12 < 0 , a 13 < 0 , a 21 > 0 and a 31 < 0 . We begin our analysis by applying diagonal perturbations to the entries a 11 and a 22 , obtaining the matrix A P = A + diag ( p 1 , p 2 , 0 ) which has the following structure
A P = ( a p i j ) = a 11 + p 1 a 12 a 13 a 21 a 12 a 21 t 22 a 11 + p 2 a 13 a 21 t 23 a 11 a 31 a 12 a 31 t 32 a 11 a 13 a 31 t 33 a 11 ,
with p 1 , p 2 R and p 1 , p 2 > 0 .
Remark 1.
The choice of perturbing the ( 1 , 1 ) entry alongside one additional diagonal entry is motivated by both technical and comparative requirements. First, rank-1 perturbations are insufficient to satisfy the initial stabilization conditions while preserving the doubly stochastic structure. Second, while higher-rank perturbations could be considered, they significantly reduce the degrees of freedom available to derive the explicit analytical bounds presented here. This structure extends the work established in [9], allowing for a direct comparison with previous stabilization results.
Using this matrix, we establish the following result.
Theorem 4.
Let A = ( a i j ) be the matrix given in (4) such that N I [ A ] < 0 and let U = C ( A ) be a doubly stochastic matrix. Consider the perturbed matrix A p = A + diag ( p 1 , p 2 , 0 ) , defined in (5), with p 1 , p 2 R , p 1 , p 2 > 0 . If the parameters p 1 and p 2 satisfy det ( A p ) < 0 , a 11 + p 1 > 0 and
a 11 < p 1 < min a 11 ( 1 t 32 ) t 32 , a 11 ( 1 t 23 ) t 23 , a 12 a 21 ( t 23 t 32 t 22 t 33 ) a 11 t 33 < p 2 ,
then A p satisfies N I [ A p ] > 0 and C ( A p ) remains doubly stochastic.
Proof. 
The proof is structured in two steps, corresponding to the stabilization condition and the preservation of the interaction structure.
Step 1: Niederlinski Index:
A direct computation shows that the determinant of the perturbed matrix can be written as
det ( A p ) = a 13 a 31 a 11 2 N ( p 1 , p 2 ) ,
where
N ( p 1 , p 2 ) = a 11 a 12 a 21 d + a 11 2 p 2 ( t 33 1 ) + a 11 p 1 p 2 t 33 + a 12 a 21 p 1 ( t 23 t 32 + t 22 t 33 ) .
Under the hypothesis det ( A p ) < 0 and the positivity of a 13 a 31 / a 11 2 , it follows that N ( p 1 , p 2 ) < 0 . The perturbed Niederlinski index can be factorized as
N I [ A p ] = N ( p 1 , p 2 ) ( a 11 + p 1 ) ( a 11 p 2 + a 12 a 21 t 22 ) t 33 .
Since N I [ T ] = N I [ A ] < 0 , the relations given in (3) hold. Furthermore, the specific sign pattern selected for this case implies that a 13 a 31 > 0 and a 12 a 21 < 0 . Since t 33 > 0 and N ( p 1 , p 2 ) < 0 , the condition N I [ A p ] > 0 is equivalent to
( a 11 + p 1 ) ( a 11 p 2 + a 12 a 21 t 22 ) < 0 .
Using that p 2 > 0 , t 22 > 0 , and a 12 a 21 < 0 , we have a 11 p 2 + a 12 a 21 t 22 < 0 . By hypothesis a 11 + p 1 > 0 , then N I [ A p ] > 0 .
Step 2: Doubly stochastic structure:
Since det ( A p ) < 0 , to demonstrate that C ( A p ) is doubly stochastic is equivalent to requiring that all entries of A p ( D ) are negative, being A p ( D ) = ( a p i j ( D ) ) = C ( A p ) det ( A p ) .
  • Entry a p 11 ( D ) . A direct computation yields:
    a p 11 ( D ) = a 13 a 31 ( a 11 + p 1 ) a 11 2 a 11 p 2 t 33 + a 12 a 21 ( t 23 t 32 + t 22 t 33 ) .
    Since a 13 a 31 > 0 , a 11 + p 1 > 0 , and by hypothesis p 2 > a 12 a 21 ( t 23 t 32 t 22 t 33 ) a 11 t 33 , we obtain a 11 p 2 t 33 + a 12 a 21 ( t 23 t 32 + t 22 t 33 ) < 0 . Hence, a p 11 ( D ) is negative.
  • The following entries are negative due to the doubly stochastic structure of C ( A ) and the sign t 23 < 0 , t 32 < 0 .
    a p 12 ( D ) = a 12 a 13 a 21 a 31 ( t 23 t 33 ) a 11 a p 13 ( D ) = a 13 a 31 ( a 11 p 2 + a 12 a 21 ( t 22 t 32 ) a 11 a p 21 ( D ) = a 12 a 13 a 21 a 31 ( t 32 t 33 ) a 11 a p 31 ( D ) = a 13 a 31 ( a 11 p 2 + a 12 a 21 ( t 22 t 23 ) a 11 .
  • Entry a p 22 ( D ) . Using the hypothesis, we obtain
    a p 22 ( D ) = a 13 a 31 ( a 11 p 2 + a 12 a 21 t 22 ) a 11 2 a 11 ( 1 + t 33 ) + p 1 t 33 < 0 .
  • The following entries are negative provided that p 1 < a 11 ( 1 t 32 ) t 32 and p 1 < a 11 ( 1 t 23 ) t 23 , respectively, as defined by the hypothesis.
    a p 23 ( D ) = a 12 a 13 a 21 a 31 t 23 ( a 11 ( 1 + t 32 ) + p 1 t 32 ) a 11 2 a p 32 ( D ) = a 12 a 13 a 21 a 31 ( a 11 ( 1 + t 23 ) + p 1 t 23 ) t 32 a 11 2 .
  • Entry a p 33 ( D ) is negative based on the hypothesis
    a p 33 ( D ) = a 13 a 31 ( a 11 2 p 2 + a 11 p 1 p 2 + a 11 a 12 a 21 ( 1 + t 22 ) + a 12 a 21 p 1 t 22 ) t 33 a 11 2 .
As all entries a p i j ( D ) < 0 and det ( A p ) < 0 , the matrix C ( A p ) is doubly stochastic. □
The proof of Theorem 4 illustrates the general mechanism underlying all admissible perturbation patterns. Stabilization is governed by the sign of the perturbation polynomial N ( p 1 , p 2 ) , while the preservation of the doubly stochastic structure is ensured by maintaining a consistent sign between the cofactors a p i j ( D ) and the determinant of A p .
Although each perturbation configuration leads to different algebraic expressions, the structure of the analysis remains essentially the same. In particular, all cases can be treated by combining a factorization of the perturbed determinant, a sign analysis of the Niederlinski index, and a verification that the cofactors preserve the required sign pattern.
To avoid repetitive computations, the sign conditions required for each perturbation pattern are summarized in Table 2. These conditions provide a unified characterization of all admissible perturbations ensuring stabilization and preservation of the interaction structure.
The remaining perturbation cases are stated below. Their proofs follow the same algebraic technique as in Theorem 4 and are therefore omitted for conciseness and we briefly indicate the key arguments. For completeness, we add the proofs to Appendix A. Now, we apply perturbations to the entries a 11 and a 22 , obtaining the perturbed matrix A P = A + diag ( p 1 , p 2 , 0 ) .
Proposition 3.
Let A = ( a i j ) be the matrix given in (4) such that N I [ A ] < 0 and let U = C ( A ) be a doubly stochastic matrix. Consider the perturbed matrix A p = A + diag ( p 1 , p 2 , 0 ) , with the same structure as in (5), with p 1 , p 2 R , p 1 , p 2 > 0 . If det ( A p ) < 0 and
a 11 ( t 33 1 ) t 33 < p 1 , a 12 a 21 t 22 a 11 < p 2 < min a 12 a 21 ( t 22 t 32 ) a 11 , a 12 a 21 ( t 22 t 23 ) a 11 ,
then A p satisfies N I [ A p ] > 0 and C ( A p ) is doubly stochastic.
Proof. 
The determinant of the perturbed matrix admits a factorization of the form det ( A p ) = α N ( p 1 , p 2 ) , where the coefficient α has a fixed sign under the proposed perturbation pattern. The imposed bounds on p 1 and p 2 ensure that N ( p 1 , p 2 ) > 0 , while the denominator of N I [ A p ] remains positive, yielding N I [ A p ] > 0 .
Moreover, as summarized in Table 2, the same bounds guarantee that all cofactors a p i j ( D ) preserve the sign of det ( A p ) . Consequently, the combined matrix C ( A p ) remains doubly stochastic. □
Next, the perturbations are applied to a 11 and a 33 , obtaining the matrix A P = A + diag ( p 1 , 0 , p 2 ) .
Proposition 4.
Let A = ( a i j ) be the matrix given in (4) such that N I [ A ] < 0 and let U = C ( A ) be a doubly stochastic matrix. Consider the perturbed matrix A p = A + diag ( p 1 , 0 , p 2 ) , with the same structure as in (5), with p 1 , p 2 R , p 1 , p 2 > 0 . If det ( A p ) < 0 , a 11 + p 1 > 0 and
a 11 < p 1 < min a 11 ( 1 t 23 ) t 23 , a 11 ( 1 t 32 ) t 32 , a 13 a 31 ( t 22 t 33 t 23 t 32 ) a 11 t 22 < p 2 ,
then A p satisfies N I [ A p ] > 0 and C ( A p ) is doubly stochastic.
Proof. 
For this perturbation pattern, the determinant of A p can be written as det ( A p ) = α N ( p 1 , p 2 ) , where α has a fixed sign. The imposed lower bound on p 2 ensures that N ( p 1 , p 2 ) < 0 , and hence det ( A p ) < 0 .
The Niederlinski index can be factorized into three terms, whose signs are determined by the sign pattern of the original matrix and the condition a 11 + p 1 > 0 . The bound on p 2 guarantees that the third factor is negative, which implies N I [ A p ] > 0 .
Finally, the upper bounds on p 1 ensure that all interaction cofactors retain their original sign, while the diagonal cofactors remain consistent with det ( A p ) . Therefore, the combined matrix remains doubly stochastic. □
Finally, if the perturbations are applied to a 11 and a 33 , we obtain the matrix A P = A + diag ( p 1 , 0 , p 2 ) and we show this in the following result.
Proposition 5.
Let A = ( a i j ) be the matrix given in (4) such that N I [ A ] < 0 and let U = C ( A ) be a doubly stochastic matrix. Consider the perturbed matrix A p = A + diag ( p 1 , 0 , p 2 ) , with the same structure as in (5), with p 1 , p 2 R , p 1 , p 2 > 0 . If det ( A p ) < 0 and
a 11 ( t 22 1 ) t 22 < p 1 , a 13 a 31 t 33 a 11 < p 2 < min a 13 a 31 ( t 33 t 23 ) a 11 , a 13 a 31 ( t 33 t 32 ) a 11 ,
then A p satisfies N I [ A p ] > 0 and C ( A p ) is doubly stochastic.
Proof. 
This perturbation pattern differs from that of Proposition 4 only by the sign of p 1 , while the algebraic structure of the determinant and the associated perturbation polynomial remains unchanged.
By applying the transformation from p 1 to p 1 , the analysis reduces to the technique of Proposition 4, with the corresponding inversion of the sign conditions. The bounds on p 1 and p 2 are precisely those required to preserve the sign of the perturbation polynomial and ensure that the denominator of the Niederlinski index has the appropriate sign.
The preservation of the doubly stochastic structure follows from the same cofactor sign conditions, which remain invariant under this transformation. □

3.2. Case det ( A ) > 0 and a 11 a 12 a 21 a 13 a 31 < 0

We choose a pattern, and for this study we select this one as a reference case, a 11 < 0 , a 12 < 0 , a 13 < 0 , a 21 < 0 and a 31 < 0 . Since the technique is the same as the previous subsection, we show only the obtained results. We begin our analysis by applying diagonal perturbations to the entries a 11 and a 22 , obtaining the matrix A P = A + diag ( p 1 , p 2 , 0 ) .
Proposition 6.
Let A = ( a i j ) be the matrix given in (4) such that N I [ A ] < 0 and let U = C ( A ) be a doubly stochastic matrix. Consider the perturbed matrix A p = A + diag ( p 1 , p 2 , 0 ) , with the same structure as in (5), with p 1 , p 2 R , p 1 , p 2 > 0 . If det ( A p ) > 0 , a 11 + p 1 > 0 and
a 11 < p 1 < min a 11 ( 1 t 23 ) t 23 , a 11 ( 1 t 32 ) t 32 , a 12 a 21 ( t 23 t 32 t 22 t 33 ) a 11 t 33 < p 2 ,
then A p satisfies N I [ A p ] > 0 and C ( A p ) is doubly stochastic.
Proof. 
In this configuration, the determinant of the perturbed matrix changes sign with respect to the previous case, i.e., det ( A p ) > 0 . Consequently, the preservation of the doubly stochastic structure requires all cofactors to be positive instead of negative.
The perturbation polynomial N ( p 1 , p 2 ) retains the same structure as in Theorem 4, and the imposed bounds ensure that its sign is compatible with det ( A p ) > 0 , yielding N I [ A p ] > 0 .
The cofactor conditions are obtained by reversing the sign constraints in Table 2, which guarantees that C ( A p ) remains entrywise nonnegative. □
Next, the perturbations are applied to a 11 and a 22 , thus obtaining the matrix A P = A + diag ( p 1 , p 2 , 0 ) .
Proposition 7.
Let A = ( a i j ) be the matrix given in (4) such that N I [ A ] < 0 and let U = C ( A ) be a doubly stochastic matrix. Consider the perturbed matrix A p = A + diag ( p 1 , p 2 , 0 ) , with the same structure as in (5), with p 1 , p 2 R , p 1 , p 2 > 0 . If det ( A p ) > 0 and
a 11 ( t 33 1 ) t 33 < p 1 , a 12 a 21 t 22 a 11 < p 2 < min a 12 a 21 ( t 22 t 23 ) a 11 , a 12 a 21 ( t 22 t 32 ) a 11 ,
then A p satisfies N I [ A p ] > 0 and C ( A p ) is doubly stochastic.
Proof. 
This case can be interpreted as the symmetric counterpart of Proposition 6 with respect to the perturbation direction. The determinant remains positive, and the perturbation polynomial N ( p 1 , p 2 ) satisfies analogous sign conditions under the proposed bounds.
The sign of the denominator of N I [ A p ] is determined by the factor ( a 11 p 1 ) , whose negativity is enforced by the lower bound on p 1 . Together with the sign of N ( p 1 , p 2 ) , this yields N I [ A p ] > 0 .
The preservation of the doubly stochastic structure follows from the same cofactor conditions, which are consistent with det ( A p ) > 0 . □
If the perturbations are applied to a 11 and a 33 , we obtain the matrix A P = A + diag ( p 1 , 0 , p 2 ) along with the following result.
Proposition 8.
Let A = ( a i j ) be the matrix given in (4) such that N I [ A ] < 0 and let U = C ( A ) be a doubly stochastic matrix. Consider the perturbed matrix A p = A + diag ( p 1 , 0 , p 2 ) , with the same structure as in (5), with p 1 , p 2 R , p 1 , p 2 > 0 . If det ( A p ) > 0 , a 11 + p 1 > 0 and
a 11 < p 1 < min a 11 ( 1 t 23 ) t 23 , a 11 ( 1 t 32 ) t 32 , a 13 a 31 ( t 23 t 32 + t 22 t 33 ) a 11 t 22 < p 2 ,
then A p satisfies N I [ A p ] > 0 and C ( A p ) is doubly stochastic.
Proof. 
The determinant of the perturbed matrix admits a factorization in terms of the perturbation polynomial N ( p 1 , p 2 ) , whose sign is controlled by the imposed bounds on p 2 . These conditions ensure that det ( A p ) > 0 .
The Niederlinski index is expressed as a product of three factors, and the corresponding bounds guarantee that their combined sign is positive, yielding N I [ A p ] > 0 .
The sign of each cofactor follows from the same inequalities defining the admissible region. In particular, the bounds on p 1 prevent any sign change in the interaction terms, ensuring that the combined matrix remains doubly stochastic. □
Finally, if the perturbations are applied to a 11 and a 33 , we obtain the matrix A P = A + diag ( p 1 , 0 , p 2 ) along with the following result.
Proposition 9.
Let A = ( a i j ) be the matrix given in (4) such that N I [ A ] < 0 and let U = C ( A ) be a doubly stochastic matrix. Consider the perturbed matrix A p = A + diag ( p 1 , 0 , p 2 ) , with the same structure as in (5), with p 1 , p 2 R , p 1 , p 2 > 0 . If det ( A p ) > 0 and
a 11 ( t 22 1 ) t 22 < p 1 a 13 a 31 t 33 a 11 < p 2 < min a 13 a 31 ( t 33 t 32 ) a 11 , a 13 a 31 ( t 33 t 23 ) a 11 ,
then A p satisfies N I [ A p ] > 0 and C ( A p ) is doubly stochastic.
Proof. 
This configuration completes the set of admissible perturbation patterns. The determinant remains positive and can be expressed as a scaled version of the perturbation polynomial N ( p 1 , p 2 ) .
The bounds on p 1 and p 2 ensure that the numerator and denominator of N I [ A p ] have compatible signs, yielding N I [ A p ] > 0 . Moreover, the same bounds guarantee that all cofactors preserve the sign required by det ( A p ) > 0 .
Therefore, this case satisfies stabilization and structure-preserving conditions. □
The results presented in this section provide a complete characterization of diagonal perturbations that achieve stabilization while preserving the interaction structure. The explicit bounds obtained for each perturbation pattern define admissible regions in the parameter space ( p 1 , p 2 ) , thereby offering a constructive method for structure-preserving stabilization of MIMO systems.

4. Applied Examples

In this section, we illustrate the theoretical results obtained in previous sections through numerical examples. The purpose is to show how diagonal perturbations can modify the sign of the Niederlinski index while preserving the doubly stochastic structure of the combined matrix.
We consider the matrix T, encoding the interaction structure of the system, and construct a system matrix A that is diagonally equivalent to T.
T = 1 1 1 1 0.0742 1.9627 1 2.4719 0.8900 .
This matrix satifies N I [ T ] = 154.2861 < 0 and det ( T ) = 10.1842 < 0 and its associated combined matrix is doubly stochastic.
C ( T ) = 0.4699 0.2801 0.2500 0.3301 0.0008 0.6691 0.2000 0.7191 0.0809 .
Following the construction described in Section 2, we define diagonal matrices D 1 1 = diag 1 , a 21 a 11 , a 31 a 11 , D 2 1 = diag ( a 11 , a 12 , a 13 ) , and construct the system matrix A = D 1 1 T D 2 1 , which preserves the combined matrix structure, i.e., C ( A ) = C ( T ) .

4.1. Case det ( A ) < 0

We select the parameters a 11 = 1 , a 12 = 2 , a 13 = 3 , a 21 = 1 , a 31 = 5 . The resulting matrix is
A = 1 2 3 1 0.1483 5.8880 5 24.7188 13.3500 .
A direct computation shows that det ( A ) = 305.5250 < 0 . By Lemma 2, N I [ A ] = N I [ T ] = 154.2861 < 0 , so the system is unstable.
We now apply a diagonal perturbation of the form A p = A + diag ( p 1 , p 2 , 0 ) . According to Theorem 4, stability is ensured if
0 < p 1 < min 1.4046 , 1.5095 , 10.7538 < p 2 ,
For instance, choosing p 1 = 1.3 , p 2 = 10.8 , we obtain a perturbed matrix A p such that N I [ A p ] = 7.3925 > 0 and C ( A p ) remains doubly stochastic
A p = 0.3000 2.0000 3.0000 1.0000 10.9483 5.8880 5.0000 24.7188 13.3500 , C ( A p ) = 0.0006 0.2640 0.7354 0.3111 0.6419 0.0469 0.6883 0.0941 0.2176
Thus, the system becomes stable without altering the interaction structure.
We now apply a diagonal perturbation of the form A p = A + diag ( p 1 , 0 , p 2 ) . According to Proposition 4, stability is ensured if
1 < p 1 < 1.4046 , 967.8455 < p 2 ,
For instance, choosing p 1 = 1.3 , p 2 = 968 , we obtain a perturbed matrix A p such that N I [ A p ] = 48.0519 > 0 and C ( A p ) remains doubly stochastic
A p = 0.3000 2.0000 3.0000 1.0000 0.1483 5.8880 5.0000 24.7188 981.3500 , C ( A p ) = 0 0.9636 0.0364 0.9709 0.0219 0.0073 0.0291 0.0145 0.9563
Thus, the system becomes stable without altering the interaction structure.

4.2. Case det ( A ) > 0

To illustrate a different sign pattern, we modify the previous system by setting a 21 = 1 . The resulting matrix becomes
A = 1 2 3 1 0.1483 5.8880 5 24.7188 13.3500 .
A direct computation shows that det ( A ) = 305.5254 > 0 . By Lemma 2, N I [ A ] = N I [ T ] = 154.2861 < 0 , so the system is unstable.
We now apply a diagonal perturbation of the form A p = A + diag ( p 1 , p 2 , 0 ) . According to Proposition 6, stability is ensured if
1 < p 1 < 1.4046 , 10.7538 < p 2 ,
For instance, choosing p 1 = 1.3 , p 2 = 10.8 , we obtain a perturbed matrix A p such that N I [ A p ] = 7.3925 > 0 and C ( A p ) remains doubly stochastic
A p = 0.3000 2.0000 3.0000 1.0000 10.9483 5.8880 5.0000 24.7188 13.3500 , C ( A p ) = 0.0006 0.2640 0.7354 0.3111 0.6419 0.0469 0.6883 0.0941 0.2176
Thus, the system becomes stable without altering the interaction structure.

4.3. Comparative Analysis of Perturbation Strategies

The previous examples demonstrate that stabilization can be achieved through different diagonal perturbation patterns. To provide a unified view, Figure 1 shows the evolution of the Niederlinski index N I [ A p ] as a function of p 1 for the three perturbation strategies considered.
The horizontal dashed line represents the original value N I [ A ] < 0 , corresponding to an unstable configuration. All three perturbation patterns produce a transition from negative to positive values, confirming that stabilization can be achieved in each case.
A clear difference in the behavior of the curves can be observed. First, the perturbations of the form A + diag ( p 1 , p 2 , 0 ) and A + diag ( p 1 , p 2 , 0 ) exhibit a smooth transition, with stabilization occurring within a relatively narrow range of p 1 . This indicates that modifying the ( 2 , 2 ) entry provides an efficient mechanism to change the sign of the Niederlinski index.
In contrast, the perturbation A + diag ( p 1 , 0 , p 2 ) shows a significantly different behavior. Although stabilization is still achieved, it requires much larger values of p 2 , and the resulting index grows more abruptly. This reflects a lower sensitivity with respect to p 1 and highlights the stronger influence of the ( 3 , 3 ) entry in this configuration.
Overall, the comparison reveals that, while all admissible perturbations are theoretically valid, their practical effectiveness differs substantially. In particular, perturbations involving the second diagonal entry are more efficient, whereas those involving the third diagonal entry require larger parameter variations.
For visualization purposes, the vertical axis in Figure 1 has been restricted in order to emphasize the transition region around the stability boundary N I = 0 .

5. Discussion

The numerical results presented in Section 4 provide a clear validation of the theoretical work developed in Section 3. In particular, the examples illustrate that diagonal perturbations allow one to systematically modify the sign of the Niederlinski index while preserving the doubly stochastic structure of the combined matrix.
From a structural point of view, the results indicate that stabilization is not achieved arbitrarily, but only within specific regions of the parameter space ( p 1 , p 2 ) . The pointwise examples confirm that the analytical bounds derived in Theorem 4 and Propositions 3–9 correctly identify admissible perturbations, while the global visualization reveals that these bounds capture a nontrivial subset of the stabilization region.
A key observation is that the proposed perturbations do not merely restore stability, but also produce a progressive improvement of the Niederlinski index. This behavior, clearly observed in the graphical representation, provides additional insight into the effectiveness of the method beyond binary stability criteria.
From an engineering perspective, these results admit a natural interpretation. Diagonal perturbations correspond to local modifications of subsystem dynamics, such as controller retuning, actuator calibration, or adjustment of loop gains. Therefore, the proposed paper provides explicit conditions under which such local actions lead to improved interaction properties while preserving the original coupling structure of the plant. This interpretation is consistent with classical approaches to decentralized control structure selection, where interaction measures and structural indices play a crucial role in assessing system performance and integrity [5].
The proposed methodology is formulated in terms of the Niederlinski index, which is a classical tool for assessing the feasibility of decentralized control configurations. Nevertheless, the Niederlinski index should not be regarded as a complete stability criterion. In particular, although a negative Niederlinski index is widely recognized as an indication that decentralized stabilization is generally impossible under the standard assumptions, a positive Niederlinski index alone does not guarantee closed-loop stability [1,3].
Furthermore, the Niederlinski index is derived from steady-state gain information and therefore does not capture dynamic effects such as pole–zero interactions, time delays, or higher-order dynamics. The stability of the closed-loop system also depends on the dynamic characteristics of the plant, the controller design, robustness margins, model uncertainty, and performance requirements.
Consequently, the results presented in this paper should be interpreted as providing algebraic conditions that eliminate a structural obstacle to decentralized stabilization, rather than as a complete stability analysis of the closed-loop system.
The method also highlights certain limitations. The analysis assumes that the interaction structure, as captured by the combined matrix, remains fixed under the perturbations. In practical applications, however, MIMO systems may be affected by uncertainties, external disturbances, or even adversarial interference, which can modify the effective system matrix and alter the interaction structure.
This issue is particularly relevant in communication and radar systems, where active interference may introduce additional inputs or significantly distort the nominal coupling structure. In such contexts, recent advances in interference detection and classification, such as the framework proposed by [10], provide complementary tools for identifying and mitigating these effects before they impact system performance [10].
Therefore, the stabilization conditions derived in this paper should be interpreted as nominal-model results, and their integration with data-driven identification or robust control techniques constitutes an interesting direction for future research.
Finally, although the present work focuses on third-order systems, the underlying concepts of combined matrices, diagonal equivalence, and structure-preserving perturbations extend naturally to higher-dimensional systems. The main difficulty lies in the increasing algebraic complexity of the associated conditions. The results presented here can therefore be seen as a first step towards a general theory of stabilization under structure-preserving constraints in MIMO systems.

6. Conclusions

In this paper, we have investigated the stabilization of third-order MIMO systems whose interaction structure is described by a doubly stochastic combined matrix. Starting from unstable configurations characterized by a negative Niederlinski index, we have derived explicit algebraic conditions under which stability can be recovered through diagonal perturbations while preserving the underlying interaction structure.
The proposed approach is based on a structured representation of the system matrix and on a detailed analysis of the perturbation polynomial governing the sign of the determinant. This allowed us to obtain explicit bounds on the perturbation parameters for different sign configurations, providing a complete characterization of admissible structure-preserving stabilization strategies.
The numerical results presented in Section 4 illustrate and validate the theoretical findings. In particular, the examples show that stabilization can be achieved for different perturbation patterns and sign regimes, while the global analysis highlights that the admissible parameter regions are nontrivial and consistent with the derived analytical bounds. Moreover, the results demonstrate that diagonal perturbations not only restore stability, but also produce a significant improvement in the value of the Niederlinski index.
From an engineering perspective, the proposed perturbations admit a natural interpretation in terms of local controller retuning and parameter adjustments, offering a constructive method for improving interaction properties without modifying the physical coupling structure of the system.
It should be emphasized that the Niederlinski index is used here as a structural indicator rather than as a complete stability criterion. Therefore, the results should be interpreted as identifying favorable regions for decentralized stabilization, which may be complemented by additional control-theoretic tools addressing robustness and dynamic performance.
From a computational viewpoint, the proposed approach is particularly efficient for third-order systems, since all stabilization conditions are derived analytically in closed form. Once the combined matrix has been computed, the admissible perturbation parameters are obtained by evaluating a finite set of explicit algebraic inequalities, without requiring iterative optimization procedures, eigenvalue computations, or numerical optimization algorithms. Therefore, the computational cost for the three-dimensional case is negligible.
For higher-order MIMO systems, the same methodology remains conceptually applicable. However, the number of interaction parameters, admissible perturbation cases, and algebraic inequalities increases rapidly with the system dimension. Consequently, although the proposed framework remains constructive, its computational complexity is expected to grow significantly, making symbolic manipulation and computer algebra techniques increasingly valuable for deriving explicit stabilization conditions.
Future research will focus on extending the proposed methodology to higher-dimensional systems, as well as on incorporating robustness considerations in the presence of uncertainties, disturbances, or external interference that may alter the interaction structure. The integration of structure-preserving stabilization with data-driven identification and advanced control techniques constitutes a promising direction for further investigation.
In this context, although the present work focuses on third-order MIMO systems, the underlying methodology relies on structural properties of combined matrices, diagonal equivalence, and the invariance of the Niederlinski index, which are not specific to dimension three. Therefore, the proposed approach provides a conceptual framework that can be extended to higher-order systems.
However, obtaining necessary and sufficient conditions in dimensions greater than three is expected to require substantially more involved algebraic characterizations and a significantly larger parameter space. Consequently, the extension of the present results to general n × n MIMO systems constitutes a natural and relevant direction for future research.

Author Contributions

Conceptualization, M.B. and B.C.; methodology, M.B. and B.C.; formal analysis, M.B. and B.C.; investigation, M.B. and B.C.; writing—original draft preparation, M.B. and B.C.; writing—review and editing. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

The original contributions presented in this study are included in the article. Further inquiries can be directed to the corresponding author.

Conflicts of Interest

The authors declare no conflicts of interest.

Appendix A. Detailed Proofs of Propositions 3–9

In this appendix we provide complete proofs of Propositions 3–9. For clarity, each proposition is presented together with its corresponding proof in a self-contained manner.
  • Case 1: det ( A ) < 0 , a 11 a 12 a 21 a 13 a 31 > 0 , a 11 < 0 , a 12 < 0 , a 13 < 0 , a 21 > 0 and a 31 < 0 . The following propositions correspond to the perturbation patterns analyzed in Section 3. For completeness, we provide here the detailed proofs associated with Propositions 3–5.
  • Proposition 3
Let A = ( a i j ) be the matrix given in (4) such that N I [ A ] < 0 and let U = C ( A ) be a doubly stochastic matrix. Consider the perturbed matrix A p = A + diag ( p 1 , p 2 , 0 ) , with the same structure as in (5), with p 1 , p 2 R , p 1 , p 2 > 0 . If det ( A p ) < 0 and
a 11 ( t 33 1 ) t 33 < p 1 , a 12 a 21 t 22 a 11 < p 2 < min a 12 a 21 ( t 22 t 32 ) a 11 , a 12 a 21 ( t 22 t 23 ) a 11 ,
then A p satisfies N I [ A p ] > 0 and C ( A p ) is doubly stochastic.
Proof. 
We assume that det ( A p ) = a 13 a 31 a 11 2 N ( p 1 , p 2 ) < 0 and we define
N ( p 1 , p 2 ) = a 11 2 p 2 ( 1 t 33 ) a 11 a 12 a 21 d + p 1 p 2 t 33 + a 12 a 21 p 1 ( t 23 t 32 + t 22 t 33 ) > 0 .
Then,
N I ( A p ) = N ( p 1 , p 2 ) ( a 11 p 1 ) ( a 11 p 2 a 12 a 21 t 22 ) t 33 .
Since a 11 p 1 < 0 and p 2 > a 12 a 21 t 22 a 11 , it follows that ( a 11 p 2 a 12 a 21 t 22 ) < 0 . Hence, N I ( A p ) > 0 .
Next, we analyze the entries of A p ( D ) :
a p 11 ( D ) = a 13 a 31 a 11 2 ( a 11 p 1 ) a 11 p 2 t 33 + a 12 a 21 ( t 23 t 32 t 22 t 33 ) < 0 , a p 12 ( D ) = a 12 a 13 a 21 a 31 ( t 23 t 33 ) a 11 < 0 .
For the entry a p 13 ( D ) we have
a p 13 ( D ) = a 13 a 31 a 11 a 11 p 2 + a 12 a 21 ( t 22 + t 32 ) .
If p 2 < a 12 a 21 ( t 22 t 32 ) a 11 , then a 11 p 2 + a 12 a 21 ( t 22 + t 32 ) > 0 , and therefore a p 13 ( D ) < 0 .
Proceeding analogously,
a p 21 ( D ) = a 12 a 13 a 21 a 31 ( t 32 t 33 ) a 11 < 0 , a p 22 ( D ) = a 13 a 31 a 11 2 ( a 11 p 2 a 12 a 21 t 22 ) ( a 11 ( 1 t 33 ) p 1 t 33 ) .
If p 2 > a 12 a 21 t 22 a 11 and p 1 > a 11 ( 1 t 33 ) t 33 , then a 11 p 2 a 12 a 21 t 22 < 0 and a 11 ( 1 t 33 ) p 1 t 33 < 0 , and thus a p 22 ( D ) < 0 .
The remaining terms satisfy
a p 23 ( D ) = a 12 a 13 a 21 a 31 t 23 a 11 2 a 11 ( 1 t 32 ) p 1 t 32 < 0 .
For the entry a p 31 ( D ) ,
a p 31 ( D ) = a 13 a 31 a 11 a 11 p 2 + a 12 a 21 ( t 22 + t 23 ) .
If p 2 < a 12 a 21 ( t 22 t 23 ) a 11 , then a 11 p 2 + a 12 a 21 ( t 22 + t 23 ) > 0 , and therefore a p 31 ( D ) < 0 .
Furthermore,
a p 32 ( D ) = a 12 a 13 a 21 a 31 a 11 2 a 11 ( 1 t 23 ) p 1 t 23 t 32 < 0 , a p 33 ( D ) = a 13 a 31 a 11 2 a 11 2 p 2 a 11 p 1 p 2 + a 12 a 21 ( 1 t 22 ) + a 12 a 21 p 1 t 22 t 33 < 0 .
Thus, all entries of A p ( D ) are negative under the stated conditions, which completes the proof. □
  • Proposition 4
Let A = ( a i j ) be the matrix given in (4) such that N I [ A ] < 0 and let U = C ( A ) be a doubly stochastic matrix. Consider the perturbed matrix A p = A + diag ( p 1 , 0 , p 2 ) , with the same structure as in (5), with p 1 , p 2 R , p 1 , p 2 > 0 . If det ( A p ) < 0 , a 11 + p 1 > 0 and
a 11 < p 1 < min a 11 ( 1 t 23 ) t 23 , a 11 ( 1 t 32 ) t 32 , a 13 a 31 ( t 22 t 33 t 23 t 32 ) a 11 t 22 < p 2 ,
then A p satisfies N I [ A p ] > 0 and C ( A p ) is doubly stochastic.
Proof. 
Assume det ( A p ) = a 12 a 21 a 11 2 N ( p 1 , p 2 ) < 0 , with
N ( p 1 , p 2 ) = a 11 2 p 2 ( 1 + t 22 ) + a 11 p 1 p 2 t 22 + a 13 a 31 p 1 ( t 23 t 32 t 22 t 33 ) + a 11 a 13 a 31 ( d ) < 0 .
Since a 11 + p 1 > 0 by hypothesis, we have
N I ( A p ) = N ( p 1 , p 2 ) ( a 11 + p 1 ) t 22 ( a 11 p 2 a 13 a 31 t 33 ) > 0 .
Each entry of A p ( D ) is analyzed. For the entry a p 11 ( D ) , if p 2 > a 13 a 31 ( t 23 t 32 + t 22 t 33 ) a 11 t 22 , then a 11 p 2 t 22 + a 13 a 31 ( t 23 t 32 t 22 t 33 ) < 0 , and therefore
a p 11 ( D ) = a 12 a 21 a 11 2 ( a 11 + p 1 ) a 11 p 2 t 22 + a 13 a 31 ( t 23 t 32 t 22 t 33 ) < 0 .
Furthermore,
a p 12 ( D ) = a 12 a 21 a 11 a 11 p 2 + a 13 a 31 ( t 23 t 33 ) < 0 , a p 13 ( D ) = a 12 a 13 a 21 a 31 a 11 ( t 22 t 32 ) < 0 .
Moreover,
a p 21 ( D ) = a 12 a 21 a 11 a 11 p 2 + a 13 a 31 ( t 32 t 33 ) < 0 ,
and
a p 22 ( D ) = a 12 a 21 t 22 a 11 2 a 11 2 p 2 + a 11 p 1 p 2 a 13 a 31 p 1 t 33 + a 11 a 13 ( a 31 a 31 t 33 ) < 0 .
For the entry a p 23 ( D ) , if p 1 < a 11 ( 1 t 32 ) t 32 , then a 11 ( 1 + t 32 ) + p 1 t 32 > 0 , and consequently
a p 23 ( D ) = a 12 a 13 a 21 a 31 t 23 a 11 2 a 11 ( 1 + t 32 ) + p 1 t 32 < 0 .
Furthermore,
a p 31 ( D ) = a 12 a 13 a 21 a 31 a 11 ( t 22 t 23 ) < 0 .
For the entry a p 32 ( D ) , if p 1 < a 11 ( 1 t 23 ) t 23 , then a 11 ( 1 + t 23 ) + p 1 t 23 > 0 ,
a p 32 ( D ) = a 12 a 13 a 21 a 31 a 11 2 a 11 ( 1 + t 23 ) + p 1 t 23 t 32 < 0 .
Finally, since p 2 > a 13 a 31 ( t 23 t 32 + t 22 t 33 ) a 11 t 22 > a 13 a 31 t 33 a 11 , it follows that a 11 p 2 a 13 a 31 t 33 < 0 . Hence, ( a 11 ( 1 + t 22 ) + p 1 t 22 ) ( a 11 p 2 a 13 a 31 t 33 ) < 0 , which yields
a p 33 ( D ) = a 12 a 21 a 11 2 ( a 11 ( 1 + t 22 ) + p 1 t 22 ) ( a 11 p 2 a 13 a 31 t 33 ) < 0 .
Therefore, all entries of a p i j ( D ) are negative under the stated assumptions. □
  • Proposition 5
Let A = ( a i j ) be the matrix given in (4) such that N I [ A ] < 0 and let U = C ( A ) be a doubly stochastic matrix. Consider the perturbed matrix A p = A + diag ( p 1 , 0 , p 2 ) , with the same structure as in (5), with p 1 , p 2 R , p 1 , p 2 > 0 . If det ( A p ) < 0 and
a 11 ( t 22 1 ) t 22 < p 1 , a 13 a 31 t 33 a 11 < p 2 < min a 13 a 31 ( t 33 t 23 ) a 11 , a 13 a 31 ( t 33 t 32 ) a 11 ,
then A p satisfies N I [ A p ] > 0 and C ( A p ) is doubly stochastic.
Proof. 
Assume det ( A p ) = a 12 a 21 a 11 2 N ( p 1 , p 2 ) < 0 ; then
N ( p 1 , p 2 ) = a 11 2 p 2 ( 1 + t 22 ) a 11 p 1 p 2 t 22 + a 11 a 13 a 31 d + a 13 a 31 p 1 ( t 23 t 32 t 22 t 33 ) > 0 .
Moreover,
N I ( A p ) = N ( p 1 , p 2 ) ( a 11 p 1 ) t 22 ( a 11 p 2 + a 13 a 31 t 33 ) > 0 .
By hypothesis p 2 > a 13 a 31 t 33 a 11 , it follows that a 11 p 2 + a 13 a 31 t 33 < 0 .
Furthermore,
a p 11 ( D ) = a 12 a 21 a 11 2 ( a 11 p 1 ) a 11 p 2 t 22 + a 13 a 31 ( t 23 t 32 + t 22 t 33 ) < 0 .
For the entry a p 12 ( D ) , if p 2 < a 13 a 31 ( t 23 + t 33 ) a 11 , then a 11 p 2 + a 13 a 31 ( t 23 + t 33 ) > 0 , and consequently
a p 12 ( D ) = a 12 a 21 a 11 a 11 p 2 + a 13 a 31 ( t 23 + t 33 ) < 0 .
Moreover,
a p 13 ( D ) = a 12 a 13 a 21 a 31 a 11 ( t 22 t 32 ) < 0 .
For the entry a p 21 ( D ) , if p 2 < a 13 a 31 ( t 32 + t 33 ) a 11 , then a 11 p 2 + a 13 a 31 ( t 32 + t 33 ) > 0 , and therefore
a p 21 ( D ) = a 12 a 21 a 11 a 11 p 2 + a 13 a 31 ( t 32 + t 33 ) < 0 .
We now verify that a p 22 ( D ) is negative:
a p 22 ( D ) = a 12 a 21 t 22 a 11 2 a 11 2 p 2 a 11 p 1 p 2 + a 11 a 13 a 31 ( 1 + t 33 ) a 13 a 31 p 1 t 33 .
Consider
a 11 2 p 2 a 11 p 1 p 2 + a 11 a 13 a 31 ( 1 + t 33 ) a 13 a 31 p 1 t 33 .
Using p 2 > a 13 a 31 t 33 a 11 , we obtain
a 11 p 2 ( a 11 p 1 ) + a 11 a 13 a 31 ( 1 + t 33 ) a 13 a 31 p 1 t 33 > a 11 a 13 a 31 t 33 a 11 ( a 11 p 1 ) + a 11 a 13 a 31 ( 1 + t 33 ) a 13 a 31 p 1 t 33 = a 11 > 0 .
Therefore,
a p 22 ( D ) < 0 .
Furthermore,
a p 23 ( D ) = a 12 a 13 a 21 a 31 t 23 a 11 2 a 11 ( 1 + t 32 ) p 1 t 32 < 0 ,
and
a p 31 ( D ) = a 12 a 13 a 21 a 31 a 11 ( t 22 t 23 ) < 0 ,
a p 32 ( D ) = a 12 a 13 a 21 a 31 a 11 2 a 11 ( 1 + t 23 ) p 1 t 23 t 32 < 0 .
Finally, for the entry a p 33 ( D ) , since p 1 > a 11 ( 1 + t 22 ) t 22 , it follows that a 11 ( 1 + t 22 ) p 1 t 22 < 0 . Moreover, p 2 > a 13 a 31 t 33 a 11 implies a 11 p 2 + a 13 a 31 t 33 < 0 . Hence,
a p 33 ( D ) = a 12 a 21 a 11 2 ( a 11 ( 1 + t 22 ) p 1 t 22 ) ( a 11 p 2 + a 13 a 31 t 33 ) < 0 .
Therefore, all entries of a p i j ( D ) are negative under the stated assumptions. □
  • Case 2: det ( A ) > 0 , a 11 a 12 a 21 a 13 a 31 < 0 , a 11 < 0 , a 12 < 0 , a 13 < 0 , a 21 < 0 and a 31 < 0 . The following propositions correspond to the perturbation patterns analyzed in Section 3. The detailed proofs of Propositions 6–9 are given below for completeness.
  • Proposition 6
Let A = ( a i j ) be the matrix given in (4) such that N I [ A ] < 0 and let U = C ( A ) be a doubly stochastic matrix. Consider the perturbed matrix A p = A + diag ( p 1 , p 2 , 0 ) , with the same structure as in (5), with p 1 , p 2 R , p 1 , p 2 > 0 . If det ( A p ) > 0 , a 11 + p 1 > 0 and
a 11 < p 1 < min a 11 ( 1 t 23 ) t 23 , a 11 ( 1 t 32 ) t 32 , a 12 a 21 ( t 23 t 32 t 22 t 33 ) a 11 t 33 < p 2 ,
then A p satisfies N I [ A p ] > 0 and C ( A p ) is doubly stochastic.
Proof. 
We assume that det ( A p ) = a 13 a 31 a 11 2 N ( p 1 , p 2 ) > 0 ; then
N ( p 1 , p 2 ) = a 11 2 p 2 ( 1 + t 33 ) + a 11 p 1 p 2 t 33 + a 12 a 21 p 1 ( t 23 t 32 t 22 t 33 ) + a 11 a 12 a 21 ( d ) < 0 .
Since a 11 + p 1 > 0 , by hypothesis, we have
N I ( A p ) = N ( p 1 , p 2 ) ( a 11 + p 1 ) ( a 11 p 2 a 12 a 21 t 22 ) t 33 > 0 .
Furthermore,
a p 11 ( D ) = a 13 a 31 a 11 2 ( a 11 + p 1 ) a 11 p 2 t 33 + a 12 a 21 ( t 23 t 32 t 22 t 33 ) > 0 .
Indeed, if p 2 > a 12 a 21 ( t 23 t 32 t 22 t 33 ) a 11 t 33 , then a 11 p 2 t 33 + a 12 a 21 ( t 23 t 32 t 22 t 33 ) < 0 . Moreover,
a p 12 ( D ) = a 12 a 13 a 21 a 31 a 11 ( t 23 t 33 ) > 0 .
Similarly,
a p 13 ( D ) = a 13 a 31 a 11 a 11 p 2 + a 12 a 21 ( t 22 + t 32 ) > 0 .
Also,
a p 21 ( D ) = a 12 a 13 a 21 a 31 a 11 ( t 32 t 33 ) > 0 .
Furthermore,
a p 22 ( D ) = a 13 a 31 a 11 2 ( a 11 p 2 a 12 a 21 t 22 ) ( a 11 ( 1 + t 33 ) + p 1 t 33 ) > 0 .
For the entry a p 23 ( D ) ,
a p 23 ( D ) = a 12 a 13 a 21 a 31 t 23 a 11 2 ( a 11 ( 1 + t 32 ) + p 1 t 32 ) > 0 ,
because p 1 < a 11 ( 1 t 32 ) t 32 , and then a 11 ( 1 + t 32 ) + p 1 t 32 > 0 . Similarly,
a p 31 ( D ) = a 13 a 31 a 11 a 11 p 2 + a 12 a 21 ( t 22 + t 23 ) > 0 .
Moreover,
a p 32 ( D ) = a 12 a 13 a 21 a 31 a 11 2 ( a 11 ( 1 + t 23 ) + p 1 t 23 ) t 32 > 0 ,
because p 1 < a 11 ( 1 t 23 ) t 23 implies a 11 ( 1 + t 23 ) + p 1 t 23 > 0 . Finally,
a p 33 ( D ) = a 13 a 31 a 11 2 a 11 2 p 2 + a 11 p 1 p 2 a 12 a 21 p 1 t 22 + a 11 a 12 ( a 21 a 21 t 22 ) t 33 .
It remains to verify that
a 11 2 p 2 + a 11 p 1 p 2 a 12 a 21 p 1 t 22 + a 11 a 12 a 21 ( 1 t 22 ) < 0 .
Since
a 11 p 2 ( a 11 + p 1 ) a 12 a 21 p 1 t 22 + a 11 a 12 a 21 ( 1 t 22 ) < 0 ,
it follows that
a p 33 ( D ) > 0 .
Therefore, all entries of a p i j ( D ) are positive under the stated assumptions. □
  • Proposition 7
Let A = ( a i j ) be the matrix given in (4) such that N I [ A ] < 0 and let U = C ( A ) be a doubly stochastic matrix. Consider the perturbed matrix A p = A + diag ( p 1 , p 2 , 0 ) , with the same structure as in (5), with p 1 , p 2 R , p 1 , p 2 > 0 . If det ( A p ) > 0 and
a 11 ( t 33 1 ) t 33 < p 1 , a 12 a 21 t 22 a 11 < p 2 < min a 12 a 21 ( t 22 t 23 ) a 11 , a 12 a 21 ( t 22 t 32 ) a 11 ,
then A p satisfies N I [ A p ] > 0 and C ( A p ) is doubly stochastic.
Proof. 
We assume that det ( A p ) = a 13 a 31 a 11 2 N ( p 1 , p 2 ) > 0 ; then
N ( p 1 , p 2 ) = a 11 a 12 a 21 d + a 11 2 p 2 ( 1 + t 33 ) a 11 p 1 p 2 t 33 + a 12 a 21 p 1 ( t 23 t 32 t 22 t 33 ) > 0 .
Moreover,
N I ( A p ) = N ( p 1 , p 2 ) ( a 11 p 1 ) ( a 11 p 2 + a 12 a 21 t 22 ) t 33 > 0 .
Since, by hypothesis, p 2 > a 12 a 21 t 22 a 11 , it follows that a 11 p 2 + a 12 a 21 t 22 < 0 . Furthermore,
a p 11 ( D ) = a 13 a 31 a 11 2 ( a 11 p 1 ) a 11 p 2 t 33 + a 12 a 21 ( t 23 t 32 + t 22 t 33 ) > 0 .
Moreover,
a p 12 ( D ) = a 12 a 13 a 21 a 31 a 11 ( t 23 t 33 ) > 0 ,
and
a p 13 ( D ) = a 13 a 31 a 11 a 11 p 2 + a 12 a 21 ( t 22 t 32 ) > 0 .
Indeed, if p 2 < a 12 a 21 ( t 22 t 32 ) a 11 , then a 11 p 2 + a 12 a 21 ( t 22 t 32 ) > 0 . Similarly,
a p 21 ( D ) = a 12 a 13 a 21 a 31 a 11 ( t 32 t 33 ) > 0 .
Furthermore,
a p 22 ( D ) = a 13 a 31 a 11 2 ( a 11 p 2 + a 12 a 21 t 22 ) ( a 11 ( 1 + t 33 ) p 1 t 33 ) > 0 .
Moreover, p 2 > a 12 a 21 t 22 a 11 implies a 11 p 2 + a 12 a 21 t 22 and p 1 > a 11 ( t 33 1 ) t 33 implies a 11 ( 1 + t 33 ) p 1 t 33 < 0 . Therefore,
a p 22 ( D ) > 0 .
For the entry a p 23 ( D ) ,
a p 23 ( D ) = a 12 a 13 a 21 a 31 t 23 a 11 2 ( a 11 ( 1 + t 32 ) p 1 t 32 ) > 0 ,
because p 1 > a 11 ( 1 t 32 ) t 32 implies a 11 ( 1 + t 32 ) p 1 t 32 > 0 . Similarly,
a p 31 ( D ) = a 13 a 31 a 11 a 11 p 2 + a 12 a 21 ( t 22 t 23 ) > 0 .
Indeed, if p 2 < a 12 a 21 ( t 22 t 23 ) a 11 , then a 11 p 2 + a 12 a 21 ( t 22 t 23 ) > 0 . Moreover,
a p 32 ( D ) = a 12 a 13 a 21 a 31 a 11 2 ( a 11 ( 1 + t 23 ) p 1 t 23 ) t 32 > 0 ,
because p 1 > a 11 ( 1 t 23 ) t 23 implies a 11 ( 1 + t 23 ) p 1 t 23 > 0 . Finally,
a p 33 ( D ) = a 13 a 31 a 11 2 a 11 2 p 2 a 11 p 1 p 2 + a 11 a 12 a 21 ( 1 + t 22 ) a 12 a 21 p 1 t 22 t 33 > 0 .
Indeed, if p 2 > a 12 a 21 a 11 a 11 t 22 + p 1 t 22 a 11 ( a 11 p 1 ) , then ( a 11 2 a 11 p 1 ) p 2 + a 11 a 12 a 21 ( 1 + t 22 ) a 12 a 21 p 1 t 22 > 0 , which is equivalent to
a 11 2 p 2 a 11 p 1 p 2 + a 12 a 21 ( 1 t 22 ) a 12 a 21 p 1 t 22 > 0 .
Therefore,
a p 33 ( D ) > 0 .
Hence all entries of a p i j ( D ) are positive under the stated assumptions. □
  • Proposition 8
Let A = ( a i j ) be the matrix given in (4) such that N I [ A ] < 0 and let U = C ( A ) be a doubly stochastic matrix. Consider the perturbed matrix A p = A + diag ( p 1 , 0 , p 2 ) , with the same structure as in (5), with p 1 , p 2 R , p 1 , p 2 > 0 . If det ( A p ) > 0 , a 11 + p 1 > 0 and
a 11 < p 1 < min a 11 ( 1 t 23 ) t 23 , a 11 ( 1 t 32 ) t 32 , a 13 a 31 ( t 23 t 32 + t 22 t 33 ) a 11 t 22 < p 2 ,
then A p satisfies N I [ A p ] > 0 and C ( A p ) is doubly stochastic.
Proof. 
We assume that det ( A p ) = a 12 a 21 a 11 2 N ( p 1 , p 2 ) > 0 ; then
N ( p 1 , p 2 ) = a 11 2 p 2 ( 1 + t 22 ) + a 11 p 1 p 2 t 22 + a 13 a 31 p 1 ( t 23 t 32 t 22 t 33 ) + a 11 a 13 a 31 ( d ) < 0 .
Moreover,
N I ( A p ) = N ( p 1 , p 2 ) ( a 11 + p 1 ) t 22 ( a 11 p 2 a 13 a 31 t 33 ) > 0 ,
since, by hypothesis, a 11 + p 1 > 0 , the denominator has the required sign. Furthermore,
a p 11 ( D ) = a 12 a 21 a 11 2 ( a 11 + p 1 ) a 11 p 2 t 22 + a 13 a 31 ( t 23 t 32 t 22 t 33 ) > 0 .
Indeed, if p 2 > a 13 a 31 ( t 23 t 32 + t 22 t 33 ) a 11 t 22 , then a 11 p 2 t 22 + a 13 a 31 ( t 23 t 32 t 22 t 33 ) < 0 . Moreover,
a p 12 ( D ) = a 12 a 21 a 11 a 11 p 2 + a 13 a 31 ( t 23 t 33 ) > 0 ,
and
a p 13 ( D ) = a 12 a 13 a 21 a 31 a 11 ( t 22 t 32 ) > 0 .
Similarly,
a p 21 ( D ) = a 12 a 21 a 11 a 11 p 2 + a 13 a 31 ( t 32 t 33 ) > 0 .
Furthermore,
a p 22 ( D ) = a 12 a 21 t 22 a 11 2 a 11 2 p 2 + a 11 p 1 p 2 a 13 a 31 p 1 t 33 + a 11 a 13 ( a 31 a 31 t 33 ) > 0 .
It remains to verify that
a 11 2 p 2 + a 11 p 1 p 2 a 13 a 31 p 1 t 33 + a 11 a 13 ( a 31 a 31 t 33 ) < 0 .
Indeed,
a 11 p 2 ( a 11 + p 1 ) a 13 a 31 p 1 t 33 + a 11 a 13 a 31 ( 1 t 33 ) < 0 ,
and therefore
a p 22 ( D ) > 0 .
For the entry a p 23 ( D ) ,
a p 23 ( D ) = a 12 a 13 a 21 a 31 t 23 a 11 2 ( a 11 ( 1 + t 32 ) + p 1 t 32 ) > 0 ,
because p 1 < a 11 ( 1 t 32 ) t 32 implies a 11 ( 1 + t 32 ) + p 1 t 32 > 0 . Moreover,
a p 31 ( D ) = a 12 a 13 a 21 a 31 a 11 ( t 22 t 23 ) > 0 .
Similarly,
a p 32 ( D ) = a 12 a 13 a 21 a 31 a 11 2 ( a 11 ( 1 + t 23 ) + p 1 t 23 ) t 32 > 0 ,
because p 1 < a 11 ( 1 t 23 ) t 23 implies a 11 ( 1 + t 23 ) + p 1 t 23 > 0 . Finally,
a p 33 ( D ) = a 12 a 21 a 11 2 ( a 11 ( 1 + t 22 ) + p 1 t 22 ) ( a 11 p 2 a 13 a 31 t 33 ) > 0 .
Indeed, a 11 ( 1 + t 22 ) + p 1 t 22 > 0 , and since
p 2 > a 13 a 31 ( t 23 t 32 + t 22 t 33 ) a 11 t 22 > a 13 a 31 t 33 a 11 ,
it follows that a 11 p 2 a 13 a 31 t 33 < 0 . Therefore,
a p 33 ( D ) > 0 .
Hence all entries of a p i j ( D ) are positive under the stated assumptions. □
  • Proposition 9
Let A = ( a i j ) be the matrix given in (4) such that N I [ A ] < 0 and let U = C ( A ) be a doubly stochastic matrix. Consider the perturbed matrix A p = A + diag ( p 1 , 0 , p 2 ) , with the same structure as in (5), with p 1 , p 2 R , p 1 , p 2 > 0 . If det ( A p ) > 0 and
a 11 ( t 22 1 ) t 22 < p 1 a 13 a 31 t 33 a 11 < p 2 < min a 13 a 31 ( t 33 t 32 ) a 11 , a 13 a 31 ( t 33 t 23 ) a 11 ,
then A p satisfies N I [ A p ] > 0 and C ( A p ) is doubly stochastic.
Proof. 
We assume det ( A p ) = a 12 a 21 N ( p 1 , p 2 ) a 11 2 > 0 ; then
N ( p 1 , p 2 ) = a 11 2 p 2 ( 1 + t 22 ) a 11 p 1 p 2 t 22 + a 11 a 13 a 31 ( d ) + a 13 a 31 p 1 ( t 23 t 32 t 22 t 33 ) > 0
Since by hypothesis p 2 > a 13 a 31 t 33 a 11 a 11 p 2 + a 13 a 31 t 33 < 0 and we conclude that
N I ( A p ) = N ( p 1 , p 2 ) ( a 11 p 1 ) t 22 ( a 11 p 2 + a 13 a 31 t 33 ) > 0
a p 11 ( D ) = a 12 a 21 + ( a 11 p 1 ) a 11 p 2 t 22 + a 13 a 31 ( t 23 t 32 + t 22 t 33 ) a 11 2 > 0
a p 12 ( D ) = a 12 a 21 ( a 11 p 2 + a 13 a 31 ( t 23 + t 33 ) ) a 11 > 0
since
p 2 < a 13 a 31 ( t 23 + t 33 ) a 11 a 11 p 2 + a 13 a 31 ( t 23 + t 33 ) > 0 .
a p 13 ( D ) = a 12 a 13 a 21 a 31 ( t 22 t 32 ) a 11 > 0
a p 21 ( D ) = a 12 a 21 ( a 11 p 2 + a 13 a 31 ( t 32 + t 33 ) ) a 11 > 0
since
p 2 < a 13 a 31 ( t 32 + t 33 ) a 11 a 11 p 2 + a 13 a 31 ( t 32 + t 33 ) > 0 .
a p 22 ( D ) = a 12 a 21 t 22 a 11 2 p 2 a 11 p 1 p 2 + a 11 a 13 a 31 ( 1 + t 33 ) a 13 a 31 p 1 t 33 a 11 2
thus we ask:
a 11 2 p 2 a 11 p 1 p 2 + a 11 a 13 a 31 ( 1 + t 33 ) a 13 a 31 p 1 t 33 > 0 ?
Or equivalently:
a 11 p 2 ( a 11 p 1 ) + a 13 a 31 a 11 ( 1 + t 33 ) p 1 t 33 > 0 ?
Since p 2 > a 13 a 31 t 33 a 11 , we have
a 11 p 2 ( a 11 p 1 ) + a 13 a 31 a 11 ( 1 + t 33 ) p 1 t 33 > a 11 a 13 a 31 t 33 a 11 ( a 11 p 1 ) + a 13 a 31 a 11 ( 1 + t 33 ) p 1 t 33 = a 11 > 0 .
a p 23 ( D ) = a 12 a 13 a 21 a 31 t 23 a 11 ( 1 + t 32 ) p 1 t 32 a 11 2 > 0
a p 31 ( D ) = a 12 a 13 a 21 a 31 ( t 22 t 23 ) a 11 > 0
a p 32 ( D ) = a 12 a 13 a 21 a 31 a 11 ( 1 + t 23 ) p 1 t 23 t 32 a 11 2
a p 33 ( D ) = a 12 a 21 a 11 ( 1 + t 22 ) p 1 t 22 ( a 11 p 2 + a 13 a 31 t 33 ) a 11 2 .
Since
p 2 > a 13 a 31 t 33 a 11 a 11 p 2 + a 13 a 31 t 33 < 0
and
p 1 > a 11 ( 1 + t 22 ) t 22 a 11 ( 1 + t 22 ) p 1 t 22 < 0 ,
we have a p 33 ( D ) > 0 . □

References

  1. Skogestad, S.; Postlethwaite, I. Multivariable Feedback Control: Analysis and Design, 2nd ed.; Wiley: Hoboken, NJ, USA, 2005. [Google Scholar]
  2. Seborg, D.E.; Edgar, T.F.; Mellichamp, D.A.; Doyle, F.J. Process Dynamics and Control, 3rd ed.; Wiley: Hoboken, NJ, USA, 2011. [Google Scholar]
  3. Bristol, E. On a new measure of interaction for multivariable process control. IEEE Trans. Autom. Contr. 1966, 11, 133–134. [Google Scholar] [CrossRef]
  4. Niederlinski, A. Heuristic Approach to the Design of Linear Multivariable Interacting Control Systems. Automatica 1971, 7, 691–701. [Google Scholar] [CrossRef]
  5. Chiu, M.S.; Arkun, Y. Decentralized control structure selection based on integrity considerations. Ind. Eng. Chem. Res. 1990, 29, 369–373. [Google Scholar] [CrossRef]
  6. Cantó, B.; Cantó, R.; Gassó, M.T.; Urbano, A.M. Doubly stochastic and combined matrices. Linear Multilinear Algebra 2024, 73, 1886–1901. [Google Scholar] [CrossRef]
  7. Bru, R.; Gassó, M.T.; Giménez, I.; Santana, M. Nonnegative combined matrices. J. Appl. Math. 2014, 2014, 182354. [Google Scholar] [CrossRef]
  8. Uhlmann, J. On the Relative Gain Array (RGA) with singular and rectangular matrices. Appl. Math. Lett. 2019, 93, 52–57. [Google Scholar] [CrossRef]
  9. Boix, M.; Cantó, B.; Gassó, M.T. Stability of a reactor with Niederlinski criterion using RGA matrices. J. Math. Chem. 2025, 63, 210–221. [Google Scholar] [CrossRef]
  10. Ding, X.; Lu, Q.; Zhang, Y.; Li, G.; Gao, X.; Ye, N. Few-Shot Recognition and Classification Framework for Jamming Signal: A CGAN-Based Fusion CNN Approach. IEEE Trans. Veh. Technol. 2026, 1–16. [Google Scholar] [CrossRef]
Figure 1. Evolution of the Niederlinski index N I [ A p ] as a function of p 1 for different diagonal perturbation patterns. The horizontal dashed line represents the stability boundary ( N I = 0 ). The transition from negative to positive values illustrates the stabilization effect, while the different curve profiles reflect the varying sensitivity associated with each perturbation configuration.
Figure 1. Evolution of the Niederlinski index N I [ A p ] as a function of p 1 for different diagonal perturbation patterns. The horizontal dashed line represents the stability boundary ( N I = 0 ). The transition from negative to positive values illustrates the stabilization effect, while the different curve profiles reflect the varying sensitivity associated with each perturbation configuration.
Axioms 15 00507 g001
Table 1. Key notation and mathematical or engineering interpretation of symbols.
Table 1. Key notation and mathematical or engineering interpretation of symbols.
SymbolMathematical/Engineering Interpretation
ASteady-state gain matrix of the MIMO proces.
a i j Entry of matrix A that representes the influence of input j on output i.
Hadamard product; entrywise matrix multiplication.
C ( A ) Combined matrix; Relative Gain Array (RGA), quantifies loop interactions.
UDoubly stochastic matrix, representing balanced interactions.
N I [ A ] Niederlinski index. Structural indicator for stability.
TNormalized representative of the system interaction structure.
P ( x ) Polynomial defining canonical roots for the system.
x 1 , x 2 Root of P ( x ) , parameter identifying the specific interaction pattern.
A p Perturbed system matrix after local adjustments.
p 1 , p 2 R Perturbed parameters; tuning parameters (PID gains, actuator sensitivities).
a p i j ( D ) Entries of A p ( D ) = C ( A p ) det ( A p ) . It is used to verify the structure.
Table 2. Summary of admissible diagonal perturbation patterns ensuring stabilization and preservation of the doubly stochastic structure.
Table 2. Summary of admissible diagonal perturbation patterns ensuring stabilization and preservation of the doubly stochastic structure.
ResultPerturbation sign ( det ( A p ) ) Required Sign
Theorem 4 A + diag ( p 1 , p 2 , 0 ) a p i j ( D ) < 0
Proposition 3 A + diag ( p 1 , p 2 , 0 ) a p i j ( D ) < 0
Proposition 4 A + diag ( p 1 , 0 , p 2 ) a p i j ( D ) < 0
Proposition 5 A + diag ( p 1 , 0 , p 2 ) a p i j ( D ) < 0
Proposition 6 A + diag ( p 1 , p 2 , 0 ) + a p i j ( D ) > 0
Proposition 7 A + diag ( p 1 , p 2 , 0 ) + a p i j ( D ) > 0
Proposition 8 A + diag ( p 1 , 0 , p 2 ) + a p i j ( D ) > 0
Proposition 9 A + diag ( p 1 , 0 , p 2 ) + a p i j ( D ) > 0
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

Boix, M.; Cantó, B. Stability Conditions in Multiple-Input Multiple-Output Systems. Axioms 2026, 15, 507. https://doi.org/10.3390/axioms15070507

AMA Style

Boix M, Cantó B. Stability Conditions in Multiple-Input Multiple-Output Systems. Axioms. 2026; 15(7):507. https://doi.org/10.3390/axioms15070507

Chicago/Turabian Style

Boix, Macarena, and Begoña Cantó. 2026. "Stability Conditions in Multiple-Input Multiple-Output Systems" Axioms 15, no. 7: 507. https://doi.org/10.3390/axioms15070507

APA Style

Boix, M., & Cantó, B. (2026). Stability Conditions in Multiple-Input Multiple-Output Systems. Axioms, 15(7), 507. https://doi.org/10.3390/axioms15070507

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