AbstractIn this paper, we first study convergence of nonstationary multisplitting methods associated with a multisplitting which is obtained from the ILU factorizations for solving a linear system whose coefficient matrix is a large sparse H-matrix. We next study a parallel implementation of the relaxed nonstationary two-stage multisplitting method (called Algorithm 2 in this paper) using ILU factorizations as inner splittings and an application of Algorithm 2 to parallel preconditioner of Krylov subspace methods. Lastly, we provide parallel performance results of both Algorithm 2 using ILU factorizations as inner splittings and the BiCGSTAB with a parallel preconditioner which is derived from Algorithm 2 on the IBM p690 supercomputer
AbstractIn this paper, the parallel multisplitting TOR (MTOR) method is proposed by Chang [1], for s...
AbstractRelaxed technique is one of techniques for improving convergence rate of splitting iterative...
AbstractMultisplitting methods are parallel methods for the solution of a linear system Ax = b. It h...
AbstractIn this paper, we first study convergence of nonstationary multisplitting methods associated...
AbstractIn this paper, two multisplitting methods with K+1 relaxed parameters are established for so...
AbstractRelaxed nonstationary multisplitting methods are studied for the parallel solution of nonsin...
AbstractWe consider the practical implementation of Krylov subspace methods (conjugate gradients, Gm...
AbstractWe present a class of relaxed parallel multisplitting algorithms, called the parallel multis...
AbstractIn this paper, we propose the parallel multisplitting TOR method, for solving a large nonsin...
This thesis is concerned with the solution of large nonsymmetric sparse linear systems. The main foc...
International audienceIn this paper, we revisit the Krylov multisplitting algorithm presented in Hua...
AbstractThis paper introduces several strategies to deal with pivot blocks in multi-level block inco...
AbstractIn this paper, we study the convergence of both the multisplitting method and the relaxed mu...
Abstract. Incomplete factorization preconditioners such as ILU, ILUT and MILU are well-known robust ...
AbstractThe main idea of this paper is in determination of the pattern of nonzero elements of the LU...
AbstractIn this paper, the parallel multisplitting TOR (MTOR) method is proposed by Chang [1], for s...
AbstractRelaxed technique is one of techniques for improving convergence rate of splitting iterative...
AbstractMultisplitting methods are parallel methods for the solution of a linear system Ax = b. It h...
AbstractIn this paper, we first study convergence of nonstationary multisplitting methods associated...
AbstractIn this paper, two multisplitting methods with K+1 relaxed parameters are established for so...
AbstractRelaxed nonstationary multisplitting methods are studied for the parallel solution of nonsin...
AbstractWe consider the practical implementation of Krylov subspace methods (conjugate gradients, Gm...
AbstractWe present a class of relaxed parallel multisplitting algorithms, called the parallel multis...
AbstractIn this paper, we propose the parallel multisplitting TOR method, for solving a large nonsin...
This thesis is concerned with the solution of large nonsymmetric sparse linear systems. The main foc...
International audienceIn this paper, we revisit the Krylov multisplitting algorithm presented in Hua...
AbstractThis paper introduces several strategies to deal with pivot blocks in multi-level block inco...
AbstractIn this paper, we study the convergence of both the multisplitting method and the relaxed mu...
Abstract. Incomplete factorization preconditioners such as ILU, ILUT and MILU are well-known robust ...
AbstractThe main idea of this paper is in determination of the pattern of nonzero elements of the LU...
AbstractIn this paper, the parallel multisplitting TOR (MTOR) method is proposed by Chang [1], for s...
AbstractRelaxed technique is one of techniques for improving convergence rate of splitting iterative...
AbstractMultisplitting methods are parallel methods for the solution of a linear system Ax = b. It h...