Journal of Applied Mathematics

• J. Appl. Math.
• Volume 2014, Special Issue (2014), Article ID 594185, 9 pages.

Convergence of Relaxed Matrix Parallel Multisplitting Chaotic Methods for $H$-Matrices

Abstract

Based on the methods presented by Song and Yuan (1994), we construct relaxed matrix parallel multisplitting chaotic generalized USAOR-style methods by introducing more relaxed parameters and analyze the convergence of our methods when coefficient matrices are H-matrices or irreducible diagonally dominant matrices. The parameters can be adjusted suitably so that the convergence property of methods can be substantially improved. Furthermore, we further study some applied convergence results of methods to be convenient for carrying out numerical experiments. Finally, we give some numerical examples, which show that our convergence results are applied and easily carried out.

Article information

Source
J. Appl. Math., Volume 2014, Special Issue (2014), Article ID 594185, 9 pages.

Dates
First available in Project Euclid: 27 February 2015

https://projecteuclid.org/euclid.jam/1425050703

Digital Object Identifier
doi:10.1155/2014/594185

Mathematical Reviews number (MathSciNet)
MR3240625

Citation

Zhang, Li-Tao; Li, Jian-Lei; Gu, Tong-Xiang; Liu, Xing-Ping. Convergence of Relaxed Matrix Parallel Multisplitting Chaotic Methods for $H$ -Matrices. J. Appl. Math. 2014, Special Issue (2014), Article ID 594185, 9 pages. doi:10.1155/2014/594185. https://projecteuclid.org/euclid.jam/1425050703

References

• D. P. O'Leary and R. E. White, “Multisplittings of matrices and parallel solution of linear systems,” SIAM Journal on Algebraic and Discrete Methods, vol. 6, no. 4, pp. 630–640, 1985.
• A. Frommer and G. Mayer, “Convergence of relaxed parallel multisplitting methods,” Linear Algebra and Its Applications, vol. 119, pp. 141–152, 1989.
• J. Mas, V. Migallón, J. Penadés, and D. B. Szyld, “Nonstationary parallel relaxed multisplitting methods,” Linear Algebra and Its Applications, vol. 241–243, pp. 733–747, 1992.
• T. X. Gu, X. P. Liu, and L. J. 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, no. 2, pp. 153–166, 1998.
• D. Chazan and W. Miranker, “Chaotic relaxation,” Linear Algebra and its Applications, vol. 2, pp. 199–222, 1969.
• R. Bru, L. Elsner, and M. Neumann, “Models of parallel chaotic iteration methods,” Linear Algebra and its Applications, vol. 103, pp. 175–192, 1988.
• L. Elsner, M. Neumann, and B. Vemmer, “The effect of the number of processors on the convergence of the parallel block Jacobi method,” Linear Algebra and Its Applications, vol. 154–156, pp. 311–330, 1991.
• D. Jiang, Z. Xu, Z. Chen, Y. Han, and H. Xu, “Joint time-frequency sparse estimation of large-scale network traffic,” Computer Networks, vol. 55, no. 15, pp. 3533–3547, 2011.
• 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 & Electrical Engineering, vol. 37, no. 6, pp. 1106–1121, 2011.
• P. E. Kloeden and D. J. Yuan, “Convergence of relaxed chaotic parallel iterative methods,” Bulletin of the Australian Mathematical Society, vol. 50, no. 1, pp. 167–176, 1994.
• S.-Q. Shen and T.-Z. Huang, “New comparison results for parallel multisplitting iterative methods,” Applied Mathematics and Computation, vol. 206, no. 2, pp. 738–747, 2008.
• Y. Song and D. Yuan, “On the convergence of relaxed parallel chaotic iterations for \emphH-matrix,” International Journal of Computer Mathematics, vol. 52, no. 3-4, pp. 195–209, 1994.
• D. Yuan, “On the convergence of parallel multisplitting asynchronous GAOR method for \emphH-matrix,” Applied Mathematics and Computation, vol. 160, no. 2, pp. 477–485, 2005.
• 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. Zhang, T. Huang, T. Gu, X. Guo, and J. 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.
• L.-T. Zhang and X.-Y. Zuo, “Improved convergence theorems of multisplitting methods for the linear complementarity problemčommentComment on ref. [24?]: Please update the information of this reference, if possible.,” Applied Mathematics and Computation. In press.
• L.-T. Zhang, “A new preconditioner for generalized saddle matrices with highly singular(1,1) blocks,” International Journal of Computer Mathematics, 2013.
• Y. Zhang, “The USAOR iterative method for linear systems,” Numerical Mathematics, vol. 9, no. 4, pp. 354–365, 1987 (Chinese).
• Y. Song, “On the convergence of the generalized AOR method,” Linear Algebra and Its Applications, vol. 256, pp. 199–218, 1997.
• R. S. Varga, Matrix Iterative Analysis, Prentice Hall, Englewood Cliffs, NJ, USA, 1962. \endinput