scholarly journals Two-step Tensor Splitting Iteration Method for Multi-linear Systems

2021 ◽  
pp. 48-55
Author(s):  
Bing Cheng ◽  
Guangbin Wang ◽  
Fuping Tan
Keyword(s):  
Convergence Analysis ◽  
Linear Systems ◽  
Iteration Method ◽  
New Method ◽  
Numerical Examples ◽  
Splitting Iteration Method

In this paper, we construct two-step tensor splitting iteration method for multi-linear systems. Moreover, we present convergence analysis of this method. Finally, we give two numerical examples to show that this new method is more ecient than the existing methods.

A two-step iterative method based on diagonal and off-diagonal splitting for solving linear systems

Filomat ◽  
2017 ◽  
Vol 31 (5) ◽  
pp. 1441-1452
Author(s):  
Mehdi Dehghana ◽  
Marzieh Dehghani-Madisehb ◽  
Masoud Hajarianc
Keyword(s):  
Numerical Analysis ◽  
Linear Systems ◽  
Iterative Methods ◽  
Classical Problem ◽  
Coefficient Matrix ◽  
New Method ◽  
Step Method ◽  
Numerical Examples ◽  
Special Cases ◽  
Two Parameter

Solving linear systems is a classical problem of engineering and numerical analysis which has various applications in many sciences and engineering. In this paper, we study efficient iterative methods, based on the diagonal and off-diagonal splitting of the coefficient matrix A for solving linear system Ax = b, where A ? Cnxn is nonsingular and x,b ? Cnxm. The new method is a two-parameter two-step method that has some iterative methods as its special cases. Numerical examples are presented to illustrate the effectiveness of the new method.

scholarly journals The modified matrix splitting iteration method for computing PageRank problem

Filomat ◽  
2019 ◽  
Vol 33 (3) ◽  
pp. 725-740 ◽  
Author(s):  
Zhaolu Tian ◽  
Xiaoyan Liu ◽  
Yudong Wang ◽  
P.H. Wen
Keyword(s):  
Iteration Method ◽  
Matrix Splitting ◽  
Power Method ◽  
Numerical Examples ◽  
Comparison Results ◽  
Iteration Methods ◽  
Splitting Iteration Method ◽  
Outer Iteration

In this paper, based on the iteration methods [3,10], we propose a modified multi-step power-inner-outer (MMPIO) iteration method for solving the PageRank problem. In the MMPIO iteration method, we use the multi-step matrix splitting iterations instead of the power method, and combine with the inner-outer iteration [24]. The convergence of the MMPIO iteration method is analyzed in detail, and some comparison results are also given. Several numerical examples are presented to illustrate the effectiveness of the proposed algorithm.

scholarly journals A convergence analysis of SOR iterative methods for linear systems with weak H-matrices

2016 ◽  
Vol 14 (1) ◽  
pp. 747-760
Author(s):  
Cheng-yi Zhang ◽  
Zichen Xue ◽  
Shuanghua Luo
Keyword(s):  
Convergence Analysis ◽  
Linear Systems ◽  
Iterative Methods ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Numerical Examples ◽  
Convergence Results ◽  
Diagonally Dominant Matrices ◽  
Diagonally Dominant ◽  
Necessary And Sufficient

AbstractIt is well known that SOR iterative methods are convergent for linear systems, whose coefficient matrices are strictly or irreducibly diagonally dominant matrices and strong H-matrices (whose comparison matrices are nonsingular M-matrices). However, the same can not be true in case of those iterative methods for linear systems with weak H-matrices (whose comparison matrices are singular M-matrices). This paper proposes some necessary and sufficient conditions such that SOR iterative methods are convergent for linear systems with weak H-matrices. Furthermore, some numerical examples are given to demonstrate the convergence results obtained in this paper.

Sign in / Sign up

Export Citation Format

Share Document