Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2016

2016

In this paper, a relaxation modulus-based matrix splitting iteration method is established, which covers the known general… Expand

Is this relevant?

2016

2016

Sparse matrix-matrix multiplication (or SpGEMM) is a key primitive for many high-performance graph algorithms as well as for some… Expand

Is this relevant?

2014

2014

The matrix multisplitting iteration method is an effective tool for solving large sparse linear complementarity problems. However… Expand

Is this relevant?

2013

2013

Abstract We weaken the convergence conditions of modulus-based matrix splitting and matrix two-stage splitting iteration methods… Expand

Is this relevant?

2013

2013

Abstract In this paper, we extend the modulus-based matrix splitting iteration method to more general cases, and then present… Expand

Is this relevant?

2012

2012

For the large sparse linear complementarity problem, a class of accelerated modulus-based matrix splitting iteration methods is… Expand

Is this relevant?

Highly Cited

2010

Highly Cited

2010

For the large sparse linear complementarity problems, by reformulating them as implicit fixed-point equations based on splittings… Expand

Is this relevant?

2010

2010

Bai has recently presented a modulus-based matrix splitting iteration method, which is a powerful alternative for solving the… Expand

Is this relevant?

Highly Cited

1992

Highly Cited

1992

Consider the affine variational inequality problem. It is shown that the distance to the solution set from a feasible point near… Expand

Is this relevant?

Highly Cited

1991

Highly Cited

1991

Recently Han and Lou proposed a highly parallelizable decomposition algorithm for minimizing a strongly convex cost over the… Expand

Is this relevant?