A preconditioned multisplitting and Schwarz method for linear complementarity problem (Q2336502): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The convergence of parallel iteration algorithms for linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gaussian pivoting method for solving linear complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of symmetric 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: Matrix Multisplitting Methods with Applications to Linear Complementarity Problems∶ Parallel Asynchronous Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modulus-based synchronous two-stage multisplitting iteration methods for linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multisplitting iteration schemes for solving a class of nonlinear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Convergence of a Matrix Splitting Algorithm for the Symmetric Monotone Linear Complementarity Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multisplitting method for symmetric linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerated modulus-based matrix splitting iteration methods for linear complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: More on modifications and improvements of classical iterative schemes for \(M\)-matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving Jacobi and Gauss-Seidel iterations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Preconditioned Generalised AOR Method for the Linear Complementarity Problem Based on a Generalised Hadjidimos Preconditioner / rank
 
Normal rank
Property / cites work
 
Property / cites work: A necessary and sufficient condition for \(M\)-matrices and its relation to block \(LU\) factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3943082 / rank
 
Normal rank

Latest revision as of 23:34, 20 July 2024

scientific article
Language Label Description Also known as
English
A preconditioned multisplitting and Schwarz method for linear complementarity problem
scientific article

    Statements

    A preconditioned multisplitting and Schwarz method for linear complementarity problem (English)
    0 references
    0 references
    0 references
    19 November 2019
    0 references
    Summary: The preconditioner presented by \textit{A. Hadjidimos} et al. [Linear Algebra Appl. 364, 253--279 (2003; Zbl 1023.65022)] can improve on the convergence rate of the classical iterative methods to solve linear systems. In this paper, we extend this preconditioner to solve linear complementarity problems whose coefficient matrix is \(M\)-matrix or \(H\)-matrix and present a multisplitting and Schwarz method. The convergence theorems are given. The numerical experiments show that the methods are efficient.
    0 references

    Identifiers