In this paper we consider some non stationary relaxed synchronous and asynchronous multisplitting methods for solving the linear complementarity problems with their coefficient matrices being H−matrices. The convergence theorems of the methods are given,and the efficiency is shown by numerical tests
AbstractThe Linear Complementarity Problem (LCP) has many applications as, e.g., in the solution of ...
AbstractThe convergence of the multiplicative multisplitting-type method for solving the linear comp...
AbstractMany problems in the areas of scientific computing and engineering applications can lead to ...
In this paper we consider some non stationary relaxed synchronous and asynchronous multisplitting me...
AbstractWe present an inexact multisplitting method for solving the linear complementarity problems,...
AbstractRelaxed nonstationary multisplitting methods are studied for the parallel solution of nonsin...
AbstractOver the years, many methods for solving the linear complementarity problem (LCP) have been ...
AbstractThe convergence of the multiplicative multisplitting-type method for solving the linear comp...
The preconditioner presented by Hadjidimos et al. (2003) can improve on the convergence rate of the...
Abstract. Non-stationary multisplitting algorithms for the solution of linear systems are studied. C...
In 2013, Bai and Zhang constructed modulus-based synchronous multisplitting methods for linear compl...
AbstractWe set up a class of parallel nonlinear multisplitting AOR methods by directly multisplittin...
AbstractMultisplitting methods are parallel methods for the solution of a linear system Ax = b. It h...
AbstractA class of parallel multisplitting chaotic relaxation methods is established for the large s...
A unified treatment is given for partially and totally asynchronous parallel successive over-relaxat...
AbstractThe Linear Complementarity Problem (LCP) has many applications as, e.g., in the solution of ...
AbstractThe convergence of the multiplicative multisplitting-type method for solving the linear comp...
AbstractMany problems in the areas of scientific computing and engineering applications can lead to ...
In this paper we consider some non stationary relaxed synchronous and asynchronous multisplitting me...
AbstractWe present an inexact multisplitting method for solving the linear complementarity problems,...
AbstractRelaxed nonstationary multisplitting methods are studied for the parallel solution of nonsin...
AbstractOver the years, many methods for solving the linear complementarity problem (LCP) have been ...
AbstractThe convergence of the multiplicative multisplitting-type method for solving the linear comp...
The preconditioner presented by Hadjidimos et al. (2003) can improve on the convergence rate of the...
Abstract. Non-stationary multisplitting algorithms for the solution of linear systems are studied. C...
In 2013, Bai and Zhang constructed modulus-based synchronous multisplitting methods for linear compl...
AbstractWe set up a class of parallel nonlinear multisplitting AOR methods by directly multisplittin...
AbstractMultisplitting methods are parallel methods for the solution of a linear system Ax = b. It h...
AbstractA class of parallel multisplitting chaotic relaxation methods is established for the large s...
A unified treatment is given for partially and totally asynchronous parallel successive over-relaxat...
AbstractThe Linear Complementarity Problem (LCP) has many applications as, e.g., in the solution of ...
AbstractThe convergence of the multiplicative multisplitting-type method for solving the linear comp...
AbstractMany problems in the areas of scientific computing and engineering applications can lead to ...
DOI
Add to ORKG