scispace - formally typeset
Search or ask a question

Showing papers by "Zhong-Zhi Bai published in 2006"


Journal ArticleDOI
TL;DR: The optimal parameter of the Hermitian/skew-Hermitian splitting (HSS) iteration method for a real two-by-two linear system is obtained and the result is used to determine the optimal parameters for linear systems associated with certain two- by-two block matrices.
Abstract: The optimal parameter of the Hermitian/skew-Hermitian splitting (HSS) iteration method for a real two-by-two linear system is obtained. The result is used to determine the optimal parameters for linear systems associated with certain two-by-two block matrices and to estimate the optimal parameters of the HSS iteration method for linear systems with n-by-n real coefficient matrices. Numerical examples are given to illustrate the results.

166 citations


Journal ArticleDOI
TL;DR: New preconditioners based on matrix splittings for the saddle point problems are presented and the spectral property of one of the preconditionsed matrix is studied in detail.

139 citations


Journal ArticleDOI
TL;DR: In this paper, the Hermitian minimum F-norm solutions for the matrix equations AXB=C and (AX, XB)=(C, D) by Moore-Penrose generalized inverse were obtained.
Abstract: The consistent conditions and the general expressions about the Hermitian solutions of the linear matrix equations AXB=C and (AX, XB)=(C, D) are studied in depth, where A, B, C and D are given matrices of suitable sizes. The Hermitian minimum F-norm solutions are obtained for the matrix equations AXB=C and (AX, XB)=(C, D) by Moore–Penrose generalized inverse, respectively. For both matrix equations, we design iterative methods according to the fundamental idea of the classical conjugate direction method for the standard system of linear equations. Numerical results show that these iterative methods are feasible and effective in actual computations of the solutions of the above-mentioned two matrix equations. Copyright © 2006 John Wiley & Sons, Ltd.

76 citations


Journal ArticleDOI
TL;DR: Numerical results show that these restrictive preconditioners can lead to practical and effective PCG methods for solving large sparse systems of linear equations of symmetric positive definite and block two-by-two coefficient matrices.

76 citations


Journal ArticleDOI
TL;DR: Under suitable conditions, this work proves the monotone convergence and estimate the asymptotic convergence factor of the ALI iteration matrix sequences and generalizes the known fixed-point iterations, obtaining an extensive class of relaxed splitting iteration methods for solving the non-symmetric algebraic Riccati equations.
Abstract: For the non-symmetric algebraic Riccati equations, we establish a class of alternately linearized implicit (ALI) iteration methods for computing its minimal non-negative solutions by technical combination of alternate splitting and successive approximating of the algebraic Riccati operators. These methods include one iteration parameter, and suitable choices of this parameter may result in fast convergent iteration methods. Under suitable conditions, we prove the monotone convergence and estimate the asymptotic convergence factor of the ALI iteration matrix sequences. Numerical experiments show that the ALI iteration methods are feasible and effective, and can outperform the Newton iteration method and the fixed-point iteration methods. Besides, we further generalize the known fixed-point iterations, obtaining an extensive class of relaxed splitting iteration methods for solving the non-symmetric algebraic Riccati equations. Copyright © 2006 John Wiley & Sons, Ltd.

71 citations


Journal ArticleDOI
TL;DR: A modified damped Newton method is presented, which adopts a new strategy for determining the stepsize at each Newton iteration, and the global convergence of the new method is proved when the system matrix is a nondegenerate matrix.
Abstract: We present a modified damped Newton method for solving large sparse linear complementarity problems, which adopts a new strategy for determining the stepsize at each Newton iteration The global convergence of the new method is proved when the system matrix is a nondegenerate matrix We then apply the matrix splitting technique to this new method, deriving an inexact splitting method for the linear complementarity problems The global convergence of the resulting inexact splitting method is proved, too Numerical results show that the new methods are feasible and effective for solving the large sparse linear complementarity problems

18 citations


Journal ArticleDOI
TL;DR: By making use of the Laplace transform, a class of two-stage waveform relaxation methods for solving the initial value problems of ordinary differential equations are presented, and sufficient conditions for guaranteeing their convergence when the system matrices are specifically H-matrices.

15 citations


Journal ArticleDOI
TL;DR: In this paper, a stationary convection-diffusion problem with a small parameter multiplying the highest derivative is considered, and the problem is discretized on a uniform rectangular grid by the central-difference scheme.
Abstract: A stationary convection-diffusion problem with a small parameter multiplying the highest derivative is considered. The problem is discretized on a uniform rectangular grid by the central-difference scheme. A new class of two-step iterative methods for solving this problem is proposed and investigated. The convergence of the methods is proved, optimal iterative methods are chosen, and the rate of convergence is estimated. Numerical results are presented that show the high efficiency of the methods.

10 citations