Skip to main content
Log in

Weaker Convergence of Global Relaxed Multisplitting USAOR Methods for an H-matrix

  • Published:
Mobile Networks and Applications Aims and scope Submit manuscript

Abstract

In this paper, based on global relaxed parallel multisplitting USAOR (GUSAOR) method presented by Zhang et al. (Appl Math Comput 20:121–132, 2008) and similar ideas used by Zhang and Li (Comput Math Appl 67:1954–195, 2014), we further analyze global relaxed parallel multisplitting USAOR (GUSAOR) method and obtain the weaker convergence results compared to Zhang et al.’s when the system matrix is an H-matrix. Moreover, convergence graph and numerical examples clearly show that our new convergence domain is wider.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

References

  1. O’Leary DP, White RE (1985) Multi-splittings of matrices and parallel solution of linear systems. SIAM J Algebraic Discrete Math 6:630–640

    Article  MATH  Google Scholar 

  2. Bai Z-Z (2003) On the convergence of parallel nonstationary multisplitting iteration methods. J Comput Appl Math 159:1–11

    Article  MathSciNet  MATH  Google Scholar 

  3. Bai Z-Z, Wang C-L (2002) On the convergence of nonstationary multisplitting two-stage iteration methods for hermitian positive definite linear systems. J Comput Appl Math 138:287–296

    Article  MathSciNet  MATH  Google Scholar 

  4. Bai Z-Z (2001) Parallel chaotic multisplitting iterative methods for the large sparse linear complementarity problem. J Comput Math 19:281–292

    MathSciNet  MATH  Google Scholar 

  5. Bai Z-Z (2001) A class of new parallel hybrid algebraic multilevel iterations. J Comput Math 19:651–672

    MathSciNet  MATH  Google Scholar 

  6. Bai Z-Z (1999) Convergence analysis of the two-stage multisplitting method. Calcolo 36:63–74

    Article  MathSciNet  MATH  Google Scholar 

  7. Bai Z-Z (1998) On the convergence domains of the matrix multisplitting relaxed methods for linear systems. Appl Math J Chinese University 13:45–52

    Article  MATH  Google Scholar 

  8. Bai Z-Z (1994) Comparisons of the convergence and divergence rates of the parallel matrix multisplitting iteration methods. Chinese J Eng Math 1:99–102

    MathSciNet  MATH  Google Scholar 

  9. Bai Z-Z (1996) Parallel nonlinear AOR method and its convergence. Comput Math Appl 31:21–31

    Article  MathSciNet  MATH  Google Scholar 

  10. Chang D-W (1996) Convergence analysis of parallel multisplitting TOR method. J Comput Appl Math 72:169–177

    Article  MathSciNet  MATH  Google Scholar 

  11. Chang D-W (2001) The parallel multisplitting TOR(MTOR) method for linear systems. Comput Math Appl 41:215–227

    Article  MathSciNet  MATH  Google Scholar 

  12. Gu T-X, Liu X-P, Shen L-J (2000) Relaxed parallel two-stage multisplitting methods. Int J Comput Math 75:351–363

    Article  MathSciNet  MATH  Google Scholar 

  13. Gu T-X, Liu X-P (1998) Parallel two-stage multisplitting iterative methods. Int J Comput Math 20:153–166

    MathSciNet  MATH  Google Scholar 

  14. Wang D-R (1991) On the convergence of parallel multisplitting AOR algorithm. Linear Algebra Appl 154 (/156):473–486

    MathSciNet  MATH  Google Scholar 

  15. Cao Z-H (1995) On the convergence of nested stationary iterative methods. Linear Algebra Appl 221:159–170

    Article  MathSciNet  MATH  Google Scholar 

  16. Cao Z-H, Lin ZY (1996) Convergence of relaxed parallel multisplitting methods with different weighting schemes. Appl Math Comput 106:181–196

    MathSciNet  Google Scholar 

  17. Song Y-Z (1994) Convergence of parallel multisplitting methods. Linear Algebra Appl 50:213–232

    MATH  Google Scholar 

  18. Frommer A, Mayer G (1989) Convergence of relaxed parallel multisplitting methods. Linear Algebra Appl 119:141–152

    Article  MathSciNet  MATH  Google Scholar 

  19. Frommer A, Mayer G (1992) On the theory and practice of multisplitting methods in parallel computation. Computing 49:62–74

    Article  MathSciNet  MATH  Google Scholar 

  20. Mas J (1992) Nonstationary parallel relaxed multisplitting methods. Linear Algebra Appl 241-243:733–747

    Article  MathSciNet  MATH  Google Scholar 

  21. Yun JH (2003) Performance of ILU factorization perconditioners based on multisplitting. Numer Math 95:761–779

    Article  MathSciNet  Google Scholar 

  22. Yun JH (2008) Convergence of SSOR multisplitting method for an H-matrix. J Comput Appl Math 217:252–258

    Article  MathSciNet  MATH  Google Scholar 

  23. Huang T-Z, Zhang L-T, Gu T-X, Guo X-L (2009) GRPM-Style methods and comparisons of convergent and divergent rates. Comput Math Appl 57:550–559

    Article  MathSciNet  MATH  Google Scholar 

  24. Xu S-X (2000) Convergence of nonstationary parallel multisplitting SOR methods. Math Theory Appl 20:116–118

    MathSciNet  Google Scholar 

  25. Zhang Y (1987) The USAOR iterative method for linear systems (in Chinese). Numer Math 9:354–365

    Google Scholar 

  26. Zhang L-T, Huang T-Z, Gu T-X (2008) Global relaxed non-stationary multisplitting multi-parameters methods. Int J Comput Math 85:211–224

    Article  MathSciNet  MATH  Google Scholar 

  27. Zhang L-T, Huang T-Z, Gu T-X, Guo X-L (2008) Convergence of relaxed multisplitting USAOR method for an H-matrix. Appl Math Comput 202:121–132

    MathSciNet  MATH  Google Scholar 

  28. Zhang L-T, Huang T-Z, Gu T-X (2009) Convergent improvement of SSOR multisplitting method. J Comput Appl Math 225:393–397

    Article  MathSciNet  MATH  Google Scholar 

  29. Zhang L-T, Huang T-Z, Cheng S-H, Gu T-X, Wang Y-P (2011) A note on parallel multisplitting TOR method of an H-matrix. Int J Comput Math 88:501–507

    Article  MathSciNet  MATH  Google Scholar 

  30. Zhang L-T, Huang T-Z, Cheng S-H, Gu T-X (2011) The weaker convergence of non-stationary matrix multisplitting methods for almost linear system. Taiwan J Math 15:1423–1436

    MathSciNet  MATH  Google Scholar 

  31. Zhang L-T, Li J-L (2014) The weaker convergence of modulus-based synchronous multisplitting multi-parameters methods for linear complementarity problems. Comput Math Appl 67:1954–1959

    Article  MathSciNet  MATH  Google Scholar 

  32. Bru R, Migallón V, Penadés J, Szyld D. B (1995) Parallel, synchronous and asynchronous two-stage multisplitting methods. Electron Trans Numer Anal 3:24–38

    MathSciNet  MATH  Google Scholar 

  33. Varga RS (2000) Matrix Iterative Analysis. Springer, New York

    Book  MATH  Google Scholar 

  34. Frommer A, Mayer G (1989) Convergence of relaxed parallel multisplitting methods. Linear Algebra Appl 119:141–152

    Article  MathSciNet  MATH  Google Scholar 

  35. Zhang L-T, Huang T-Z, Gu T-X (2008) Global relaxed non-stationary multisplitting multi- parameters methods. Int J Comput Math 85(2):211–224

    Article  MathSciNet  MATH  Google Scholar 

  36. Jiang D-D, Huo L-W, Song H-B (2018) Rethinking behaviors and activities of base stations in mobile cellular networks based on big data analysis. IEEE Trans Network Sci Eng 1(1):1–12

    MathSciNet  Google Scholar 

  37. Jiang DD, Huo L-W, Li Y (2018) Fine-granularity inference and estimations to network traffic for SDN. Plos One 13(5):1–23

    Google Scholar 

  38. Jiang D-D, Huo L-W, Lv Z et al (2018) A joint multi-criteria utility-based network selection approach for vehicle-to-infrastructure networking. IEEE Trans Intell Transp Syst 99:1–15

    Google Scholar 

  39. Jiang D-D, Zhang P, Lv Z et al (2016) Energy-efficient multi-constraint routing algorithm with load balancing for smart city applications. IEEE Internet Things J 3(6):1437–1447

    Article  Google Scholar 

  40. Jiang D-D, Xu Z-Z, Li W-P, Chen Z-H (2017) Topology control-based collaborative multicast routing algorithm with minimum energy consumption. Int J Commun Syst 30(1):1–18

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ding-De Jiang.

Additional information

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

This research of this author is supported by the National Natural Science Foundation of China (11226337, 11501525, 11961082, 11801528, 61571104, 41906003), Excellent Youth Foundation of Science & Technology Innovation of Henan Province (184100510001, 184100510004), Aeronautical Science Foundation of China (2016ZG55019, 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, 182102110065), Project of Youth Backbone Teachers of Colleges and Universities of Henan Province (2019GGJS176).

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhang, LT., Jiang, DD., Zuo, XY. et al. Weaker Convergence of Global Relaxed Multisplitting USAOR Methods for an H-matrix. Mobile Netw Appl 26, 755–765 (2021). https://doi.org/10.1007/s11036-019-01417-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11036-019-01417-1

Keywords

Navigation