Journal of Mathematics
Volume 2020 (2020), Article ID 1832589, 5 pages
https://doi.org/10.1155/2020/1832589

Research Article

A Note on the Inner-Outer Iterative Method for Solving the Linear Equation  = 

Li-Tao Zhang,1,2,3 Xian-Yu Zuo,⁴ Tong-Xiang Gu,⁵ Yan-Ping Wang,¹ Yi-Fan Zhang,¹ Jian-Lei Li,⁶ and Sheng-Kun Li⁷

¹School of Mathematics, Zhengzhou University of Aeronautics, Zhengzhou, Henan 450015, China
²College of Mathematics and Information Science, Henan Normal University, Xinxiang, Henan 453007, China
³Henan Province Synergy Innovation Center of Aviation Economic Development, Zhengzhou, Henan 450015, China
⁴Henan Key Laboratory of Big Data Analysis and Processing, Henan University, Kaifeng 475004, China
⁵Laboratory of Computational Physics, Institute of Applied Physics and Computational Mathematics, P.O. Box 8009, Beijing 100088, China
⁶College of Mathematics and Information Science, North China University of Water Resources and Electric Power, Zhengzhou, Henan 450011, China
⁷College of Applied Mathematics, Chengdu University of Information Technology, Chengdu, Sichuan 610225, China

Correspondence should be addressed to Li-Tao Zhang; litaozhang@163.com

Received 28 December 2019; Accepted 6 May 2020; Published 6 July 2020

Academic Editor: Kaleem R. Kazmi

Copyright © 2020 Li-Tao Zhang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract.

Recently, Tian et al. [Computers and Mathematics with Applications, 75(2018): 2710-2722] came up with the inner-outer iterative method to solve the linear equation and studied the corresponding convergence of the method. In this paper, we improve the main results of the inner-outer method and get weaker convergence results. Moreover, the parameters can be adjusted suitably so that the convergence property of the method can be substantially improved.

1. Introduction

When it comes to solving the large sparse linear system

where is a square nonsingular matrix and , an iterative method is commonly used. Multisplitting for parallel solutions was initially introduced and adopted by O’Leary and White [1] for solving the linear equations and further studied by many other authors [2–35]. Among them, Prof. Bai [2–9] did a mountain of great work and constructed the parallel nonlinear AOR method about matrix multisplitting, the parallel chaotic multisplitting method, the two-stage multisplitting method under suitable constraints about two-stage multisplitting, some new hybrid algebraic multilevel preconditioning algorithms, nonstationary multisplitting iterative algorithms, and the nonstationary multisplitting two-stage iterative algorithms. Apart from these methods, Gu et al. [13, 14], Cao et al. [16–18], Wang et al. [15, 24, 26, 27, 29, 30], and Zhang et al. [28, 29, 31] also constructed relaxed nonstationary two-stage multisplitting algorithms, nested stationary iterative algorithms, relaxed parallel multisplitting AOR, USAOR, and SSOR algorithms on an -matrix, two relaxed multisplitting algorithms for different weighting types when is a monotone matrix or -matrix, the parallel multisplitting TOR algorithm, and the global relaxed parallel multisplitting USAOR (GUSAOR) algorithm. Recently, Tian et al. [22] studied the inner-outer iterative method for the linear equation and deduced the corresponding convergence of the inner-outer algorithm. In this paper, based the inner-outer iterative method, we conducted a further analysis and obtained some convergence results weaker than Tian et al.’s.

In this paper, we present the inner-outer iterative method in Section 2 and show the essentially procedural deduction as well as its corresponding main results in Section 3. Compared with those earlier studies, our findings of convergence results are more applicable. Furthermore, our new convergent domain of the parameter is wider than that in [22]. Therefore, the convergence property of the method can be substantially improved due to the suitable adjustability of the parameters we adopted.

2. The Inner-Outer Iterative Method

In 2018, Tian et al. [22] presented an inner-outer iterative algorithm for the linear system . Let be a convergent splitting; then, the authors can obtain the following linear system equivalent to (1):

where and .

Then, the inner-outer iterative method for (2) is expressed as follows:

with . Here, we regard (3) as the outer iteration. Let , and define the inner linear system as

Then, applying the inner iteration, we can get

where we take as the initial value and assign as new . Moreover, the parameters and are the tolerances of the inner and outer iterations, respectively:

Then, the inner-outer iterative algorithm is given in Algorithm 1.

(i)
Input

Output:

Step 1:

Step 2:

Step 3: while

Step 4:

Step 5: repeat

Step 6:

Step 7:

Step 8: until

Step 9: end while

Step 10:

Algorithm 1: KThe inner-outer iterative algorithm [22].

3. Main Results

In Algorithm 1, the authors discussed the convergence of the inner-outer iterative algorithm and studied the convergence of the iterations (3) and (5), respectively.

Lemma 1 (see [12]). The iterative sequence converges to the corresponding solution of for all starting vectors and for all if and only if (iff) .

Theorem 1 (see [22]). Let and ; then, the outer iteration (3) is convergent, where denotes the spectral radius of matrix .

Theorem 2 (see [22]). Let and ; then, the inner iteration (5) is convergent, where denotes the spectral radius of matrix .

Remark 1. Through careful analysis of the proving process of Theorems 1 and 2, we found that the convergence parameter may actually be weaker and weaker. In addition, parameter can be adjusted suitably so that the convergence of this method could be improved obviously. Thus, we may get the following convergence results.
Through further analysis, the outer iteration (3) is associated with the matrix splitting:

and the corresponding outer iteration matrix is

The inner iteration for (4) has the following splitting:

and the inner iteration matrix is

Theorem 3. Let and ; then, the outer iteration (3) is convergent, where denotes the spectral radius of matrix .

Proof. Let be an eigenvalue of . Then, from the assumption. Assume that is an eigenvalue of in (8); then,

Case 1. When and :

Case 2. When and :

Since , we may obtain

So, we can immediately get

From Lemma 1 and equations (12) and (15), the outer iteration (3) is convergent.

Remark 2. Since , then

So, our new convergent domain about parameter in Theorem 3 is wider than that in Theorem 1 [22].

Theorem 4. Let and ; then, the inner iteration (5) is convergent, where denotes the spectral radius of matrix .

Proof. Let be an eigenvalue of in (10); then,

where is an eigenvalue of . Then, from (17), we can get

From Lemma 1 and equation (18), we complete the proof.

Remark 3. Since , then

So, the new convergent domain about parameter in Theorem 4 is wider than that in Theorem 2 [22].
Next, the authors gave the overall convergence for the inner-outer iterative algorithm without considering the parameters and , which shows that the inner-outer iterative algorithm converges linearly to the exact solution of linear system (2).

Lemma 2 (see [12]). For all operator norms, . For all and for all , there is an operator norm . The norm depends on both and , where denotes the spectral radius of matrix .

Lemma 3 (see [12]). Assume satisfies . Then, implies that is invertible, , and .

Now, we rewrite the inner-outer iterative algorithm as a two-stage iteration framework [21, 22]:

Theorem 5 (see [22]). Let be a convergence splitting, , and be the number of inner iteration steps at the k-th outer iteration. Then, the iteration sequence generated by (20) converges to the exact solution of (2), faster than the iteration sequence derived from (2) for the same initial value .

Through careful analysis, we found that the iteration sequence generated by (20) still converges to the exact solution of (2) when . So, by similar proving process, we can get the following convergence theorem.

Theorem 6. Assume to be a convergence splitting, , and be the number of the inner iteration steps at the k-th outer iteration. Then, the iteration sequence generated by (20) converges to the exact solution of (2), faster than the iteration sequence derived from (2) for the same initial value .

Proof. From equation (20), we can obtain

Then, we can get

where and . Since is the exact solution of (1), then from (22), we have

Subtracting equation (23) from equation (22), we can get

Let be an eigenvalue of ; then, from equation (25), we can obtain that

is an eigenvalue of .

as .

Case 3. When and : from equation (27), we have

Case 4. When and : since , we can obtain

So, from equation (27), we can immediately get

Then, we can obtain . Next, from the proving process of Theorem 5, we can get for .

Remark 4. Since , then

Consequently, our new convergent domain of the parameter in Theorem 6 is wider than the convergent domain in Theorem 5 [22].

4. Conclusions

In this paper, based on the convergence of the inner-outer iteration, we obtain more applicable convergence results. Furthermore, our new convergent domain of the parameter is wider than that in [22]. Therefore, the convergence property of the method can be substantially improved due to the suitable adjustability of the parameters we adopted[34, 35].

Data Availability

The data used to support the findings of this study are available from the corresponding author upon request.

Conflicts of Interest

The authors declare that they have no conflicts of interest.

Acknowledgments

This research was supported by the National Natural Science Foundation of China (11226337, 11501525, 11961082, 11801528, 61571104, and 41906003), the Excellent Youth Foundation of Science Technology Innovation of Henan Province (184100510001 and 184100510004), the Aeronautical Science Foundation of China (2016ZG55019 and 2017ZD55014), Basic Research Projects of Key Scientific Research Projects Plan in Henan Higher Education Institutions (20zx003), Science and Technological Research of Key Projects of Henan Province (182102210242 and 182102110065), Project of Youth Backbone Teachers of Colleges and Universities of Henan Province (2019GGJS100 and 2019GGJS176), and Sichuan Science and Technology Program (2019YJ0357).

References

D. P. O’Leary and R. E. White, “Multi-splittings of matrices and parallel solution of linear systems,” SIAM Journal on Algebraic and Discrete Mathematics, vol. 6, pp. 630–640, 1985.

Z.-Z. Bai, “On the convergence of parallel nonstationary multisplitting iteration methods,” Journal of Computational and Applied Mathematics, vol. 159, no. 1, pp. 1–11, 2003.

Z.-Z. Bai and C.-L. Wang, “On the convergence of nonstationary multisplitting two-stage iteration methods for hermitian positive definite linear systems,” Journal of Computational and Applied Mathematics, vol. 138, no. 2, pp. 287–296, 2002.

Z.-Z. Bai, “Parallel chaotic multisplitting iterative methods for the large sparse linear complementarity problem,” Journal of Computational Mathematics, vol. 19, pp. 281–292, 2001.

Z.-Z. Bai, “A class of new parallel hybrid algebraic multilevel iterations,” Journal of Computational Mathematics, vol. 19, pp. 651–672, 2001.

Z.-Z. Bai, “Convergence analysis of the two-stage¶multisplitting method,” Calcolo, vol. 36, no. 2, pp. 63–74, 1999.

Z.-Z. Bai, “On the convergence domains of the matrix multisplitting relaxed methods for linear systems,” Applied Mathematics Journal of Chinese University, vol. 13, pp. 45–52, 1998.

Z.-Z. Bai, “Comparisons of the convergence and divergence rates of the parallel matrix multisplitting iteration methods,” Chinese Journal of Engineering Mathematics, vol. 1, pp. 99–102, 1994.

Z. Bai, “Parallel nonlinear AOR method and its convergence,” Computers & Mathematics with Applications, vol. 31, no. 2, pp. 21–31, 1996.

D.-W. Chang, “Convergence analysis of the parallel multisplitting TOR method,” Journal of Computational and Applied Mathematics, vol. 72, no. 1, pp. 169–177, 1996.

D.-W. Chang, “The parallel multisplitting TOR (MTOR) method for linear systems,” Computers & Mathematics with Applications, vol. 41, no. 1-2, pp. 215–227, 2001.

J. W. Demmel, Applied Numerical Linear Algebra, Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 1997.

T. Gu, X. Liu, and L. Shen, “Relaxed parallel two-stage multisplitting methods∗,” International Journal of Computer Mathematics, vol. 75, no. 3, pp. 351–367, 2000.

T.-X. Gu and X.-P. Liu, “Parallel two-stage multisplitting iterative methods,” International Journal of Computer Mathematics, vol. 20, pp. 153–166, 1998.

D.-R. Wang, “On the convergence of parallel multisplitting AOR algorithm,” Linear Algebra and Its Applications, vol. 154–156, pp. 473–486, 1991.

Z.-H. Cao, “On convergence of nested stationary iterative methods,” Linear Algebra and Its Applications, vol. 221, pp. 159–170, 1995.

Z.-H. Cao and Z. Y. Lin, “Convergence of relaxed parallel multisplitting methods with different weighting schemes,” Applied Mathematics and Computation, vol. 106, pp. 181–196, 1996.

Y. Song, “Convergence of parallel multisplitting methods for h-matrices,” International Journal of Computer Mathematics, vol. 50, no. 3-4, pp. 213–232, 1994.

A. Frommer and G. Mayer, “Convergence of relaxed parallel multisplitting methods,” Linear Algebra and Its Applications, vol. 119, pp. 141–152, 1989.

A. Frommer and G. Mayer, “On the theory and practice of multisplitting methods in parallel computation,” Computing, vol. 49, pp. 62–74, 1992.

J. Mas, “Nonstationary parallel relaxed multisplitting methods,” Linear Algebra and Its Applications, vol. 241–243, pp. 733–747, 1992.

Z. Tian, M. Tian, Y. Zhang, and P. Wen, “An iteration method for solving the linear system Ax = b,” Computers & Mathematics with Applications, vol. 75, no. 8, pp. 2710–2722, 2018.

J. H. Yun, “Performance of ILU factorization preconditioners based on multisplittings,” Numerische Mathematik, vol. 95, no. 4, pp. 761–779, 2003.

J. H. Yun, “Convergence of SSOR multisplitting method for an -matrix,” Journal of Computational and Applied Mathematics, vol. 217, pp. 252–258, 2008.

T.-Z. Huang, L.-T. Zhang, T.-X. Gu, and X.-L. Guo, “GRPM-style methods and comparisons of convergent and divergent rates,” Computers & Mathematics with Applications, vol. 57, no. 4, pp. 550–559, 2009.

S.-X. Xu, “Convergence of nonstationary parallel multisplitting SOR methods,” Mathematical Theory and Application, vol. 20, pp. 116–118, 2000.

Y. Zhang, “The USAOR iterative method for linear systems,” Numerical Mathematics, vol. 9, pp. 354–365, 1987, in Chinese.

L.-T. Zhang, T.-Z. Huang, and T.-X. Gu, “Global relaxed non-stationary multisplitting multi-parameter methods,” International Journal of Computer Mathematics, vol. 85, no. 2, pp. 211–224, 2008.

L.-T. Zhang, T.-Z. Huang, T.-X. Gu, and X.-L. Guo, “Convergence of relaxed multisplitting USAOR methods for H-matrices linear systems,” Applied Mathematics and Computation, vol. 202, no. 1, pp. 121–132, 2008.

L.-T. Zhang, T.-Z. Huang, T.-X. Gu, X.-L. Guo, and J.-H. Yue, “Convergent improvement of SSOR multisplitting method for an H-matrix,” Journal of Computational and Applied Mathematics, vol. 225, no. 2, pp. 393–397, 2009.

L.-T. Zhang, T.-Z. Huang, S.-H. Cheng, T.-X. Gu, and Y.-P. Wang, “A note on parallel multisplitting TOR method for H-matrices,” International Journal of Computer Mathematics, vol. 88, no. 3, pp. 501–507, 2011.

L.-T. Zhang, T.-Z. Huang, S.-H. Cheng, and T.-X. Gu, “The weaker convergence of non-stationary matrix multisplitting methods for almost linear systems,” Taiwanese Journal of Mathematics, vol. 15, no. 4, pp. 1423–1436, 2011.

L.-T. Zhang and J.-L. Li, “The weaker convergence of modulus-based synchronous multisplitting multi-parameters methods for linear complementarity problems,” Computers & Mathematics with Applications, vol. 67, no. 10, pp. 1954–1959, 2014.

R. Bru, V. Migallón, J. Penadés, and D. B. Szyld, “Parallel, synchronous and asynchronous two-stage multisplitting methods,” Electronic Transactions on Numerical Analysis, vol. 3, pp. 24–38, 1995.

R. S. Varga, Matrix Iterative Analysis, Springer-Verlag, New York, NY, USA, 2000.