Splitting methods are used to solve most of the linear systems, Ax = b, when the conventional method of Gauss is not efficient. These methods use the factorization of the square matrix A into two matrices M and N as A = M -N where M is nonsingular. Basic iterative methods such as Jacobi or Gauss-Sei
Note to the mixed-type splitting iterative method for Z-matrices linear systems
✍ Scribed by Guang-Hui Cheng; Ting-Zhu Huang; Shu-Qian Shen
- Publisher
- Elsevier Science
- Year
- 2008
- Tongue
- English
- Weight
- 136 KB
- Volume
- 220
- Category
- Article
- ISSN
- 0377-0427
No coin nor oath required. For personal study only.
✦ Synopsis
In this paper, the mixed-type splitting iterative method is established for solving the linear system Ax = b, where A is a Z-matrix. The iterative method contains an auxiliary matrix L 1 (D 1 ) that is restricted to be nonnegative strictly lower triangular (diagonal) matrix. Comparison theorems show that the proper choice of the L 1 (D 1 ) can lead to the convergence rate of the Mixed-Type Iterative Method faster than that of the SOR and AOR type iterative methods for solving Ax = b. Numerical results are presented.
📜 SIMILAR VOLUMES
## Abstract We consider a surface reconstruction problem of a 3D object. The surface can be reconstructed as an implicit function, which is determined by solving a linear system derived from the input scattered data. Here, we use a CSRBF (Compactly‐Supported Radial Basis Functions)‐based method whi
1], Gu and Tian [Chuanqing Gu, Zhaolu Tian, On the HSS iteration methods for positive definite Toeplitz linear systems, J. Comput. Appl. Math. 224 (2009) 709-718] proposed the special HSS iteration methods for positive definite linear systems Ax = b with A ∈ C n×n a complex Toeplitz matrix. But we f