Diet in Gestational Diabetes Mellitus is important — but much remains to be done!

Sangeetha Shyam; Amutha Ramadas; Sangeetha Shyam; Amutha Ramadas

doi:10.3934/medsci.2019.1.128

AIMS Medical Science

2019, Volume 6, Issue 1: 128-131. doi: 10.3934/medsci.2019.1.128

Previous Article Next Article

Editorial Special Issues

Diet in Gestational Diabetes Mellitus is important — but much remains to be done!

Sangeetha Shyam ^{1
,
,},
Amutha Ramadas ²

1.
Nutrition and Dietetics, School of Health Sciences, International Medical University, Malaysia
2.
Jeffrey Cheah School of Medicine & Health Sciences, Monash University Malaysia, Malaysia

Received: 19 February 2019 Accepted: 20 February 2019 Published: 20 February 2019

Citation: Sangeetha Shyam, Amutha Ramadas. Diet in Gestational Diabetes Mellitus is important — but much remains to be done![J]. AIMS Medical Science, 2019, 6(1): 128-131. doi: 10.3934/medsci.2019.1.128

Related Papers:

[1]	Xiaoyong Chen, Yating Li, Liang Liu, Yaqiang Wang . Infinity norm upper bounds for the inverse of $ SDD_1 $ matrices. AIMS Mathematics, 2022, 7(5): 8847-8860. doi: 10.3934/math.2022493
[2]	Lanlan Liu, Yuxue Zhu, Feng Wang, Yuanjie Geng . Infinity norm bounds for the inverse of $ SDD_1^{+} $ matrices with applications. AIMS Mathematics, 2024, 9(8): 21294-21320. doi: 10.3934/math.20241034
[3]	Dizhen Ao, Yan Liu, Feng Wang, Lanlan Liu . Schur complement-based infinity norm bounds for the inverse of $ S $-Sparse Ostrowski Brauer matrices. AIMS Mathematics, 2023, 8(11): 25815-25844. doi: 10.3934/math.20231317
[4]	Yingxia Zhao, Lanlan Liu, Feng Wang . Error bounds for linear complementarity problems of $ SD{{D}_{1}} $ matrices and $ SD{{D}_{1}} $-$ B $ matrices. AIMS Mathematics, 2022, 7(7): 11862-11878. doi: 10.3934/math.2022662
[5]	Xinnian Song, Lei Gao . CKV-type $ B $-matrices and error bounds for linear complementarity problems. AIMS Mathematics, 2021, 6(10): 10846-10860. doi: 10.3934/math.2021630
[6]	Fatih Yılmaz, Aybüke Ertaş, Samet Arpacı . Some results on circulant matrices involving Fibonacci polynomials. AIMS Mathematics, 2025, 10(4): 9256-9273. doi: 10.3934/math.2025425
[7]	Man Chen, Huaifeng Chen . On ideal matrices whose entries are the generalized $ k- $Horadam numbers. AIMS Mathematics, 2025, 10(2): 1981-1997. doi: 10.3934/math.2025093
[8]	Yuanjie Geng, Deshu Sun . Error bounds for linear complementarity problems of strong $ SDD_{1} $ matrices and strong $ SDD_{1} $-$ B $ matrices. AIMS Mathematics, 2023, 8(11): 27052-27064. doi: 10.3934/math.20231384
[9]	Baijuan Shi . A particular matrix with exponential form, its inversion and some norms. AIMS Mathematics, 2022, 7(5): 8224-8234. doi: 10.3934/math.2022458
[10]	Lanlan Liu, Pan Han, Feng Wang . New error bound for linear complementarity problem of $ S $-$ SDDS $-$ B $ matrices. AIMS Mathematics, 2022, 7(2): 3239-3249. doi: 10.3934/math.2022179

1. Introduction

Let $ n $ be an integer number, $ N = \{ 1, 2, \ldots, n\} $, and let $ C^{n\times n} $ be the set of all complex matrices of order $ n $. A matrix $ M = (m_{ij}) \in {C^{n \times n}}(n \geq 2) $ is called a strictly diagonally dominant ($ {SDD} $) matrix ^[1] if

$\begin{equation*} |{m_{ii}}| > {r_i}(M) = \sum\limits_{j = 1, j \ne i}^n {|{m_{ij}}|}, \ \ \ \ \ \ \forall i \in N. \end{equation*}$ $

It was shown that an $ SDD $ matrix is an $ H $-matrix ^[1], where matrix $ M = ({m_{ij}}) \in {C^{n \times n}}(n \ge 2) $ is called an $ H $-matrix ^{[1, 2, 3]} if and only if there exists a positive diagonal matrix $ X $ such that $ MX $ is an $ SDD $ matrix ^{[1, 2, 4]}. $ H $-matrices are widely applied in many fields, such as computational mathematics, economics, mathematical physics and dynamical system theory, see ^{[1, 4, 5, 6]}. Meanwhile, upper bounds for the infinity norm of the inverse matrices of $ H $-matrices can be used in the convergence analysis of matrix splitting and matrix multi-splitting iterative methods for solving the large sparse of linear equations ^[7], as well as linear complementarity problems. Moreover, upper bounds of the infinity norm of the inverse for different classes of matrices have been widely studied, such as $ CKV $-type matrices ^[8], $ S $-$ SDDS $ matrices ^[9], $ DZ $ and $ DZ $-type matrices ^{[10, 11]}, $ Nekrasov $ matrices ^{[12, 13, 14, 15]}, $ S $-$ Nekrasov $ matrices ^[16], $ Q $-$ Nekrasov $ matrices ^[17], $ GSDD_1 $ matrices ^[18] and so on.

In 2011, Peňa ^[19] proposed a new subclass of $ H $-matrices called $ {SDD_1} $ matrices, whose definition is listed below. A matrix $ M = (m_{ij}) \in {C^{n \times n}}(n \geq 2) $ is called an $ {SDD_1} $ matrix if

$\begin{equation*} |{m_{ii}}| > p_i(M), \; \; \; \; \forall i\in {N_1}(M), \end{equation*}$ $

where

$\begin{eqnarray*} p_i(M) & = & \sum\limits_{j \in {N_1}(M)\backslash \{ i\} } {|{m_{ij}}|} + \sum\limits_{j \in {N_2}(M)\backslash \{ i\} } {\frac{{{r_j}(M)}}{{|{m_{jj}}|}}} |{m_{ij}}|, \\ {N_1}(M) & = & \left\{ {i||{m_{ii}}| \le {r_i}(M)} \right\}, \ \ \ \ {N_2}(M) = \left\{ {i||{m_{ii}}| > {r_i}(M)} \right\}. \end{eqnarray*}$ $

In 2023, Dai et al. ^[18] gave a new subclass of $ H $-matrices named generalized $ SDD_1 $ ($ GSDD_1 $) matrices, which extends the class of $ SDD_1 $ matrices. Here, a matrix $ M = (m_{ij}) \in {C^{n \times n}}(n \geq 2) $ is said a $ GSDD_1 $ matrix if

$\begin{equation*} r_i(M)- p^{{N_2}(M)}_i(M) > 0, \; \; \; \; \forall i\in {N_2}(M), \end{equation*}$ $

and

$\begin{equation*} \left( r_i(M)- p^{N_2(M)}_i(M) \right) \left( |a_{jj}|- p^{{N_1}(M)}_j(M) \right) > p^{{N_1}(M)}_i(M) p^{{N_2}(M)}_j(M), \; \; \; \forall i\in {N_2}(M), \; \forall j\in {N_1}(M), \end{equation*}$ $

where

$\begin{eqnarray*} p_i^{N_2(M)}(M) = \sum\limits_{j \in {N_2}(M)\backslash \{ i\} } {\frac{{r_j(M)}}{{|{m_{jj}}|}}} |{m_{ij}}|, \; \; \; p_i^{N_1(M)}(M) = \sum\limits_{j \in {N_1}(M)\backslash \{ i\} } {|{m_{ij}}|}, \; \; \; i\in N. \end{eqnarray*}$ $

Subsequently, some upper bounds for the infinite norm of the inverse matrices of $ {SDD} $ matrices, $ {SDD_1} $ matrices and $ GSDD_1 $ matrices are presented, see ^{[18, 20, 21]}. For example, the following results that will be used later are listed.

Theorem 1. (Varah bound) ^[21] Let matrix $ M = (m_{ij}) \in {C^{n \times n}}(n \geq 2) $ be an $ {SDD} $ matrix. Then

$\begin{equation*} ||{M^{ - 1}}|{|_\infty } \le \frac{1}{{\mathop {\min}\limits_{1 \le i \le n} (|{m_{ii}}| - {r_i}(M))}}. \end{equation*}$ $

Theorem 2. ^[20] Let matrix $ M = (m_{ij}) \in {C^{n \times n}}(n \geq 2) $ be an $ {SDD} $ matrix. Then

$\begin{eqnarray*} ||{M^{ - 1}}|{|_\infty } \le \frac{{\mathop {\max }\limits_{i \in N} \frac{{p_i(M)}}{{|{m_{ii}}|}} + \varepsilon }}{{\mathop {\min}\limits_{i \in N} {Z_i}}}, \; \; \; 0 < \varepsilon < \mathop {\min }\limits_{i \in N} \frac{{|{m_{ii}}| - p_i(M)}}{{{r_i}(M)}}, \end{eqnarray*}$ $

where

$\begin{eqnarray*} {Z_i} = \varepsilon (|{m_{ii}}| - {r_i}(M)) + \sum\limits_{j \in N\backslash \{ i\} } {\left( {\frac{{r_{j}(M) - p_j(M)}}{{|{m_{jj}}|}}} \right)} |{m_{ij}}|. \end{eqnarray*}$ $

Theorem 3. ^[20] Let matrix $ M = (m_{ij}) \in {C^{n \times n}}(n \geq 2) $ be an $ {SDD} $ matrix. If $ {r_i}(M) > 0(\forall i \in N) $, then

$\begin{eqnarray*} ||{M^{ - 1}}|{|_\infty } \le \frac{{\mathop {\max }\limits_{i \in N} \frac{{p_i(M)}}{{|{m_{ii}}|}}}}{{\mathop {\min}\limits_{i \in N} \sum\limits_{j \in N\backslash \{ i\} } {\frac{{r_j(M) - p_j(M)}}{{|{m_{jj}}|}}|{m_{ij}}|} }}. \end{eqnarray*}$ $

Theorem 4. ^[18] Let $ M = (m_{ij})\in {C^{n \times n}} $ be a $ GSDD_1 $ matrix. Then

$\begin{eqnarray*} ||{M^{ - 1}}|{|_\infty } \le \frac{{\max \left\{ {\varepsilon, \mathop {\max }\limits_{i \in {N_2}(M)} \frac{{r_i(M)}}{{|{m_{ii}}|}} } \right\}}}{{\min \left\{ \mathop {\min}\limits_{i \in {N_2}(M)} {\phi_i}, \mathop {\min}\limits_{i \in {N_1}(M)} {\psi_i}\right\} }}, \end{eqnarray*}$ $

where

$\begin{eqnarray*} {\phi_i} & = & r_i(M) - \sum\limits_{j \in {N_2}(M)\backslash \{ i\} } { {\frac{{r_j(M) }}{{|{m_{jj}}|}}} } |{m_{ij}}| - \sum\limits_{j \in {N_1}(M)\backslash \{ i\} } |{m_{ij}}|\varepsilon, \\ {\psi_i} & = & |{m_{ii}}|\varepsilon - \sum\limits_{j \in {N_1}(M)\backslash \{ i\} } {|{m_{ij}}|}\varepsilon + \sum\limits_{j \in {N_2}(M)\backslash \{ i\} } { {\frac{{r_j(M) }}{{|{m_{jj}}|}}} } |{m_{ij}}|, \end{eqnarray*}$ $

and

$\begin{eqnarray*} \mathop {\max }\limits_{i \in N_1(M)} \frac{ p_i^{N_2(M) }(M) }{ |{m_{ii}}| - p_i^{N_1(M)}(M) } < \varepsilon < \mathop {\min }\limits_{j \in N_2(M)} \frac{r_j(M) - p_j^{N_2(M)}(M) }{ p_j^{N_1(M)}(M) }. \end{eqnarray*}$ $

On the basis of the above articles, we continue to study special structured matrices and introduce a new subclass of $ H $-matrices called $ {SDD_k} $ matrices, and provide some new upper bounds for the infinite norm of the inverse matrices for $ {SDD} $ matrices and $ {SDD_k} $ matrices, which improve the previous results. The remainder of this paper is organized as follows: In Section 2, we propose a new subclass of $ H $-matrices called $ {SDD_k} $ matrices, which include $ {SDD} $ matrices and $ {SDD_1} $ matrices, and derive some properties of $ {SDD_k} $ matrices. In Section 3, we present some upper bounds for the infinity norm of the inverse matrices for $ {SDD} $ matrices and $ {SDD_k} $ matrices, and provide some comparisons with the well-known Varah bound. Moreover, some numerical examples are given to illustrate the corresponding results.

2. $ {SDD_k} $ matrices

In this section, we propose a new subclass of $ H $-matrices called $ {SDD_k} $ matrices, which include $ {SDD} $ matrices and $ {SDD_1} $ matrices, and derive some new properties.

Definition 1. A matrix $ M = (m_{ij}) \in {C^{n \times n}}(n \geq 2) $ is called an $ {SDD_k} $ matrix if there exists $ {\rm{ }}k \in {N} $ such that

$\begin{equation*} |{m_{ii}}| > p_i^{(k - 1)}(M), \; \; \; \; \forall i\in {N_1}(M), \end{equation*}$ $

where

$\begin{eqnarray*} p_i^{(k)}(M) & = & \sum\limits_{j \in {N_1}(M)\backslash \{ i\} } {|{m_{ij}}|} + \sum\limits_{j \in {N_2}(M)\backslash \{ i\} } {\frac{{p_j^{(k - 1)}(M)}}{{|{m_{jj}}|}}} |{m_{ij}}|, \\ p_i^{(0)}(M) & = & \sum\limits_{j \in {N_1}(M)\backslash \{ i\} } {|{m_{ij}}|} + \sum\limits_{j \in {N_2}(M)\backslash \{ i\} } {\frac{{{r_j}(M)}}{{|{m_{jj}}|}}} |{m_{ij}}|. \end{eqnarray*}$ $

Immediately, we know that $ {SDD_k} $ matrices contain $ {SDD} $ matrices and $ {SDD_1} $ matrices, so

$\begin{align*} \left\{ SDD \right\}\subseteq \left\{ SDD_1 \right\}\subseteq \left\{ SDD_2 \right\}\subseteq \cdots \subseteq \left\{ SDD_k \right\}. \end{align*}$ $

Lemma 1. A matrix $ M = (m_{ij}) \in {C^{n \times n}}(n \geq 2) $ is an $ {SDD_k}(k \geq 2) $ matrix if and only if for $ \forall i \in N $, $ |{m_{ii}}| > p_i^{(k - 1)}(M) $.

Proof. For $ \forall i \in N_1(M) $, from Definition 1, it holds that $ |{m_{ii}}| > p_i^{(k - 1)}(M) $.

For $ \forall i \in N_2(M) $, we have that $ |{m_{ii}}| > {r_i}(M) $. When $ k = 2 $, it follows that

$\begin{eqnarray*} |{m_{ii}}| > {r_i}(M) &\ge& \sum\limits_{j \in {N_1}(M)\backslash \{ i\} } {|{m_{ij}}|} + \sum\limits_{j \in {N_2}(M)\backslash \{ i\} } {\frac{{{r_j}(M)}}{{|{m_{jj}}|}}} |{m_{ij}}| = p_i^{(0)}(M)\\ &\ge& \sum\limits_{j \in {N_1}(M)\backslash \{ i\} } {|{m_{ij}}|} + \sum\limits_{j \in {N_2}(M)\backslash \{ i\} } {\frac{{p_j^{(0)}(M)}}{{|{m_{jj}}|}}} |{m_{ij}}| = p_i^{(1)}(M). \end{eqnarray*}$ $

Suppose that $ |{m_{ii}}| > p_i^{(k-1)}(M)(k\leq l, l > 2) $ holds for $ \forall i \in N_2(M) $. When $ k = l+1 $, we have

$\begin{eqnarray*} |{m_{ii}}| > {r_i}(M) &\ge& \sum\limits_{j \in {N_1}(M)\backslash \{ i\} } {|{m_{ij}}|} + \sum\limits_{j \in {N_2}(M)\backslash \{ i\} } {\frac{{{p_j^{(l-2)}}(M)}}{{|{m_{jj}}|}}} |{m_{ij}}| = p_i^{(l-1)}(M)\\ &\ge& \sum\limits_{j \in {N_1}(M)\backslash \{ i\} } {|{m_{ij}}|} + \sum\limits_{j \in {N_2}(M)\backslash \{ i\} } {\frac{{p_j^{(l-1)}(M)}}{{|{m_{jj}}|}}} |{m_{ij}}| = p_i^{(l)}(M). \end{eqnarray*}$ $

By induction, we obtain that for $ \forall i \in N_2(M) $, $ |{m_{ii}}| > p_i^{(k - 1)}(M) $. Consequently, it holds that matrix $ M $ is an $ SDD_k $ matrix if and only if $ |{m_{ii}}| > p_i^{(k - 1)}(M) $ for $ \forall i \in N $. The proof is completed. □

Lemma 2. If $ M = (m_{ij}) \in {C^{n \times n}}(n \geq 2) $ is an $ {SDD_k}(k \geq 2) $ matrix, then $ M $ is an $ H $-matrix.

Proof. Let $ X $ be the diagonal matrix $ diag\{ {x_1}, {x_2}, \cdots, {x_n}\} $, where

$\begin{eqnarray*} (0 < )\ {{x}_{j}} = \left\{ \begin{matrix} 1 \begin{matrix} , & \begin{matrix} {} & {} \\ \end{matrix}j\in {N_1(M)}, \\ \end{matrix} \\ \frac{{p_j^{(k - 1)}(M)}}{{|{m_{jj}}|}} + \varepsilon\begin{matrix} , & j \in {N_2(M)}, \\ \end{matrix} \\ \end{matrix} \right. \end{eqnarray*}$ $

and

$\begin{eqnarray*} 0 < \varepsilon < \mathop {\min }\limits_{i \in N} \frac{{|{m_{ii}}| - p_i^{(k - 1)}(M)}}{{\sum\limits_{j \in {N_2}(M)\backslash \{ i\} } {|{m_{ij}}|} }}. \end{eqnarray*}$ $

If $ \sum\limits_{j \in {N_2}(M)\backslash \{ i\} } {|{m_{ij}}|} = 0 $, then the corresponding fraction is defined to be $ {\infty} $. Next we consider the following two cases.

Case 1: For each $ i \in {N_1}(M) $, it is not difficult to see that $ |{{{(MX}})_{ii}}| = |{m_{ii}}| $, and

$\begin{eqnarray*} {r_i}(MX) & = & \sum\limits_{j = 1, j \ne i} {|{m_{ij}}|{x_j}}\\ & = & \sum\limits_{j \in {N_1}(M)\backslash \{ i\} } {|{m_{ij}}|} + \sum\limits_{j \in {N_2}(M)\backslash \{ i\} } {\left( {\frac{{p_j^{(k - 1)}(M)}}{{|{m_{jj}}|}} + \varepsilon } \right)} |{m_{ij}}|\\ &\le& \sum\limits_{j \in {N_1}(M)\backslash \{ i\} } {|{m_{ij}}|} + \sum\limits_{j \in {N_2}(M)\backslash \{ i\} } {\left( {\frac{{p_j^{(k - 2)}(M)}}{{|{m_{jj}}|}} + \varepsilon } \right)} |{m_{ij}}|\\ & = & \sum\limits_{j \in {N_1}(M)\backslash \{ i\} } {|{m_{ij}}|} + \sum\limits_{j \in {N_2}(M)\backslash \{ i\} } {\frac{{p_j^{(k - 2)}(M)}}{{|{m_{jj}}|}}} |{m_{ij}}| + \sum\limits_{j \in {N_2}(M)\backslash \{ i\} } {\varepsilon |{m_{ij}}|} \\ & = & p_i^{(k - 1)}(M) + \varepsilon \sum\limits_{j \in {N_2}(M)\backslash \{ i\} } {|{m_{ij}}|} \\ & < & p_i^{(k - 1)}(M) + |{m_{ii}}| - p_i^{(k - 1)}(M)\\ & = & |{m_{ii}}| = |{{\rm{(}}MX)_{ii}}|. \end{eqnarray*}$ $

Case 2: For each $ i \in {N_2}(M) $, we can obtain that

$\begin{eqnarray*} |{{\rm{(}}MX)_{ii}}| = |{m_{ii}}|\left( {\frac{{p_i^{k - 1}(M)}}{{|{m_{ii}}|}} + \varepsilon } \right) = p_i^{(k - 1)}(M) + \varepsilon |{m_{ii}}|, \end{eqnarray*}$ $

and

$\begin{eqnarray*} {r_i}(MX) & = & \sum\limits_{j = 1, j \ne i} {|{m_{ij}}|{x_j}} \\ & = & \sum\limits_{j \in {N_1}(M)\backslash \{ i\} } {|{m_{ij}}|} + \sum\limits_{j \in {N_2}(M)\backslash \{ i\} } {\left( {\frac{{p_j^{(k - 1)}(M)}}{{|{m_{jj}}|}} + \varepsilon } \right)} |{m_{ij}}|\\ &\le& \sum\limits_{j \in {N_1}(M)\backslash \{ i\} } {|{m_{ij}}|} + \sum\limits_{j \in {N_2}(M)\backslash \{ i\} } {\left( {\frac{{p_j^{(k - 2)}(M)}}{{|{m_{jj}}|}} + \varepsilon } \right)} |{m_{ij}}|\\ & = & \sum\limits_{j \in {N_1}(M)\backslash \{ i\} } {|{m_{ij}}|} + \sum\limits_{j \in {N_2}(M)\backslash \{ i\} } {\frac{{p_{_j}^{(k - 2)}(M)}}{{|{m_{jj}}|}}} |{m_{ij}}| + \sum\limits_{j \in {N_2}(M)\backslash \{ i\} } {\varepsilon |{m_{ij}}|} \\ & = & p_i^{(k - 1)}(M) + \varepsilon \sum\limits_{j \in {N_2}(A)\backslash \{ i\} } {|{m_{ij}}|} \\ & < & p_i^{(k - 1)}(M) + \varepsilon |{m_{ii}}|\\ & = & |{{\rm{(}}MX)_{ii}}|. \end{eqnarray*}$ $

Based on Cases 1 and 2, we have that $ MX $ is an $ {SDD} $ matrix, and consequently, $ M $ is an $ H $-matrix. The proof is completed. □

According to the definition of $ {SDD_k} $ matrix and Lemma 1, we obtain some properties of $ {SDD_k} $ matrices as follows:

Theorem 5. If $ M = (m_{ij}) \in {C^{n \times n}}(n \geq 2) $ is an $ {SDD_k} $ matrix and $ N_1(M) \ne \emptyset $, then for $ \forall i \in {N_1}(M) $, $ \sum\limits_{j \ne i, j \in {N_2}(M)} {|{m_{ij}}|} > 0 $.

Proof. Suppose that for $ \forall i \in N_1(M) $, $ \sum\limits_{j \ne i, j \in N_2(M)} {|{m_{ij}}|} = 0 $. By Definition 1, we have that $ p_i^{(k - 1)}(M) = {r_i}(M) $, $ \forall i \in {N_1}{\rm{(}}M{\rm{)}} $. Thus, it is easy to verify that $ |{m_{ii}}| > p_i^{(k - 1)}(M) = {r_i}(M) \ge |{m_{ii}}| $, which is a contradiction. Thus for $ \forall i \in N_1(M) $, $ \sum\limits_{j \ne i, j \in N_2(M)} {|{m_{ij}}|} > 0 $. The proof is completed. □

Theorem 6. Let $ M = (m_{ij}) \in {C^{n \times n}}(n \geq 2) $ be an $ {SDD_k}(k \geq 2) $ matrix. It holds that $ \sum\limits_{j \ne i, j \in N_2(M)} {|{m_{ij}}|} > 0 $, $ \forall i \in N_2(M) $. Then

$\begin{eqnarray*} |{m_{ii}}| > p_i^{(k - 2)}(M) > p_i^{(k - 1)}(M) > 0, \; \; \; \; \forall i \in {N_2}{\rm{(}}M{\rm{)}}, \end{eqnarray*}$ $

and

$\begin{eqnarray*} |{m_{ii}}| > p_i^{(k - 1)}(M) > 0, \; \; \; \; \forall i \in N. \end{eqnarray*}$ $

Proof. By Lemma 1 and the known conditions that for $ \forall i \in {N_2}{\rm{(}}M{\rm{)}} $, $ \sum\limits_{j \ne i, j \in N_2(M)} {|{m_{ij}}|} > 0 $, it holds that

$\begin{eqnarray*} |{m_{ii}}| > p_i^{(k - 2)}(M) > p_i^{(k - 1)}(M) > 0, \; \; \; \; \forall i \in {N_2}{\rm{(}}M{\rm{)}}, \end{eqnarray*}$ $

and

$ |{m_{ii}}| > p_i^{(k - 1)}(M), \; \; \; \; \forall i \in N. $

We now prove that $ |{m_{ii}}| > p_i^{(k - 1)}(M) > 0(\forall i \in {N}) $ and consider the following two cases.

Case 1: If $ {N_1}{\rm{(}}M{\rm{) = }}\emptyset $, then $ M $ is an $ {SDD} $ matrix. It is easy to verify that $ |{m_{ii}}| > p_i^{(k - 1)}(M) > 0 $, $ \forall i \in {N_2}{\rm{(}}M{\rm{)}} = N $.

Case 2: If $ {N_1}{\rm{(}}M{\rm{)}} \ne \emptyset $, by Theorem 5 and the known condition that for $ \forall i \in {N_2}{\rm{(}}M{\rm{)}} $, $ \sum\limits_{j \ne i, j \in N_2(M)} {|{m_{ij}}|} > 0 $, then it is easy to obtain that $ |{m_{ii}}| > p_i^{(k - 1)}(M) > 0(\forall i \in N) $.

From Cases 1 and 2, we have that $ |{m_{ii}}| > p_i^{(k - 1)}(M) > 0(\forall i \in N) $. The proof is completed. □

Theorem 7. Let $ M = (m_{ij}) \in {C^{n \times n}}(n \geq 2) $ be an $ {SDD_k}(k \geq 2) $ matrix and for $ \forall i \in {N_2}{\rm{(}}M{\rm{)}} $, $ \sum\limits_{j \ne i, j \in N_2(M)} {|{m_{ij}}|} > 0 $. Then there exists a diagonal matrix $ X = diag\{ {x_1}, {x_2}, \cdots, {x_n}\} $ such that $ MX $ is an $ {SDD} $ matrix. Elements $ {x_1}, {x_2}, \ldots, {x_n} $ are determined by

$\begin{eqnarray*} {x_i} = \frac{{p_i^{(k - 1)}(M)}}{{|{m_{ii}}|}}, \; \; \; \; \forall i \in N. \end{eqnarray*}$ $

Proof. We need to prove that matrix $ MX $ satisfies the following inequalities:

$ |{{\rm{(}}MX)_{ii}}| > {r_i}(MX), \; \; \; \; \forall i \in N. $

From Theorem 6 and the known condition that for $ \forall i \in {N_2}{\rm{(}}M{\rm{)}} $, $ \sum\limits_{j \ne i, j \in N_2(M)} {|{m_{ij}}|} > 0 $, it is easy to verify that

$ 0 < \frac{{p_i^{(k - 1)}(M)}}{{|{m_{ii}}|}} < \frac{{p_i^{(k - 2)}(M)}}{{|{m_{ii}}|}} < 1, \; \; \; \; \forall i \in {N_2(M)}. $

For each $ i \in N $, we have that $ |{{\rm{(}}MX)_{ii}}| = p_i^{(k - 1)}(M) $ and

$\begin{eqnarray*} {r_i}(MX) & = & \sum\limits_{j = 1, j \ne i} {|{m_{ij}}|{x_j}}\\ & = & \sum\limits_{j \in {N_1}(M)\backslash \{ i\} } {\frac{{p_j^{(k - 1)}(M)}}{{|{m_{jj}}|}}|{m_{ij}}|} + \sum\limits_{j \in {N_2}(M)\backslash \{ i\} } {\frac{{p_j^{(k - 1)}(M)}}{{|{m_{jj}}|}}} |{m_{ij}}|\\ &{\rm{ < }}&\sum\limits_{j \in {N_1}(M)\backslash \{ i\} } {|{m_{ij}}|} + \sum\limits_{j \in {N_2}(M)\backslash \{ i\} } {\frac{{p_j^{(k - 2)}(M)}}{{|{m_{jj}}|}}} |{m_{ij}}|\\ & = & p_i^{(k - 1)}(M) = |{{\rm{(}}MX)_{ii}}|, \end{eqnarray*}$ $

that is,

$ |{{\rm{(}}MX)_{ii}}| > {r_i}(MX). $

Therefore, $ MX $ is an $ SDD $ matrix. The proof is completed. □

3. Infinity norm upper bounds for the inverse of $ {SDD} $ and $ {SDD_k} $ matrices

In this section, by Lemma 2 and Theorem 7, we provide some new upper bounds of the infinity norm of the inverse matrices for $ {SDD_k} $ matrices and $ {SDD} $ matrices, respectively. We also present some comparisons with the Varah bound. Some numerical examples are presented to illustrate the corresponding results. Specially, when the involved matrices are $ {SDD_1} $ matrices as subclass of $ {SDD_k} $ matrices, these new bounds are in line with that provided by Chen et al. ^[20].

Theorem 8. Let $ M = (m_{ij})\in {C^{n \times n}}(n \geq 2) $ be an $ {SDD_k}(k \geq 2) $ matrix. Then

$\begin{eqnarray*} ||{M^{ - 1}}|{|_\infty } \le \frac{{\max \left\{ {1, \mathop {\max }\limits_{i \in {N_2}(M)} \frac{{p_i^{(k - 1)}(M)}}{{|{m_{ii}}|}} + \varepsilon } \right\}}}{{\min \left\{ \mathop {\min}\limits_{i \in {N_1}(M)} {U_i}, \mathop {\min}\limits_{i \in {N_2}(M)} {V_i}\right\} }}, \end{eqnarray*}$ $

where

$\begin{eqnarray*} {U_i} & = & |{m_{ii}}| - \sum\limits_{j \in {N_1}(M)\backslash \{ i\} } {|{m_{ij}}|} - \sum\limits_{j \in {N_2}(M)\backslash \{ i\} } {\left( {\frac{{p_j^{(k - 1)}(M)}}{{|{m_{jj}}|}} + \varepsilon } \right)} |{m_{ij}}|, \\ {V_i} & = & \varepsilon (|{m_{ii}}| - \sum\limits_{j \in {N_2}(M)\backslash \{ i\} } {|{m_{ij}}|} ) + \sum\limits_{j \in {N_2}(M)\backslash \{ i\} } {\left( {\frac{{p_{_j}^{(k - 2)}(M) - p_j^{(k - 1)}(M)}}{{|{m_{jj}}|}}} \right)} |{m_{ij}}|, \end{eqnarray*}$ $

and

$\begin{eqnarray*} 0 < \varepsilon < \mathop {\min }\limits_{i \in N} \frac{{|{m_{ii}}| - p_i^{(k - 1)}(M)}}{{\sum\limits_{j \in {N_2}(M)\backslash \{ i\} } {|{m_{ij}}|} }}. \end{eqnarray*}$ $

Proof. By Lemma 2, we have that there exists a positive diagonal matrix $ X $ such that $ MX $ is an $ {SDD} $ matrix, where $ X $ is defined as Lemma 2. Thus,

$\begin{equation*} ||{M^{ - 1}}|{|_\infty } = ||{X}({X^{ - 1}}{M^{ - 1}})|{|_\infty } = ||X{(MX)^{ - 1}}|{|_\infty } \le ||X|{|_\infty }||{(MX)^{ - 1}}|{|_\infty }, \end{equation*}$ $

and

$\begin{equation*} ||X|{|_\infty } = \mathop {\max }\limits_{1 \le i \le n} {x_i} = \max \left\{ {1, \mathop {\max }\limits_{i \in {N_2}(M)} \frac{{p_i^{(k - 1)}(M)}}{{|{m_{ii}}|}} + \varepsilon } \right\}. \end{equation*}$ $

Notice that $ MX $ is an $ {SDD} $ matrix. Hence, by Theorem 1, we have

$\begin{eqnarray*} ||{(MX)^{ - 1}}|{|_\infty } &\le& \frac{1}{{\mathop {\min}\limits_{1 \le i \le n} (|{{(MX)}_{ii}}| - {r_i}(MX))}}.\\ \end{eqnarray*}$ $

Thus, for any $ i \in {N_1}{\rm{(}}M{\rm{)}} $, it holds that

$\begin{eqnarray*} |{(MX)_{ii}}| - {r_i}(MX) = |{m_{ii}}| - \sum\limits_{j \in {N_1}(M)\backslash \{ i\} } {|{m_{ij}}|} - \sum\limits_{j \in {N_2}(M)\backslash \{ i\} } {\left( {\frac{{p_j^{(k - 1)}(M)}}{{|{m_{jj}}|}} + \varepsilon } \right)} |{m_{ij}}| = U_i. \end{eqnarray*}$ $

For any $ i \in {N_2}{\rm{(}}M{\rm{)}} $, it holds that

$\begin{eqnarray*} |{(MX)_{ii}}| - {r_i}(MX) & = & p_i^{(k - 1)}(M) + \varepsilon |{m_{ii}}| - \sum\limits_{j \in {N_1}(M)\backslash \{ i\} } {|{m_{ij}}|} - \sum\limits_{j \in {N_2}(M)\backslash \{ i\} } {\left( {\frac{{p_j^{(k - 1)}(M)}}{{|{m_{jj}}|}} + \varepsilon } \right)} |{m_{ij}}|{\rm{ }}\\ & = & \sum\limits_{j \in {N_1}(M)\backslash \{ i\} } {|{m_{ij}}|} + \sum\limits_{j \in {N_2}(M)\backslash \{ i\} } {\frac{{p_j^{(k - 2)}(M)}}{{|{m_{jj}}|}}} |{m_{ij}}| + \varepsilon |{m_{ii}}|{\rm{ }}\\ &&- \sum\limits_{j \in {N_1}(M)\backslash \{ i\} } {|{m_{ij}}|} - \sum\limits_{j \in {N_2}(M)\backslash \{ i\} } {\left( {\frac{{p_j^{(k - 1)}(M)}}{{|{m_{jj}}|}} + \varepsilon } \right)} |{m_{ij}}|\\ & = & \varepsilon (|{m_{ii}}| - \sum\limits_{j \in {N_2}(M)\backslash \{ i\} } {|{m_{ij}}|} ) + \sum\limits_{j \in {N_2}(M)\backslash \{ i\} } {\left( {\frac{{p_{_j}^{(k - 2)}(M) - p_j^{(k - 1)}(M)}}{{|{m_{jj}}|}}} \right)} |{m_{ij}}|\\ & = & V_i. \end{eqnarray*}$ $

Therefore, we get

$\begin{eqnarray*} ||{M^{ - 1}}|{|_\infty } \le \frac{{\max \left\{ {1, \mathop {\max }\limits_{i \in {N_2}(M)} \frac{{p_i^{(k - 1)}(M)}}{{|{m_{ii}}|}} + \varepsilon } \right\}}}{{\min \{ \mathop {\min}\limits_{i \in {N_1}(M)} {X_i}, \mathop {\min}\limits_{i \in {N_2}(M)} Y_i\} }}. \end{eqnarray*}$ $

The proof is completed. □

From Theorem 8, it is easy to obtain the following result.

Corollary 1. Let $ M = (m_{ij}) \in {C^{n \times n}}(n \geq 2) $ be an $ {SDD} $ matrix. Then

$\begin{eqnarray*} ||{M^{ - 1}}|{|_\infty } \le \frac{{\mathop {\max }\limits_{i \in N} \frac{{p_i^{(k - 1)}(M)}}{{|{m_{ii}}|}} + \varepsilon }}{{\mathop {\min}\limits_{i \in N} {Z_i}}}, \end{eqnarray*}$ $

where $ k\geq 2 $,

$\begin{eqnarray*} {Z_i} = \varepsilon (|{m_{ii}}| - {r_i}(M)) + \sum\limits_{j \in N\backslash \{ i\} } {\left( {\frac{{p_{_j}^{(k - 2)}(M) - p_j^{(k - 1)}(M)}}{{|{m_{jj}}|}}} \right)} |{m_{ij}}|, \end{eqnarray*}$ $

and

$\begin{eqnarray*} 0 < \varepsilon < \mathop {\min }\limits_{i \in N} \frac{{|{m_{ii}}| - p_i^{(k - 1)}(M)}}{{{r_i}(M)}}. \end{eqnarray*}$ $

Example 1. Consider the $ n\times n $ matrix:

$ M = \left( {

$\begin{array}{*{20}{c}} 4&2&{1.5}&{}&{}&{}&{}&{}&{}\\ {1.5}&4&2&{}&{}&{}&{}&{}&{}\\ {}&4&8&2&{}&{}&{}&{}&{}\\ {}&{}&4&8&2&{}&{}&{}&{}\\ {}&{}&{}& \ddots & \ddots & \ddots &{}&{}&{}\\ {}&{}&{}&{}&4&8&2&{}&{}\\ {}&{}&{}&{}&{}&4&8&2&{}\\ {}&{}&{}&{}&{}&{}&4&8&2\\ {}&{}&{}&{}&{}&{}&{}&{3.5}&4 \end{array}$ } \right). $

Take that $ n = 20 $. It is easy to verify that $ M $ is an $ {SDD} $ matrix.

By calculations, we have that for $ k = 2 $,

$\begin{eqnarray*} \mathop {\max }\limits_{i \in N} \frac{{p_i^{(1)}(M)}}{{|{m_{ii}}|}} + {\varepsilon _1} = 0.5859 + {\varepsilon _1}, \; \; \mathop {\min}\limits_{i \in N} {Z_i} = 0.4414 + 0.5{\varepsilon _1}, \; \; 0 < {\varepsilon _1} < 0.4732. \end{eqnarray*}$ $

For $ k = 4 $,

$\begin{eqnarray*} \mathop {\max }\limits_{i \in N} \frac{{p_i^{(3)}(M)}}{{|{a_{ii}}|}} + {\varepsilon _2} = 0.3845 + {\varepsilon _2}, \; \; \mathop {\min}\limits_{i \in N} {Z_i} = 0.2959 + 0.5{\varepsilon _2}, \; \; 0 < {\varepsilon _2} < 0.7034. \end{eqnarray*}$ $

For $ k = 6 $,

$\begin{eqnarray*} \mathop {\max }\limits_{i \in N} \frac{{p_i^{(5)}(M)}}{{|{m_{ii}}|}} + {\varepsilon _3} = 0.2504 + {\varepsilon _3}, \; \; \mathop {\min}\limits_{i \in N} {Z_i} = 0.1733 + 0.5{\varepsilon _3}, \; \; 0 < {\varepsilon _3} < 0.8567. \end{eqnarray*}$ $

For $ k = 8 $,

$\begin{eqnarray*} \mathop {\max }\limits_{i \in N} \frac{{p_i^{(7)}(M)}}{{|{m_{ii}}|}} + {\varepsilon _4} = 0.1624 + {\varepsilon _4}, \; \; \mathop {\min}\limits_{i \in N} {Z_i} = 0.0990 + 0.5{\varepsilon _4}, \; \; 0 < {\varepsilon _4} < 0.9572. \end{eqnarray*}$ $

So, when $ k = 2, 4, 6, 8 $, by Corollary 1 and Theorem 1, we can get the upper bounds for $ ||{M^{ - 1}}|{|_\infty } $, see Table 1. Thus,

$ ||{M^{ - 1}}|{|_\infty } \leq \frac{{0.5859 + {\varepsilon _1}}}{{0.4414 + 0.5{\varepsilon _1}}} < 2, \; \; \; \; \; {\rm{ }}||{M^{ - 1}}|{|_\infty } \leq \frac{{0.3845 + {\varepsilon _2}}}{{0.2959 + 0.5{\varepsilon _2}}} < 2, $

Table 1. The bounds in Corollary $ 1 $ and Theorem $ 1 $.

$ k $	2	4	6	8
Cor $ 1 $	$ \frac{{0.5859 + {\varepsilon _1}}}{{0.4414 + 0.5{\varepsilon _1}}} $	$ \frac{{0.3845 + {\varepsilon _2}}}{{0.2959 + 0.5{\varepsilon _2}}} $	$ \frac{{0.2504 + {\varepsilon _3}}}{{0.1733 + 0.5{\varepsilon _3}}} $	$ \frac{{0.1624 + {\varepsilon _4}}}{{0.0990 + 0.5{\varepsilon _4}}} $
Th $ 1 $	2	2	2	2

| Show Table

DownLoad: CSV

and

$ ||{M^{ - 1}}|{|_\infty }\leq \frac{{{\rm{0}}{\rm{.2504}} + {\varepsilon _3}}}{{{\rm{0}}{\rm{.1733}} + 0.5{\varepsilon _3}}} < 2, \; \; \; \; \; {\rm{ }}||{M^{ - 1}}|{|_\infty } \leq \frac{{0.1624 + {\varepsilon _4}}}{{0.0990 + 0.5{\varepsilon _4}}} < 2. $

Moreover, when $ k = 1 $, by Theorem 2, we have

$ ||{M^{ - 1}}|{|_\infty } \leq \frac{{0.7188 + {\varepsilon _5}}}{{0.4844 + 0.5{\varepsilon _5}}}, \; \; \; \; \; {\rm{ }}0 < {\varepsilon _5} < 0.3214. $

The following Theorem 9 shows that the bound in Corollary 1 is better than that in Theorem 1 of ^[20] in some cases.

Theorem 9. Let matrix $ M = (m_{ij}) \in {C^{n \times n}}(n \geq 2) $ be an $ {SDD} $ matrix. If there exists $ k \geq 2 $ such that

$ \mathop {\max }\limits_{i \in N} \frac{{p_i^{(k - 1)}(M)}}{{|{m_{ii}}|}}\mathop {\min}\limits_{i \in N} (|{m_{ii}}| - {r_i}(M)) \le \mathop {\min}\limits_{i \in N} \sum\limits_{j \in N\backslash \{ i\} } {\frac{{p_j^{(k - 2)}(M) - p_j^{(k - 1)}(M)}}{{|{m_{jj}}|}}|{m_{ij}}|} , $

then

$ ||{M^{ - 1}}|{|_\infty } \le \frac{{\mathop {\max }\limits_{i \in N} \frac{{p_i^{(k - 1)}(M)}}{{|{m_{ii}}|}} + \varepsilon }}{{\mathop {\min}\limits_{i \in N} {Z_i}}} \le \frac{1}{{\mathop {\min}\limits_{1 \le i \le n} (|{m_{ii}}| - {r_i}(M))}}, $

where $ {Z_i} $ and $ \varepsilon $ are defined as in Corollary 1, respectively.

Proof. From the given condition, we have that there exists $ k \geq 2 $ such that

$\begin{eqnarray*} \mathop {\max }\limits_{i \in N} \frac{{p_i^{(k - 1)}(M)}}{{|{m_{ii}}|}}\mathop {\min}\limits_{i \in N} (|{m_{ii}}| - {r_i}(M)) \le \mathop {\min}\limits_{i \in N} \sum\limits_{j \in N\backslash \{ i\} } {\frac{{p_j^{(k - 2)}(M) - p_j^{(k - 1)}(M)}}{{|{m_{jj}}|}}|{m_{ij}}|}, \end{eqnarray*}$ $

then

$\begin{eqnarray*} &&\mathop {\max }\limits_{i \in N} \frac{{p_i^{(k - 1)}(M)}}{{|{m_{ii}}|}}\mathop {\min}\limits_{i \in N} (|{m_{ii}}| - {r_i}(M)) + \varepsilon \mathop {\min}\limits_{i \in N} (|{m_{ii}}| - {r_i}(M))\\ &\le& \mathop {\min}\limits_{i \in N} \sum\limits_{j \in N\backslash \{ i\} } {\frac{{p_j^{(k - 2)}(M) - p_j^{(k - 1)}(M)}}{{|{m_{jj}}|}}|{m_{ij}}|} + \varepsilon \mathop {\min}\limits_{i \in N} (|{m_{ii}}| - {r_i}(M)). \end{eqnarray*}$ $

Thus, we get

$\begin{eqnarray*} &&\left( {\mathop {\max }\limits_{i \in N} \frac{{p_i^{(k - 1)}(M)}}{{|{m_{ii}}|}} + \varepsilon } \right)\mathop {\min}\limits_{i \in N} (|{m_{ii}}| - {r_i}(M))\\ &\le& \mathop {\min}\limits_{i \in N} \sum\limits_{j \in N\backslash \{ i\} } {\frac{{p_j^{(k - 2)}(M) - p_j^{(k - 1)}(M)}}{{|{m_{jj}}|}}|{m_{ij}}|} + \varepsilon \mathop {\min}\limits_{i \in N} (|{m_{ii}}| - {r_i}(M))\\ & = & \mathop {\min}\limits_{i \in N} \sum\limits_{j \in N\backslash \{ i\} } {\frac{{p_j^{(k - 2)}(M) - p_j^{(k - 1)}(M)}}{{|{m_{jj}}|}}|{m_{ij}}| + \mathop {\min}\limits_{i \in N} (\varepsilon (|{m_{ii}}| - {r_i}(M)))} \\ &\le& \mathop {\min}\limits_{i \in N} \left( {\varepsilon (|{m_{ii}}| - {r_i}(M)) + \sum\limits_{j \in N\backslash \{ i\} } {\frac{{p_j^{(k - 2)}(M) - p_j^{(k - 1)}(M)}}{{|{m_{jj}}|}}|{m_{ij}}|} } \right)\\ & = & \mathop {\min}\limits_{i \in N} {Z_i}. \end{eqnarray*}$ $

Since $ M $ is an $ {SDD} $ matrix, then

$\begin{eqnarray*} |{m_{ii}}| > {r_i}(M), \; \; \; \; \; {Z_i} > 0, \; \; \; \; \; \forall i \in N. \end{eqnarray*}$ $

It's easy to verify that

$ \frac{{\mathop {\max }\limits_{i \in N} \frac{{p_i^{(k - 1)}(M)}}{{|{m_{ii}}|}} + \varepsilon }}{{\mathop {\min}\limits_{i \in N} {Z_i}}} \le \frac{1}{{\mathop {\min}\limits_{1 \le i \le n} (|{m_{ii}}| - {r_i}(M))}}. $

Thus, by Corollary 1, it holds that

The proof is completed. □

We illustrate Theorem 9 by the following Example 2.

Example 2. This is the previous Example 1. For $ k = 4 $, we have

$\begin{eqnarray*} \mathop {\max }\limits_{i \in N} \frac{{p_i^{(3)}(M)}}{{|{m_{ii}}|}}\mathop {\min}\limits_{i \in N} (|{m_{ii}}| - {r_i}(M)) = 0.1923 < 0.2959 = \mathop {\min}\limits_{i \in N} \sum\limits_{j \in N\backslash \{ i\} } {\frac{{p_j^{(2)}(M) - p_j^{(3)}(M)}}{{|{m_{jj}}|}}|{m_{ij}}|}. \end{eqnarray*}$ $

Thus, by Theorem 8, we obtain that for each $ 0 < {\varepsilon _2} < 0.7034 $,

$ ||{M^{ - 1}}|{|_\infty } \leq \frac{{0.3845 + {\varepsilon _2}}}{{0.2959 + 0.5{\varepsilon _2}}} < 2 = \frac{1}{{\mathop {\min}\limits_{1 \le i \le n} (|{m_{ii}}| - {r_i}(M))}}. $

However, we find that the upper bounds in Theorems 8 and 9 contain the parameter $ {\varepsilon} $. Next, based on Theorem 7, we will provide new upper bounds for the infinity norm of the inverse matrices of $ {SDD_k} $ matrices, which only depend on the elements of the given matrices.

Theorem 10. Let $ M = (m_{ij}) \in {C^{n \times n}}(n \geq 2) $ be an $ {SDD_k}(k \geq 2) $ matrix and for each $ i \in {N_2}{\rm{(}}M{\rm{)}} $, $ \sum\limits_{j \ne i, j \in N_2(M)} {|{m_{ij}}|} > 0 $. Then

$ ||{M^{ - 1}}|{|_\infty } \le \frac{{\mathop {\max }\limits_{i \in N} \frac{{p_i^{(k - 1)}(M)}}{{|{m_{ii}}|}}}}{{\mathop {\min}\limits_{i \in N} \left( {p_i^{(k - 1)}(M) - \sum\limits_{j \in N\backslash \{ i\} } {\frac{{p_j^{(k - 1)}(M)}}{{|{m_{jj}}|}}|{m_{ij}}|} } \right)}}. $

Proof. By Theorems 7 and 8, we have that there exists a positive diagonal matrix $ X $ such that $ MX $ is an $ {SDD} $ matrix, where $ X $ is defined as in Theorem 7. Thus, it holds that

$\begin{equation*} ||{M^{ - 1}}|{|_\infty } = ||{X}({X^{ - 1}}{M^{ - 1}})|{|_\infty } = ||X{(MX)^{ - 1}}|{|_\infty } \le ||X|{|_\infty }||{(MX)^{ - 1}}|{|_\infty }, \end{equation*}$ $

and

$\begin{equation*} ||X|{|_\infty } = \mathop {\max }\limits_{1 \le i \le n} {x_i} = \mathop {\max }\limits_{i \in N} \frac{{p_i^{(k - 1)}(M)}}{{|{m_{ii}}|}}. \end{equation*}$ $

Notice that $ MX $ is an $ {SDD} $ matrix. Thus, by Theorem 1, we get

$\begin{eqnarray*} ||{(MX)^{ - 1}}|{|_\infty } &\le& \frac{1}{{\mathop {\min}\limits_{1 \le i \le n} (|{{(MX)}_{ii}}| - {r_i}(MX))}}\\ &{\rm{ = }}&\frac{1}{{\mathop {\min}\limits_{1 \le i \le n} (|{m_{ii}}{x_i}| - {r_i}(MX))}}\\ &{\rm{ = }}&\frac{1}{{\mathop {\min}\limits_{i \in N} \left( {p_i^{(k - 1)}(M) - \sum\limits_{j \in N\backslash \{ i\} } {\frac{{p_j^{(k - 1)}(M)}}{{|{m_{jj}}|}}|{m_{ij}}|} } \right)}}. \end{eqnarray*}$ $

Therefore, we have that

The proof is completed. □

Since $ SDD $ matrices are a subclass of $ SDD_{k} $ matrices, by Theorem 10, we can obtain the following result.

Corollary 2. Let $ M = (m_{ij}) \in {C^{n \times n}}(n \geq 2) $ be an $ {SDD} $ matrix. If $ {r_i}(M) > 0(\forall i \in N) $, then there exists $ k \geq 2 $ such that

$\begin{eqnarray*} ||{M^{ - 1}}|{|_\infty } \le \frac{{\mathop {\max }\limits_{i \in N} \frac{{p_i^{(k - 1)}(M)}}{{|{m_{ii}}|}}}}{{\mathop {\min}\limits_{i \in N} \sum\limits_{j \in N\backslash \{ i\} } {\frac{{p_j^{(k - 2)}(M) - p_j^{(k - 1)}(M)}}{{|{m_{jj}}|}}|{m_{ij}}|} }}. \end{eqnarray*}$ $

Two examples are given to show the advantage of the bound in Theorem 10.

Example 3. Consider the following matrix:

$ M = \left(

$\begin{array}{ccccc} 40 &-1 &-2 &-1 &-2 \\ 0 &10 &-4.1 &-4 &-6 \\ -20 &-2 &33 &-4 &-8\\ 0 &-4 &-6 &20 &-2\\ -30 &-4 &-2 &0 &40 \end{array}$ \right). $

It is easy to verify that $ M $ is not an $ SDD $ matrix, an $ SDD_1 $ matrix, a $ GSDD_1 $ matrix, an $ S $-$ SDD $ matrix, nor a $ CKV $-type matrix. Therefore, we cannot use the error bounds in ^{[1, 8, 9, 18, 20]} to estimate $ ||{M^{ - 1}}|{|_\infty } $. But, $ M $ is an $ SDD_2 $ matrix. So by the bound in Theorem 10, we have that $ \|{M^{ - 1}}\|_\infty \leq 0.5820 $.

Example 4. Consider the tri-diagonal matrix $ M\in R^{n\times n} $ arising from the finite difference method for free boundary problems ^[18], where

$ M = \left(

$\begin{array}{ccccc} b+\alpha sin \left(\frac{1}{n}\right) &c &0 &\cdots &0 \\ a &b+\alpha sin \left(\frac{2}{n}\right) &c &\cdots &0 \\ &\ddots &\ddots &\ddots &\\ 0 &\cdots &a &b+\alpha sin \left(\frac{n-1}{n}\right) &c \\ 0 &\cdots &0 &a & b+\alpha sin \left(1\right) \end{array}$ \right). $

Take that $ n = 4 $, $ a = 1 $, $ b = 0 $, $ c = 3.7 $ and $ \alpha = 10 $. It is easy to verify that $ M $ is neither an $ SDD $ matrix nor an $ SDD_1 $ matrix. However, we can get that $ M $ is a $ GSDD_1 $ matrix and an $ SDD_3 $ matrix. By the bound in Theorem 10, we have

$ \|{M^{ - 1}}\|_\infty \leq 8.2630, $

while by the bound in Theorem 4, it holds that

$\begin{eqnarray*} \|M^{- 1}\|_\infty \le \frac{\varepsilon }{{\min \left\{2.1488-\varepsilon, 0.3105, 2.474\varepsilon-3.6272 \right\} }}, \; \; \; \varepsilon\in (1.4661, 2.1488). \end{eqnarray*}$ $

The following two theorems show that the bound in Corollary 2 is better than that in Theorem 1 in some cases.

Theorem 11. Let $ M = (m_{ij}) \in {C^{n \times n}}(n \geq 2) $ be an $ {SDD} $ matrix. If $ {r_i}(M) > 0(\forall i \in N) $ and there exists $ k \geq 2 $ such that

$ \mathop {\min}\limits_{i \in N} \sum\limits_{j \in N\backslash \{ i\} } {\frac{{p_j^{(k - 2)}(M) - p_j^{(k - 1)}(M)}}{{|{m_{jj}}|}}|{m_{ij}}|} \ge \mathop {\min}\limits_{i \in N} (|{m_{ii}}| - {r_i}(M)), $

then

$ ||{M^{ - 1}}|{|_\infty } \le \frac{{\mathop {\max }\limits_{i \in N} \frac{{p_i^{(k - 1)}(M)}}{{|{m_{ii}}|}}}}{{\mathop {\min}\limits_{i \in N} \sum\limits_{j \in N\backslash \{ i\} } {\frac{{p_j^{(k - 2)}(M) - p_j^{(k - 1)}(M)}}{{|{m_{jj}}|}}|{m_{ij}}|} }} < \frac{1}{{\mathop {\min}\limits_{1 \le i \le n} (|{m_{ii}}| - {r_i}(M))}}. $

Proof. Since $ M $ is an $ {SDD} $ matrix, then $ N_1(M) = \emptyset $ and $ M $ is an $ {SDD_k} $ matrix. By the given condition that $ {r_i}(M) > 0(\forall i \in N) $, it holds that

$\begin{eqnarray*} |{m_{ii}}| & > & {r_i}(M) > \sum\limits_{j \in N \backslash \{ i\} } {\frac{{r_j(M)}}{{|{m_{jj}}|}}} |{m_{ij}}| = p_i^{(0)}(M) > 0, \; \; \; \forall i \in N, \\ p_i^{(0)}(M)& = &\sum\limits_{j \in N \backslash \{ i\} } {\frac{{r_j(M)}}{{|{m_{jj}}|}}} |{m_{ij}}| > \sum\limits_{j \in N \backslash \{ i\} } {\frac{{p_j^{(0)}(M)}}{{|{m_{jj}}|}}} |{m_{ij}}| = p_i^{(1)}(M) > 0, \; \; \; \forall i \in N. \end{eqnarray*}$ $

Similarly, we can obtain that

$\begin{eqnarray*} |{m_{ii}}| > {r_i}(M) > p_i^{(0)}(M) > \cdots > p_i^{(k-1)}(M) > 0, \; \; \; \forall i \in N, \end{eqnarray*}$ $

that is,

$ \mathop {\max }\limits_{i \in N} \frac{{p_i^{(k - 1)}(M)}}{{|{m_{ii}}|}} < 1. $

Since there exists $ k \geq 2 $ such that

then we have

$ \frac{{\mathop {\max }\limits_{i \in N} \frac{{p_i^{(k - 1)}(M)}}{{|{m_{ii}}|}}}}{{\mathop {\min}\limits_{i \in N} \sum\limits_{j \in N\backslash \{ i\} } {\frac{{p_j^{(k - 2)}(M) - p_j^{(k - 1)}(M)}}{{|{m_{jj}}|}}|{m_{ij}}|} }} < \frac{1}{{\mathop {\min}\limits_{1 \le i \le n} (|{m_{ii}}| - {r_i}(M))}}. $

Thus, from Corollary 2, we get

The proof is completed. □

We illustrate the Theorem 11 by following Example 5.

Example 5. Consider the matrix $ M = (m_{ij}) \in {C^{n \times n}}(n \geq 2) $, where

$ M = \left( {

$\begin{array}{*{20}{c}} 4&3&{0.9}&{}&{}&{}&{}&{}&{}\\ 1&6&2&{}&{}&{}&{}&{}&{}\\ {}&2&5&2&{}&{}&{}&{}&{}\\ {}&{}&2&5&2&{}&{}&{}&{}\\ {}&{}&{}& \ddots & \ddots & \ddots &{}&{}&{}\\ {}&{}&{}&{}&2&5&2&{}&{}\\ {}&{}&{}&{}&{}&2&5&2&{}\\ {}&{}&{}&{}&{}&{}&1&6&2\\ {}&{}&{}&{}&{}&{}&{0.9}&3&4 \end{array}$ } \right). $

Take that $ n = 20 $. It is easy to check that $ M $ is an $ {SDD} $ matrix. Let

$ {l_k} = \mathop {\min}\limits_{i \in N} \sum\limits_{j \in N\backslash \{ i\} } {\frac{{p_j^{(k - 2)}(M) - p_j^{(k - 1)}(M)}}{{|{m_{jj}}|}}|{m_{ij}}|}, \; \; m = \mathop {\min}\limits_{i \in N} (|{m_{ii}}| - {r_i}(M)). $

By calculations, we have

$\begin{eqnarray*} {l_2} & = & 0.2692 > 0.1 = m, \; \; \; \; {l_3} = 0.2567 > 0.1 = m, \; \; \; \; {l_4} = 0.1788 > 0.1 = m, \\ {l_5} & = & 0.1513 > 0.1 = m, \; \; \; \; {l_6} = 0.1037 > 0.1 = m. \end{eqnarray*}$ $

Thus, when $ k = 2, 3, 4, 5, 6 $, the matrix $ M $ satisfies the conditions of Theorem 11. By Theorems 1 and 11, we can derive the upper bounds for $ ||{M^{ - 1}}|{|_\infty } $, see Table 2. Meanwhile, when $ k = 1 $, by Theorem 3, we get that $ ||{M^{ - 1}}|{|_\infty } \leq 1.6976. $

Table 2. The bounds in Theorem $ 11 $ and Theorem $ 1 $.

$ k $	2	3	4	5	6
Th 11	1.9022	1.5959	1.8332	1.7324	2.0214
Th 1	10	10	10	10	10

| Show Table

DownLoad: CSV

From Table 2, we can see that the bounds in Theorem 11 are better than that in Theorems 1 and 3 in some cases.

Theorem 12. Let $ M = (m_{ij}) \in {C^{n \times n}}(n \geq 2) $ be an $ {SDD} $ matrix. If $ {r_i}(M) > 0(\forall i \in N) $ and there exists $ k \geq 2 $ such that

$\begin{eqnarray*} \mathop {\max }\limits_{i \in N} \frac{{p_i^{(k - 1)}(M)}}{{|{m_{ii}}|}}\mathop {\min}\limits_{i \in N} (|{m_{ii}}| - {r_i}(M)) &\le& \mathop {\min}\limits_{i \in N} \sum\limits_{j \in N\backslash \{ i\} } {\frac{{p_j^{(k - 2)}(M) - p_j^{(k - 1)}(M)}}{{|{m_{jj}}|}}|{m_{ij}}|} \\ & < & \mathop {\min}\limits_{i \in N} (|{m_{ii}}| - {r_i}(M)), \end{eqnarray*}$ $

then

$ ||{M^{ - 1}}|{|_\infty } \le \frac{{\mathop {\max }\limits_{i \in N} \frac{{p_i^{(k - 1)}(M)}}{{|{m_{ii}}|}}}}{{\mathop {\min}\limits_{i \in N} \sum\limits_{j \in N\backslash \{ i\} } {\frac{{p_j^{(k - 2)}(M) - p_j^{(k - 1)}(M)}}{{|{m_{jj}}|}}|{m_{ij}}|} }} \le \frac{1}{{\mathop {\min}\limits_{1 \le i \le n} (|{m_{ii}}| - {r_i}(M))}}. $

Proof. By Theorem 7 and the given condition that $ {r_i}(M) > 0(\forall i \in N) $, it is easy to get that

$ \sum\limits_{j \in N\backslash \{ i\} } {\frac{{p_j^{(k - 2)}(M) - p_j^{(k - 1)}(M)}}{{|{m_{jj}}|}}|{m_{ij}}|} > 0, \; \; \; \forall i \in N. $

From the condition that there exists $ k \geq 2 $ such that

we have

$ \frac{{\mathop {\max }\limits_{i \in N} \frac{{p_i^{(k - 1)}(M)}}{{|{m_{ii}}|}}}}{{\mathop {\min}\limits_{i \in N} \sum\limits_{j \in N\backslash \{ i\} } {\frac{{p_j^{(k - 2)}(M) - p_j^{(k - 1)}(M)}}{{|{m_{jj}}|}}|{m_{ij}}|} }} \le \frac{1}{{\mathop {\min}\limits_{1 \le i \le n} (|{m_{ii}}| - {r_i}(M))}}. $

Thus, from Corollary 2, it holds that

$ ||{M^{ - 1}}|{|_\infty } \le \frac{{\mathop {\max }\limits_{i \in N} \frac{{p_i^{(k - 1)}(M)}}{{|{m_{ii}}|}}}}{{\mathop {\min}\limits_{i \in N} \sum\limits_{j \in N\backslash \{ i\} } {\frac{{p_j^{(k - 2)}(M) - p_j^{(k - 1)}(M)}}{{|{m_{jj}}|}}|{m_{ij}}|} }} \le \frac{1}{{\mathop {\min}\limits_{1 \le i \le n} (|{m_{ii}}| - {r_i}(M))}}. $

The proof is completed. □

Next, we illustrate Theorem 12 by the following Example 6.

Example 6. Consider the tri-diagonal matrix $ M = (m_{ij}) \in {C^{n \times n}}(n \geq 2) $, where

$ M = \left( {

$\begin{array}{*{20}{c}} 3&{-2.5}&{}&{}&{}&{}&{}&{}&{}\\ {-1.2}&4&-2&{}&{}&{}&{}&{}&{}\\ {}&{-2.8}&5&-1&{}&{}&{}&{}&{}\\ {}&{}&{-2.8}&5&-1&{}&{}&{}&{}\\ {}&{}&{}& \ddots & \ddots & \ddots &{}&{}&{}\\ {}&{}&{}&{}&{-2.8}&5&-1&{}&{}\\ {}&{}&{}&{}&{}&{-2.8}&5&-1&{}\\ {}&{}&{}&{}&{}&{}&{-1.2}&4&-2\\ {}&{}&{}&{}&{}&{}&{}&{-2.5}&3 \end{array}$ } \right). $

Take that $ n = 20 $. It is easy to verify that $ M $ is an $ {SDD} $ matrix.

By calculations, we have that for $ k = 2 $,

$\begin{eqnarray*} \mathop {\max }\limits_{i \in N} \frac{{p_i^{(1)}(M)}}{{|{m_{ii}}|}}\mathop {\min}\limits_{i \in N} (|{m_{ii}}| - {r_i}(M)) & = & 0.2686 < \mathop {\min}\limits_{i \in N} \sum\limits_{j \in N\backslash \{ i\} } {\frac{{p_j^{(0)}(M) - p_j^{(1)}(M)}}{{|{m_{jj}}|}}|{m_{ij}}|} = 0.3250\\ & < & 0.5 = \mathop {\min}\limits_{i \in N} (|{m_{ii}}| - {r_i}(M)). \end{eqnarray*}$ $

For $ k = 5 $, we get

$\begin{eqnarray*} \mathop {\max }\limits_{i \in N} \frac{{p_i^{(4)}(M)}}{{|{m_{ii}}|}}\mathop {\min}\limits_{i \in N} (|{m_{ii}}| - {r_i}(M)) & = & 0.1319 < \mathop {\min}\limits_{i \in N} \sum\limits_{j \in N\backslash \{ i\} } {\frac{{p_j^{(3)}(M) - p_j^{(4)}(M)}}{{|{m_{jj}}|}}|{m_{ij}}|} = 0.1685\\ & < & 0.5 = \mathop {\min}\limits_{i \in N} (|{m_{ii}}| - {r_i}(M)). \end{eqnarray*}$ $

For $ k = 10 $, it holds that

$\begin{eqnarray*} \mathop {\max }\limits_{i \in N} \frac{{p_i^{(9)}(M)}}{{|{m_{ii}}|}}\mathop {\min}\limits_{i \in N} (|{m_{ii}}| - {r_i}(M)) & = & 0.0386 < \mathop {\min}\limits_{i \in N} \sum\limits_{j \in N\backslash \{ i\} } {\frac{{p_j^{(8)}(M) - p_j^{(9)}(M)}}{{|{m_{jj}}|}}|{m_{ij}}|} = 0.0485\\ & < & 0.5 = \mathop {\min}\limits_{i \in N} (|{m_{ii}}| - {r_i}(M)). \end{eqnarray*}$ $

Thus, for $ k = 2, 5, 10 $, the matrix $ M $ satisfies the conditions of Theorem 12. Thus, from Theorems 12 and 1, we get the upper bounds for $ ||{M^{ - 1}}|{|_\infty } $, see Table 3. Meanwhile, when $ k = 1 $, by Theorem 3, we have that $ ||{M^{ - 1}}|{|_\infty } \leq 1.7170. $

Table 3. The bounds in Theorem $ 12 $ and Theorem $ 1 $.

$ k $	2	5	10
Th $ 12 $	1.6530	1.5656	1.5925
Th $ 1 $	2	2	2

| Show Table

DownLoad: CSV

From Table 3, we can see that the bound in Theorem 12 is sharper than that in Theorems 1 and 3 in some cases.

4. Conclusions

$ {SDD_k} $ matrices as a new subclass of $ H $-matrices are proposed, which include $ {SDD} $ matrices and $ {SDD_1} $ matrices, and some properties of $ {SDD_k} $ matrices are obtained. Meanwhile, some new upper bounds of the infinity norm of the inverse matrices for $ {SDD} $ matrices and $ {SDD_k} $ matrices are presented. Furthermore, we prove that the new bounds are better than some existing bounds in some cases. Some numerical examples are also provided to show the validity of new results. In the future, based on the proposed infinity norm bound, we will explore the computable error bounds of the linear complementarity problems for $ SDD_k $ matrices.

Use of AI tools declaration

The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.

Acknowledgments

This research is supported by Guizhou Provincial Science and Technology Projects (20191161), and the Natural Science Research Project of Department of Education of Guizhou Province (QJJ2023062, QJJ2023063).

Conflict of interest

The authors declare that they have no competing interests.

Conflict of interest

The authors declare no conflict of interest.

References

[1]	Metzger BE, Coustan DR (1998) Proceedings of the fourth-international workshop conference on gestational diabetes mellitus. Diabetes Care 21(Suppl.2): B1–167.
[2]	Bellamy L, Casas JP, Hingorani AD, et al. (2009) Type 2 diabetes mellitus after gestational diabetes: a systematic review and meta-analysis. Lancet 373: 1773–1779. doi: 10.1016/S0140-6736(09)60731-5
[3]	World Health Organization (2013) Diagnostic criteria and classification of hyperglycaemia first detected in pregnancy. Geneva: World Health Organization.
[4]	International Diabetes Federation (2017). IDF Diabetes Atlas, 8th edition. Brussels, Belgium: International Diabetes Federation.
[5]	Guariguata L, Linnenkamp U, Beagley J, et al. (2014). Global estimates of the prevalence of hyperglycaemia in pregnancy. Diabetes Res Clin Pract 103: 176−185.
[6]	Zhu Y, Zhang C (2016) Prevalence of gestational diabetes and risk of progression to type 2 diabetes: a global perspective. Curr Diab Rep 16: 7. doi: 10.1007/s11892-015-0699-x
[7]	World Health Organization (2016) Global report on diabetes. Geneva: World Health Organization.
[8]	Lee KW, Ching SM, Ramachandran V, et al. (2018) Prevalence and risk factors of gestational diabetes mellitus in Asia: a systematic review and meta-analysis. BMC Pregnancy Childbirth 18: 494. doi: 10.1186/s12884-018-2131-4
[9]	Wendland EM, Torloni MR, Falavigna M, et al. (2012) Gestational diabetes and pregnancy outcomes – a systematic review of the World Health Organization (WHO) and the International Association of Diabetes in Pregnancy Study Groups (IADPSG) diagnostic criteria. BMC Pregnancy Childbirth 12: 23. doi: 10.1186/1471-2393-12-23
[10]	Tamayo T, Tamayo M, Rathmann W, et al. (2016) Prevalence of gestational diabetes and risk of complications before and after initiation of a general systematic two-step screening strategy in Germany (2012-2014). Diabetes Res Clin Pract 115: 1−8.
[11]	Neiger R (2017) Long-term effects of pregnancy complications on maternal health: a review. J Clin Med 6: 76. doi: 10.3390/jcm6080076
[12]	Mitanchez D, Yzydorczyk C, Simeoni U (2015) What neonatal complications should the pediatrician be aware of in case of maternal gestational diabetes? World J Diabetes 6: 734−743.
[13]	Damm P, Houshmand-Oeregaard A, Kelstrup L, et al. (2016) Gestational diabetes mellitus and long-term consequences for mother and offspring: a view from Denmark. Diabetologia 59: 1396−1399.
[14]	American Diabetes Association (2019) 14. Management of Diabetes in Pregnancy: Standards of Medical Care in Diabetes-2019. Diabetes Care 42(Suppl 1): S165−S172.
[15]	Wang C, Yang HX (2016) Diagnosis, prevention and management of gestational diabetes mellitus. Chronic Dis Transl Med 2: 199−203.
[16]	Hernandez TL, Brand-Miller JC (2018) Nutrition therapy in gestational diabetes mellitus: time to move forward. Diabetes Care 41: 1343−1345.
[17]	Metzger BE, Buchanan TA, Coustan DR, et al. (2007) Summary and recommendations of the fifth international workshop-conference on gestational diabetes mellitus. Diabetes Care 30(Suppl 2): S251−S260.
[18]	Shyam S, Ramadas A (2018) Treatments with low glycaemic index diets in gestational diabetes, In: Rajendram R, Preedy VR, Patel VB, Nutrition and Diet in Maternal Diabetes, Springer, 237−251.
[19]	Yamamoto JM, Kellett JE, Balsells M, et al. (2018) Gestational diabetes mellitus and diet: a systematic review and meta-analysis of randomized controlled trials examining the impact of modified dietary interventions on maternal glucose control and neonatal birth weight. Diabetes Care 41: 1346−1361.

This article has been cited by:

1.	Qin Li, Wenwen Ran, Feng Wang, Infinity norm bounds for the inverse of generalized ${SDD_2}$ matrices with applications, 2024, 41, 0916-7005, 1477, 10.1007/s13160-024-00658-2
2.	Qin Li, Wenwen Ran, Feng Wang, Infinity norm bounds for the inverse of Quasi- $SDD_k$ matrices with applications, 2024, 1017-1398, 10.1007/s11075-024-01949-y
3.	Wenwen Ran, Feng Wang, Extended $SDD_1^{\dag }$ matrices and error bounds for linear complementarity problems, 2024, 0916-7005, 10.1007/s13160-024-00685-z
4.	Yuanjie Geng, Yuxue Zhu, Fude Zhang, Feng Wang, Infinity Norm Bounds for the Inverse of $\textrm{SDD}_1$ -Type Matrices with Applications, 2025, 2096-6385, 10.1007/s42967-024-00457-z
5.	L. Yu. Kolotilina, SSDD Matrices and Relations with Other Subclasses of the Nonsingular ℋ-Matrices, 2025, 1072-3374, 10.1007/s10958-025-07711-6

Reader Comments

Your name:*

Email:*
© 2019 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)

通讯作者: 陈斌, bchen63@163.com

1.
沈阳化工大学材料科学与工程学院沈阳 110142

AIMS Medical Science

0.7

Metrics

Article views(4881) PDF downloads(1575) Cited by(0)

Preview PDF

Download XML

Export Citation

Article outline

Show full outline

AIMS Medical Science

Diet in Gestational Diabetes Mellitus is important — but much remains to be done!

Related Papers:

1. Introduction

2. $ {SDD_k} $ matrices

3. Infinity norm upper bounds for the inverse of $ {SDD} $ and $ {SDD_k} $ matrices

4. Conclusions

Use of AI tools declaration

Acknowledgments

Conflict of interest

References

This article has been cited by:

Reader Comments

通讯作者: 陈斌, bchen63@163.com

Metrics

Other Articles By Authors

Catalog

1. Introduction

2. $ {SDD_k} $ matrices

3. Infinity norm upper bounds for the inverse of $ {SDD} $ and $ {SDD_k} $ matrices

4. Conclusions

Use of AI tools declaration

Acknowledgments

Conflict of interest

References

AIMS Medical Science

Diet in Gestational Diabetes Mellitus is important — but much remains to be done!

Related Papers:

1. Introduction

2. $ {SDD_k} $ matrices

3. Infinity norm upper bounds for the inverse of $ {SDD} $ and $ {SDD_k} $ matrices

4. Conclusions

Use of AI tools declaration

Acknowledgments

Conflict of interest

References

This article has been cited by:

Reader Comments

通讯作者: 陈斌, bchen63@163.com

Metrics

Other Articles By Authors

Related pages

Tools

Export File

Citation

Format

Content

Catalog

1. Introduction

2. $ {SDD_k} $ matrices

3. Infinity norm upper bounds for the inverse of $ {SDD} $ and $ {SDD_k} $ matrices

4. Conclusions

Use of AI tools declaration

Acknowledgments

Conflict of interest

References