Resnet-1DCNN-REA bearing fault diagnosis method based on multi-source and multi-modal information fusion

1.   Introduction

In 1999, Fallat and Johnson ^[1] introduced the concept of $k$-subdirect sums of square matrices, which generalizes the usual sum and the direct sum of matrices ^[2], and has potential applications in several contexts such as matrix completion problems ^[3,4,5], overlapping subdomains in domain decomposition methods ^[6,7,8], and global stiffness matrices in finite elements ^[7,9], etc.

Definition 1.1. ^[1] Let $A\in\mathbb{C}^{n_1\times n_1}$ and $B\in\mathbb{C}^{n_2\times n_2}$, and $k$ be an integer such that $1\leq k \leq \min\{n_1, n_2\}$. Suppose that

where $A_{22}$ and $B_{11}$ are square matrices of order $k$. Then

is called the $k$-subdirect sum of $A$ and $B$ and is denoted by $C = A\bigoplus_k B$.

For the $k$-subdirect sums of matrices, one of the important problems is that if $A$ and $B$ lie in a certain subclass of $H$-matrices must a $k$-subdirect sum $C$ lie in this class, since it can be used to analyze the convergence of Jacobi and Gauss-Seidel methods in solving the linearized system of nonlinear equations ^[10]. Here, a square matrix $A$ is called an $H$-matrix if there exists a positive diagonal matrix $X$ such that $AX$ is a strictly diagonally dominant matrix ^[11]. To answer this question, several results about subdirect sum problems for $H$-matrices and some subclasses of $H$-matrices have been obtained, such as $S$-strictly diagonally dominant matrices ^[12], doubly diagonally dominant matrices ^[13], $\Sigma$-strictly diagonally dominant matrices ^[14], $\alpha_1$ and $\alpha_2$-matrices ^[15], Nekrasov matrices ^[16], weakly chained diagonally dominant matrices ^[17], $QN$-(quasi-Nekrasov) matrices ^[18], SDD($p$)-matrices ^[10], and $H$-matrices ^[19]. Besides, the subdirect sum problems for some other structure matrices, including $B$-matrices, $B_{\pi}^{R}$-matrices, $P$-matrices, doubly non-negative matrices, completely positive matrices, and totally non-negative matrices, were also studied; for details, see ^[1,20,21,22] and references therein.

In 2009, Cvetković, Kostić, and Rauški ^[23] introduced a new subclass of $H$-matrices called $S$-Nekrasov matrices.

Definition 1.2. ^[23] Given any nonempty proper subset $S$ of $N: = \{1, 2, \ldots, n\}$ and $\overline{S} = N \setminus S$. A matrix $A = [a_{ij}]\in \mathbb{C}^{n\times n}$ is called an $S$-Nekrasov matrix if $|a_{ii}| > h_i^{S}(A)$ for all $i\in S$, and

where $h_1^{S}(A) = \sum\limits_j\in S\setminus \{1\} |a_{1j}|$ and

Specially, if $S = N$, then Definition 1.2 coincides with the definition of Nekrasov matrices ^[23], that is, a matrix $A = [a_{ij}]\in \mathbb{C}^{n\times n}$ is called a Nekrasov matrix if $|a_{ii}| > h_i(A)$ for all $i\in N$, where $h_i(A): = h_i^{N}(A)$. It is worth noticing that the class of $S$-Nekrasov matrices has many potential applications in scientific computing, such as estimating the infinity norm for the inverse of $S$-Nekrasov matrices ^[24], estimating error bounds for linear complementarity problems ^[25,26,27], and identifying nonsingular $H$-tensors ^[28], etc. However, to the best of the author's knowledge, the subdirect sum problem for $S$-Nekrasov matrices remains unclear. In this paper, we introduce the class of $\{i_0\}$-Nekrasov matrices and prove that it is a subclass of $S$-Nekrasov matrices, and then we focus on the subdirect sum problem of $\{i_0\}$-Nekrasov matrices. We provide some sufficient conditions such that the $k$-subdirect sum of $\{i_0\}$-Nekrasov matrices and Nekrasov matrices belongs to the class of $\{i_0\}$-Nekrasov matrices. Numerical examples are presented to illustrate the corresponding results.

2.   Subdirect sums of $\{i_0\}$-Nekrasov matrices

We start with some notations and definitions. For a non-zero complex number $z$, we define $\mathrm{arg}(z) = \{\theta: z = |z|\mathrm{exp}(i \theta), -\pi < \theta\leq \pi\}$. As is shown in ^[12], if we let $C = A\bigoplus_k B = [c_{ij}]$, where $A = [a_{ij}]\in \mathbb{C}^{n_1\times n_1}$ and $B = [b_{ij}]\in \mathbb{C}^{n_2\times n_2}$, then

where $t = n_1-k$ and

with $n = n_1+n_2-k$. Obviously, $S_1\bigcup S_2 \bigcup S_3 = N$.

We introduce the following subclass of $S$-Nekrasov matrices by requiring $S$ is a singleton.

Definition 2.1. A matrix $A = [a_{ij}] \in \mathbb{C}^{n\times n}$ is called an $\{i_0\}$-Nekrasov matrix if there exists $i_0\in N$ such that $|a_{i_0, i_0}| > \eta_{i_0}(A)$, and that for all $j\in N\setminus \{i_0\}$,

where $\eta_i(A) = 0$ for all $i\in N$ if $i_0 = 1$, otherwise, $\eta_1(A) = |a_{i, i_0}|$ and

Remark 2.1. (i) If $A$ is an $\{i_0\}$-Nekrasov matrix, then $A$ is an $S$-Nekrasov matrix for $S = \{i_0\}$. In fact, using recursive relations (1.2) and (2.2), it follows that $h_{i_0}^{S}(A) = 0 = \eta_{i_0}(A)$ if $i_0 = 1$, otherwise, $h_1^{S}(A) = \eta_1(A)$ and

In addition, $h_i^{\overline{S}}(A) = h_{i}(A)-\eta_i(A)$ follows from the fact that $h_{i}(A) = h_i^{S}(A)+h_i^{\overline{S}}(A)$ for each $i\in N$. These imply that an $\{i_0\}$-Nekrasov matrix is an $S$-Nekrasov matrix for $S = \{i_0\}$.

(ii) Since a Nekrasov matrix is an $S$-Nekrasov matrices for any $S$, it follows that a Nekrasov matrix is an $\{i_0\}$-Nekrasov matrices.

The following example shows that the $k$-subdirect sum of two $\{i_0\}$-Nekrasov matrices may not be an $\{i_0\}$-Nekrasov matrix in general.

Example 2.1. Consider the $\{i_0\}$-Nekrasov matries $A$ and $B$ for $i_0 = 2$, where

Then, the $3$-subdirect sum $C = A\bigoplus_3 B$ gives

It is easy to check that $C = A\bigoplus_3 B$ is not an $\{i_0\}$-Nekrasov matrix for neither one index $i_0$. This motivates us to seek some simple conditions such that $C = A \bigoplus_k B$ for any $k$ is an $\{i_0\}$-Nekrasov matrix. First, we provide the following conditions such that $A \bigoplus_1 B$ is an $\{i_0\}$-Nekrasov matrix, where $A$ is an $\{i_0\}$-Nekrasov matrix and $B$ is a Nekrasov matrix.

Theorem 2.1. Let $A = [a_{ij}]\in \mathbb{C}^{n_1\times n_1}$ be an $\{i_0\}$-Nekrasov matrix with $i_0\in S_1$ and $B = [b_{ij}]\in \mathbb{C}^{n_2\times n_2}$ be a Nekrasov matrix, partitioned as in (1.1), which defines the sets $S_1$, $S_2$ and $S_3$ as in (2.1), and let $t = n_1-1$. If arg($a_{ii}$) = arg($b_{i-t, i-t}$) for all $i\in S_2$ and $B_{21} = 0$, then the $1$-subdirect sum $C = A\bigoplus _1 B$ is an $\{i_0\}$-Nekrasov matrix.

Proof. Since $A$ is an $\{i_0\}$-Nekrasov matrix and $i_0\in S_1$, it follows that if $i_0 = 1$ then $|c_{11}| = |a_{11}| > \eta_{1}(A) = 0 = \eta_{1}(C)$, otherwise,

Case 1: For $i\in S_1$, we have

and if $i_0 = 1$, then $\eta_i(C) = 0 = \eta_i(A)$, and if $i_0\neq 1$, then $\eta_1(C) = |c_{i, i_0}| = |a_{i, i_0}| = \eta_1(A)$ and

Hence, for all $j\in S_1\setminus\{i_0\}$,

Case 2: For $i\in S_2 = \{n_1\}$, we have

and

So,

Case 3: For $i\in S_3 = \{n_1+1, \ldots, n\}$, we have

It follows from $B_{21} = 0$ that

and for each $i = n_1+2, \ldots, n$,

So, for all $j\in S_3$,

The conclusion follows from (2.3), Case 1–3.

Next, we give some conditions such that $C = A \bigoplus_k B$ for any $k$ is an $\{i_0\}$-Nekrasov matrix, where $A$ is an $\{i_0\}$-Nekrasov matrix and $B$ is a Nekrasov matrix. First, a lemma is given which will be used in the sequel.

Lemma 2.1. Let $A = [a_{ij}]\in \mathbb{C}^{n_1\times n_1}$ be an $\{i_0\}$-Nekrasov matrix with $i_0\in S_1\cup S_2$ and $B = [b_{ij}]\in \mathbb{C}^{n_2\times n_2}$ be a Nekrasov matrix, partitioned as in (1.1), $k$ be an integer such that $1\leq k \leq {min}\{n_1, n_2\}$, which defines the sets $S_1$, $S_2$ and $S_3$ as in (2.1), let $t = n_1-k$ and $C = A\bigoplus _k B$. If arg($a_{ii}$) = arg($b_{i-t, i-t}$) for all $i\in S_2$, $B_{12} = 0$, and $|a_{ij}+b_{i-t, j-t}|\leq|a_{ij}|$ for $i\neq j, \; i, j\in S_2$, then

Proof. If $i_0\in S_1$, then it follows from the proof of Case I in Theorem 2.1 that $h_{i}(C)-\eta_{i}(C) = h_{i}(A)-\eta_{i}(A)$ for all $i\in S_1$, and thus $h_{i_0}(C)-\eta_{i_0}(C) = h_{i_0}(A)-\eta_{i_0}(A)$.

If $i_0\in S_2 = \{n_1-k+1, \ldots, n_1\}$, then from the assumptions and $t = n_1-k$ we have

Suppose that $h_{i}(C)-\eta_{i}(C)\leq h_{i}(A)-\eta_{i}(A)$ for all $i < t+m$, where $m$ is a positive integer and $1 < m\leq k$. We next prove that $h_{t+m}(C)-\eta_{t+m}(C)\leq h_{t+m}(A)-\eta_{t+m}(A)$. Since

it follows that $h_{i}(C)-\eta_{i}(C)\leq h_{i}(A)-\eta_{i}(A)$ for all $i\in S_2$. Hence, $h_{i_0}(C)-\eta_{i_0}(C)\leq h_{i_0}(A)-\eta_{i_0}(A)$. The proof is complete.

Theorem 2.2. Let $A = [a_{ij}]\in \mathbb{C}^{n_1\times n_1}$ be an $\{i_0\}$-Nekrasov matrix with $i_0\in S_1$ and $B = [b_{ij}]\in \mathbb{C}^{n_2\times n_2}$ be a Nekrasov matrix, partitioned as in (1.1), $k$ be an integer such that $1\leq k \leq {min}\{n_1, n_2\}$, which defines the sets $S_1$, $S_2$ and $S_3$ as in (2.1), and let $t = n_1-k$. If arg($a_{ii}$) = arg($b_{i-t, i-t}$) for all $i\in S_2$, $A_{21} = 0$, and $|a_{ij}+b_{i-t, j-t}|\leq|b_{i-t, j-t}|$ for $i\neq j, \; i, j\in S_2$, then the $k$-subdirect sum $C = A\bigoplus _k B$ is an $\{i_0\}$-Nekrasov matrix.

Proof. Since $A$ is an $\{i_0\}$-Nekrasov matrix and $i_0\in S_1$, it is obvious that $|c_{i_0, i_0}| > \eta_{i_0}(C)$.

Case 1: For $i\in S_1$, since $h_i(C) = h_i(A)$ and $\eta_i(C) = \eta_i(A)$, it holds that for all $j\in S_1\setminus \{i_0\}$,

Case 2: For $i\in S_2$, by the assumptions, we have

Similarly, for $i = n_1-k+2, \ldots, n_1$,

And for $i = n_1-k+1$, by $A_{21} = 0$,

implying that for all $i\in S_2$,

So, for all $j\in S_2$,

Analogously to the proof of Case 2, we can easily obtain that $(2.4)$ holds for all $j\in S_3$. Combining with Case 1 and Case 2, the conclusion follows.

Example 2.2. Consider the following matrices:

It is easy to verify that $A$ is an $\{i_0\}$-Nekrasov matrix for $i_0\in S_1 = \{1, 2\}$ and $B$ is a Nekrasov matrix, which satisfy the hypotheses of Theorem 2.2. So, by Theorem 2.2, $A\bigoplus _2 B$ is an $\{i_0\}$-Nekrasov matrix for $i_0\in S_1 = \{1, 2\}$. In fact, let $C = A\bigoplus_2 B$. Then,

and from Definition 2.1, one can verify that $C$ is an $\{i_0\}$-Nekrasov matrix for $i_0\in S_1 = \{1, 2\}$.

Theorem 2.3. Let $A = [a_{ij}]\in \mathbb{C}^{n_1\times n_1}$ be an $\{i_0\}$-Nekrasov matrix with $i_0\in S_1\cup S_2$ and $B = [b_{ij}]\in \mathbb{C}^{n_2\times n_2}$ be a Nekrasov matrix, partitioned as in (1.1), $k$ be an integer such that $1\leq k \leq {min} \{n_1, n_2\}$, which defines the sets $S_1$, $S_2$ and $S_3$ as in (2.1), and let $t = n_1-k$. If arg($a_{ii}$) = arg($b_{i-t, i-t}$) for all $i\in S_2$, $B_{12} = B_{21} = 0$, and $|a_{ij}+b_{i-t, j-t}|\leq|a_{ij}|$ for $i\neq j, \; i, j\in S_2$, then the $k$-subdirect sum $C = A\bigoplus _k B$ is an $\{i_0\}$-Nekrasov matrix.

Proof. Since $A$ is an $\{i_0\}$-Nekrasov matrix, it follows that if $i_0\in S_1$, then $|c_{i_0, i_0}| > \eta_{i_0}(C)$, and if $i_0\in S_2$, then

Similarly, we can obtain that $\eta_{j}(C)\leq \eta_{j}(A)$ for all $j\in \{n_1-k+2, \ldots, n_1\}$. Therefore,

and

Case 1: For $i\in S_1$, proceeding as in the proof of Case 1 in Theorem 2.1, we have $h_i(C) = h_i(A)$ and $\eta_i(C) = \eta_i(A)$, which implies that for all $j\in S_1\setminus \{i_0\}$,

Case 2: For $i\in S_2$, by the assumptions, we have

and

Hence, by Lemma 2.1, it follows that for all $j\in S_2\setminus \{i_0\}$,

Case 3: For $i\in S_3$, similarly to the proof of Case 3 in Theorem 2.1, we show that for all $i\in S_3$,

which implies that for all $j\in S_3$,

From the above three cases, the conclusion follows.

Example 2.3. Consider the following matrices:

where $A$ is an $\{i_0\}$-Nekrasov matrix for $i_0\in S_1\cup S_2 = \{1, 2, 3, 4\}$ and $B$ is a Nekrasov matrix, and they satisfy the hypotheses of Theorem 2.3. Then, from Theorem 2.3, we get that the 3-subdirect sum $C = A\bigoplus_3 B$ is also an $\{i_0\}$-Nekrasov matrix for $i_0\in S_1\cup S_2 = \{1, 2, 3, 4\}$. Actually, by Definition 2.1, one can check that

is an $\{i_0\}$-Nekrasov matrix for $i_0\in S_1\cup S_2 = \{1, 2, 3, 4\}$.

Theorem 2.4. Let $A = [a_{ij}]\in \mathbb{C}^{n_1\times n_1}$ be an $\{i_0\}$-Nekrasov matrix for some $i_0\in S_2$ and $B = [b_{ij}]\in \mathbb{C}^{n_2\times n_2}$ be a Nekrasov matrix, partitioned as in (1.1), $k$ be an integer such that $1\leq k \leq {min}\{n_1, n_2\}$, which defines the sets $S_1$, $S_2$ and $S_3$ as in (2.1), and let $t = n_1-k$. If

(i) arg($a_{ii}$) = arg($b_{i-t, i-t}$) for all $i\in S_2$,

(ii) $B_{12} = 0$, $h_i(A)\leq h_{i-t}(B)$, $\eta_i(A)\leq \eta_{i-t}(B)$, and $|a_{ij}+b_{i-t, j-t}|\leq|a_{ij}|$ for $i\neq j, \; i, j\in S_2$,

(iii) $(h_{i_{0}-t}(B)-\eta_{i_0-t}(B))(|a_{i_0, i_0}|-\eta_{i_0}(A))\geq (|b_{i_0-t, i_0-t}|-\eta_{i_0-t}(B))(h_{i_0}(A)-\eta_{i_0}(A))$,

then the $k$-subdirect sum $C = A\bigoplus _k B$ is an $\{i_0\}$-Nekrasov matrix.

Proof. Due to $A$ is an $\{i_0\}$-Nekrasov matrix and $i_0\in S_2$, it follows from the proof of Case 2 in Theorem 2.3 that $\eta_{i}(C)\leq\eta_{i}(A)$ for all $i\in S_2$, which leads to

Case 1: For $i\in S_1$, it is obvious that $h_i(C) = h_i(A)$ and $\eta_i(C) = \eta_i(A)$. Hence, for all $j\in S_1$,

Case 2: For $i\in S_2$, it follows from $B_{12} = 0$ and $|a_{ij}+b_{i-t, j-t}|\leq|a_{ij}|$ for $i\neq j, \; i, j\in S_2$ that $h_i(C)\leq h_i(A)$, and thus for all $j\in S_2\setminus\{i_0\}$, (2.5) also holds.

Case 3: For $i = n_1+1\in S_3$, by the assumption, it follows that

which recursively yields that for $i = n_1+2, \ldots, n$,

Similarly, we have

and for all $i = n_1+2, \ldots, n$,

Hence, for all $j\in S_3$,

From Case 1, Case 2 and Case 3, we can conclude that $C = A \bigoplus_k B$ is an $\{i_0\}$-Nekrasov matrix.

Example 2.4. Consider the following matrices:

where $A$ is an $\{i_0\}$-Nekrasov matrix for $i_0 = 2$ and $B$ is a Nekrasov matrix. By computation, we have $h_1(A) = 3, h_2(A) = 5$, $h_3(A) = 1.25, h_4(A) = 0.75$, $h_1(B) = 5, h_2(B) = 1.5556, h_3(B) = 0.8667, h_4(B) = 0$, $\eta_1(A) = 1, \eta_2(A) = 0.3333, \eta_3(A) = 0.0167, \; \eta_4(A) = 0.1767$, $\eta_1(B) = 4, \eta_2(B) = 0.4444, \eta_3(B) = 0.5333$, and $\eta_4(B) = 0$, which satisfy the hypotheses of Theorem 2.4. Hence, from Theorem 2.4, we have that $A\bigoplus _3 B$ is also an $\{i_0\}$-Nekrasov matrix for $i_0 = 2$. In fact, let $C = A\bigoplus_3 B$. Then

and one can verify that $C$ is an $\{i_0\}$-Nekrasov matrix for $i_0 = 2$ from Definition 2.1.

3.   Conclusions

In this paper, for an $\{i_0\}$-Nekrasov matrix $A$ as a subclass of $S$-Nekrasov matrices and a Nekrasov matrix $B$, we provide some sufficient conditions such that the $k$-subdirect sum $A\bigoplus_k B$ lies in the class of $\{i_0\}$-Nekrasov matrices. Numerical examples are included to illustrate the advantages of the given conditions. {The results obtained here have potential applications in some scientific computing problems such as matrix completion problem and the convergence of iterative methods for large sparse linear systems. For instance, consider large scale linear systems

Note that if the coefficient matrix $C$ in (3.1) is an $H$-matrix, then the iterative methods of Jacobi and Gauss-Seidel associated with (3.1) are both convergent ^[29], but it is not easy to determine $C$ as an $H$-matrix in general. However, if $C$ is exactly the subdirect sum of matrices $A$ and $B$, i.e., $C = A\bigoplus_k B$, where $A$ and $B$ satisfy the sufficient conditions given here, then it is easy to see that $C$ is an $\{i_0\}$-Nekrasov matrix, and thus an $H$-matrix.

Acknowledgments

The author wishes to thank the three anonymous referees for their valuable suggestions to improve the paper. The research was supported by the National Natural Science Foundation of China (31600299), the Natural Science Foundations of Shaanxi province, China (2020JM-622), and the Projects of Baoji University of Arts and Sciences (ZK2017095, ZK2017021).

Conflict of interest

The author declares no conflict of interest.