In this paper, a modified Hermitian and skew-Hermitian splitting （MHSS） iteration method for solving the complex linear matrix equation AXB = C has been presented. As the theoretical analysis shows, the MHSS iterati...In this paper, a modified Hermitian and skew-Hermitian splitting （MHSS） iteration method for solving the complex linear matrix equation AXB = C has been presented. As the theoretical analysis shows, the MHSS iteration method will converge under cer- tain conditions. Each iteration in this method requires the solution of four linear matrix equations with real symmetric positive definite coefficient matrices, although the original coefficient matrices are complex and non-Hermitian. In addition, the optimal parameter of the new iteration method is proposed. Numerical results show that MHSS iteration method is efficient and robust.展开更多
Under suitable conditions,the monotone convergence about the projected iteration method for solving linear complementarity problem is proved and the influence of the involved parameter matrix on the convergence rate o...Under suitable conditions,the monotone convergence about the projected iteration method for solving linear complementarity problem is proved and the influence of the involved parameter matrix on the convergence rate of this method is investigated.展开更多
In this paper, a complex parameter is employed in the Hermitian and skew-Hermitian splitting （HSS） method （Bai, Golub and Ng： SIAM J. Matrix Anal. Appl., 24（2003）, 603-626） for solving the complex linear system...In this paper, a complex parameter is employed in the Hermitian and skew-Hermitian splitting （HSS） method （Bai, Golub and Ng： SIAM J. Matrix Anal. Appl., 24（2003）, 603-626） for solving the complex linear system Ax = f. The convergence of the resulting method is proved when the spectrum of the matrix A lie in the right upper （or lower） part of the complex plane. We also derive an upper bound of the spectral radius of the HSS iteration matrix, and a estimated optimal parameter a （denoted by a^st） of this upper bound is presented. Numerical experiments on two modified model problems show that the HSS method with a est has a smaller spectral radius than that with the real parameter which minimizes the corresponding upper hound. In particular, for the ＇dominant＇ imaginary part of the matrix A, this improvement is considerable. We also test the GMRES method preconditioned by the HSS preconditioning matrix with our parameter a est.展开更多
The Modified Hermitian and skew-Hermitian splitting （MHSS） iteration method was presented and studied by Bai, Benzi and Chen （Computing, 87（2010）, 93-111） for solving a class of complex symmetric linear systems....The Modified Hermitian and skew-Hermitian splitting （MHSS） iteration method was presented and studied by Bai, Benzi and Chen （Computing, 87（2010）, 93-111） for solving a class of complex symmetric linear systems. In this paper, using the properties of Toeplitz matrix, we propose a class of structured MHSS iteration methods for solving the complex Toeplitz linear system. Theoretical analysis shows that the structured MHSS iteration method is unconditionally convergent to the exact solution. When the MHSS iteration method is used directly to complex symmetric Toeplitz linear systems, the computational costs can be considerately reduced by use of Toeplitz structure. Finally, numerical ex- periments show that the structured MHSS iteration method and the structured MHSS preconditioner are efficient for solving the complex Toeplitz linear system.展开更多
文摘In this paper, a modified Hermitian and skew-Hermitian splitting （MHSS） iteration method for solving the complex linear matrix equation AXB = C has been presented. As the theoretical analysis shows, the MHSS iteration method will converge under cer- tain conditions. Each iteration in this method requires the solution of four linear matrix equations with real symmetric positive definite coefficient matrices, although the original coefficient matrices are complex and non-Hermitian. In addition, the optimal parameter of the new iteration method is proposed. Numerical results show that MHSS iteration method is efficient and robust.
文摘Under suitable conditions,the monotone convergence about the projected iteration method for solving linear complementarity problem is proved and the influence of the involved parameter matrix on the convergence rate of this method is investigated.
文摘In this paper, a complex parameter is employed in the Hermitian and skew-Hermitian splitting （HSS） method （Bai, Golub and Ng： SIAM J. Matrix Anal. Appl., 24（2003）, 603-626） for solving the complex linear system Ax = f. The convergence of the resulting method is proved when the spectrum of the matrix A lie in the right upper （or lower） part of the complex plane. We also derive an upper bound of the spectral radius of the HSS iteration matrix, and a estimated optimal parameter a （denoted by a^st） of this upper bound is presented. Numerical experiments on two modified model problems show that the HSS method with a est has a smaller spectral radius than that with the real parameter which minimizes the corresponding upper hound. In particular, for the ＇dominant＇ imaginary part of the matrix A, this improvement is considerable. We also test the GMRES method preconditioned by the HSS preconditioning matrix with our parameter a est.
基金Acknowledgments. The work was supported by State Key Laboratory of Scientific/Engineer- ing Computing, Chinese Academy of Sciences The International Science and Technology Co- operation Program of China under Grant 2010DFA14700 The Natural Science Foundation of China （NSFC） under Grant 11071192, P.R. China.
文摘The Modified Hermitian and skew-Hermitian splitting （MHSS） iteration method was presented and studied by Bai, Benzi and Chen （Computing, 87（2010）, 93-111） for solving a class of complex symmetric linear systems. In this paper, using the properties of Toeplitz matrix, we propose a class of structured MHSS iteration methods for solving the complex Toeplitz linear system. Theoretical analysis shows that the structured MHSS iteration method is unconditionally convergent to the exact solution. When the MHSS iteration method is used directly to complex symmetric Toeplitz linear systems, the computational costs can be considerately reduced by use of Toeplitz structure. Finally, numerical ex- periments show that the structured MHSS iteration method and the structured MHSS preconditioner are efficient for solving the complex Toeplitz linear system.
