A class of generalized multisplitting relaxation methods for linear complementarity problems (Q1129813): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Solution of nonsymmetric, linear complementarity problems by iterative methods / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Matrix multisplitting relaxation methods for linear complementarity problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A CLASS OF MULTI-PARAMETER RELAXED PARALLEL MULTISPLITTING METHODS FOR LARGE SPARSE LINEAR COMPLEMENTARITY PROBLEMS / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4874936 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Matrix multi-splitting multi-parameter relaxation methods / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Multi-Splittings of Matrices and Parallel Solution of Linear Systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5342712 / rank | |||
Normal rank |
Revision as of 15:00, 28 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A class of generalized multisplitting relaxation methods for linear complementarity problems |
scientific article |
Statements
A class of generalized multisplitting relaxation methods for linear complementarity problems (English)
0 references
9 April 1999
0 references
Two generalized parallel multisplitting relaxation methods for solving a linear complementarity problem (LCP) \(x^+=Mx^-+q\) are described. The sequences generated by the methods are proved to converge to the unique solution of the LCP provided \(M\) is a \(H\)-matrix with positive diagonal elements.
0 references
linear complementarity problem
0 references
multisplitting
0 references
relaxation method
0 references
parallel computation
0 references
convergence
0 references
0 references