Guangbin Wang
Qingdao University of Science and Technology
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Guangbin Wang.
Applied Mathematics and Computation | 2011
Guangbin Wang; Hao Wen; Liangliang Li; Xue Li
Abstract In this paper, we obtain bounds for the spectral radius of the matrix l ω , r which is the iterative matrix of the generalized accelerated overrelaxation (GAOR) iterative method. Moreover, we present one convergence theorem of the GAOR method. Finally, we present two numerical examples.
Applied Mathematics and Computation | 2013
Guangbin Wang; Ting Wang; Fuping Tan
In this paper, we present preconditioned generalized accelerated overrelaxation methods. We compare the spectral radii of the iteration matrices of the preconditioned and original methods. The comparison results show that the preconditioned GAOR methods converge faster than the GAOR method whenever the GAOR method is convergent. Finally, we present two numerical examples to confirm our theoretical results.
Journal of Applied Mathematics | 2011
Guangbin Wang; Hao Wen; Ting Wang
We discuss the convergence of GAOR method for linear systems with strictly α diagonally dominant matrices. Moreover, we show that our results are better than ones of Darvishi and Hessari (2006), Tian et al. (2008) by using three numerical examples.
Applied Mathematics and Computation | 2009
Guangbin Wang; Fuping Tan
Climent and Perea [J.-J. Climent, C. Perea, Convergence and comparison theorems for a generalized alternating iterative method, Appl. Math. Comput. 143 (2003) 1-14] introduced a generalized alternating iterative method. In this paper, we establish convergence results for a nonsingular H-matrix, upper bound to the spectral radius of iterative matrix and comparison theorem for a monotone matrix. Moreover, we give some numerical examples to show our results.
Applied Mathematics and Computation | 2016
Guangbin Wang; Deyu Sun
In this paper, the preconditioned multisplitting USAOR method is established for solving the system of linear equations. The convergence and comparison results of the method are given when the coefficient matrices of the linear systems are H-matrices. The method for H-matrices is proved to be more efficient than the multisplitting USAOR method for M-matrices. Finally, a numerical example is given to illustrate the efficiency of our method.
World Academy of Science, Engineering and Technology, International Journal of Mathematical, Computational, Physical, Electrical and Computer Engineering | 2014
Guangbin Wang; Deyu Sun; Fuping Tan
World Academy of Science, Engineering and Technology, International Journal of Mathematical, Computational, Physical, Electrical and Computer Engineering | 2014
Guangbin Wang; Fuping Tan; Deyu Sun
Archive | 2012
Guangbin Wang; Fuping Tan; Ting Wang
World Academy of Science, Engineering and Technology, International Journal of Mathematical, Computational, Physical, Electrical and Computer Engineering | 2010
Guangbin Wang; Liangliang Li; Fuping Tan
World Academy of Science, Engineering and Technology, International Journal of Mathematical, Computational, Physical, Electrical and Computer Engineering | 2010
Guangbin Wang; Xue Li; Fuping Tan