AbstractFor the system of linear equations resulting from the discretization of the one-dimensional Poisson equation, we investigate the influences of the multiple splittings and the weighting matrices upon the convergence rate of the parallel matrix multisplitting method. The results show that the convergence rate is only dependent on the sizes of the splittings, the degrees of the overlappings, and the distributions of the tasks, but independent of the quantities of the weightings
AbstractFor the linear complementarity problem, we set up a class of parallel matrix multisplitting ...
In this paper, we discuss convergence of the extrapolated iterative methods for linear systems with ...
AbstractThe convergence of the multiplicative multisplitting-type method for solving the linear comp...
AbstractFor the system of linear equations resulting from the discretization of the one-dimensional ...
AbstractDespite the major recent activity in parallel processing, few effective new algorithms desig...
AbstractRelaxed technique is one of techniques for improving convergence rate of splitting iterative...
AbstractIn this paper, two multisplitting methods with K+1 relaxed parameters are established for so...
AbstractWe present a class of relaxed parallel multisplitting algorithms, called the parallel multis...
AbstractIn this paper we present some comparison theorems between two general parallel multisplittin...
AbstractIn this paper, we propose the parallel multisplitting TOR method, for solving a large nonsin...
AbstractWe set up a class of parallel nonlinear AOR method in the sense of matrix multi-splitting fo...
Summarization: The Multi-Splitting (MS) iterative method, designed exclusively for multiprocessor en...
AbstractWe investigate the effect, on the rate of convergence of a model of the asychronized paralle...
AbstractMultisplitting methods are parallel methods for the solution of a linear system Ax = b. It h...
AbstractA new comparison theorem about the parallel nonlinear AOR method [1] is set up, which descri...
AbstractFor the linear complementarity problem, we set up a class of parallel matrix multisplitting ...
In this paper, we discuss convergence of the extrapolated iterative methods for linear systems with ...
AbstractThe convergence of the multiplicative multisplitting-type method for solving the linear comp...
AbstractFor the system of linear equations resulting from the discretization of the one-dimensional ...
AbstractDespite the major recent activity in parallel processing, few effective new algorithms desig...
AbstractRelaxed technique is one of techniques for improving convergence rate of splitting iterative...
AbstractIn this paper, two multisplitting methods with K+1 relaxed parameters are established for so...
AbstractWe present a class of relaxed parallel multisplitting algorithms, called the parallel multis...
AbstractIn this paper we present some comparison theorems between two general parallel multisplittin...
AbstractIn this paper, we propose the parallel multisplitting TOR method, for solving a large nonsin...
AbstractWe set up a class of parallel nonlinear AOR method in the sense of matrix multi-splitting fo...
Summarization: The Multi-Splitting (MS) iterative method, designed exclusively for multiprocessor en...
AbstractWe investigate the effect, on the rate of convergence of a model of the asychronized paralle...
AbstractMultisplitting methods are parallel methods for the solution of a linear system Ax = b. It h...
AbstractA new comparison theorem about the parallel nonlinear AOR method [1] is set up, which descri...
AbstractFor the linear complementarity problem, we set up a class of parallel matrix multisplitting ...
In this paper, we discuss convergence of the extrapolated iterative methods for linear systems with ...
AbstractThe convergence of the multiplicative multisplitting-type method for solving the linear comp...