New Convergence of Relaxed Parallel Multisplitting Method for the H-Matrix

Abstract:

Relaxed technique is one of the main techniques for Improving convergence rate of splitting iterative method. Based on existing parallel multisplitting methods, we have deeply studied the convergence of the relaxed multisplitting method associated with TOR multisplitting for solving the linear system whose coefficient matrix is an H-matrix. Moreover, theoretical analysis have shown that the convergence domain of the relaxed parameters is weaker and wider.

• Periodical: Advanced Materials Research (Volumes 756-759)
• Pages: 3162-3166
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.756-759.3162
• Online since: September 2013
• Authors: You Lin Zhang, Li Tao Zhang
• Keywords: Convergence, Global Relaxed Method, H-Matrix, Linear Systems, Parallel Multisplitting

References

[1] Z.Z. Bai and D.R. Wang, Multi-parameter relaxed parallel multisplitting iteration methods based on arbitrary splittings of the coefficient matrix, In Proceedings of the National Third Parallel Algorithm Conference, The Parallel Algorithm Speciality Committee of the Chinese Computational Mathematics Society eds., Huazhong University of Science and Technology Press, Wuhan, 177-178(1992).

[2] Z.Z. Bai, J.C. Sun and D.R. Wang, A unified framework for the construction of various matrix multisplitting iterative methods for large sparse system of linear equations, Comput. Math. Appl., 32(1996), 51-76.

DOI: 10.1016/s0898-1221(96)00207-6

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

DOI: 10.1016/s0377-0427(01)00376-4

[4] A. Frommer and G. Mayer, Convergence of relaxed parallel multisplitting methods, Linear Algebra Appl., 119(1989), 141-152.

DOI: 10.1016/0024-3795(89)90074-8

[5] A. Frommer and G. Mayer, On the theory and practice of multisplitting methods in parallel computation, Computing, 49(1992), 62-74.

DOI: 10.1007/bf02238650

[6] T.X. Gu, X.P. Liu and L.J. Shen, Relaxed parallel two-stage multisplitting methods, Intern. J. Computer Math., 75(2000), 351-363.

DOI: 10.1080/00207160008804990

[7] T.X. Gu and X.P. Liu, Parallel two-stage multisplitting iterative methods, Int. J. Comput. Math., 20(2)(1998), 153-166.

[8] D. P. O'Leary and R. E. White, Multi-splittings of matrices and parallel solution of linear systems, SIAM J. Alg. Disc. Meth., 6(1985), 630-640.

[9] D.R. Wang, On the convergence of parallel multisplitting AOR algorithm, Lin. Alg. Appl., 154/156(1991), 473-486.

DOI: 10.1016/0024-3795(91)90390-i

[10] D.R. Wang and Z.Z. Bai, Generalized parallel matrix multisplitting relaxation methods, In Proceedings of the National Third Parallel Algorithm Conference, The Parallel Algorithm Speciality Committee of the Chinese Computational Mathematics Society eds., Huazhong University of Science and Technology Press, Wuhan, 179(1992).

[11] D.D. Jiang, Z.Z. Xu, Z.H. Chen, Y. Han and H.W. Xu, Joint time-frequency sparse estimation of large-scale network traffic, Computer Networks, 55(10): 3533-3547, (2011).

DOI: 10.1016/j.comnet.2011.06.027

[12] D.D. Jiang, Z.Z. Xu, H.W. Xu, Y. Han, Z.H. Chen and Z. Yuan, An approximation method of origin-destination flow traffic from link load counts, Computers and Electrical Engineering, 37(6): 1106-1121, (2011).

DOI: 10.1016/j.compeleceng.2011.06.009