Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Matrix splitting

In the mathematical discipline of numerical linear algebra, a matrix splitting is an expression which represents a given matrix as a sum or… Expand
Wikipedia

Papers overview

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
  • table 1
  • table 2
  • figure 1
  • figure 2
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
  • figure 4.1
  • figure 4.2
  • figure 4.3
  • table 5.1
  • figure 5.1
Is this relevant?
2014
2014
  • Li-Li Zhang
  • J. Optim. Theory Appl.
  • 2014
  • Corpus ID: 45067800
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
  • Wen Li
  • Appl. Math. Lett.
  • 2013
  • Corpus ID: 46224650
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
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
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
  • table 1
  • table 2
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?