Multisplitting iteration schemes for solving a class of nonlinear complementarity problems

DOI10.1007/s10255-006-0351-2zbMath1114.65064OpenAlexW1990092723MaRDI QIDQ871671

Chen-liang Li, Jin-ping Zeng

Publication date: 20 March 2007

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-006-0351-2

zbMATH Keywords

finite element methodparallel computationfree boundary problems\(H\)-matrixmultisplitting methodasynchronous iteration

Mathematics Subject Classification ID

Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Numerical mathematical programming methods (65K05) Numerical computation of solutions to systems of equations (65H10) Nonlinear boundary value problems for linear elliptic equations (35J65) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Parallel numerical computation (65Y05) Free boundary problems for PDEs (35R35) Complexity and performance of numerical algorithms (65Y20)

Related Items (4)

Modulus-based matrix splitting algorithms for the quasi-complementarity problems ⋮ Modulus-based Synchronous Multisplitting Iteration Methods for an Implicit Complementarity Problem ⋮ Asynchronous multisplitting GAOR method and asynchronous multisplitting SSOR method for systems of weakly nonlinear equations ⋮ A preconditioned multisplitting and Schwarz method for linear complementarity problem

Cites Work

• Unnamed Item
• Convergence of parallel multisplitting iterative methods for M-matrices
• A unified framework for the construction of various matrix multisplitting iterative methods for large sparse system of linear equations
• Parallel successive overrelaxation methods for symmetric linear complementarity problems and linear programs
• Sparsity-preserving SOR algorithms for separable quadratic and linear programming
• Asynchronous parallel successive overrelaxation for the symmetric linear complementarity problem
• Solution of nonsymmetric, linear complementarity problems by iterative methods
• On the convergence of a basic iterative method for the implicit complementarity problem
• \(H\)-splittings and two-stage iterative methods
• The convergence of parallel iteration algorithms for linear complementarity problems
• Asynchronous weighted additive Schwarz methods
• Convergence of splitting and Newton methods for complementarity problems: An application of some sensitivity results
• Parallel, synchronous and asynchronous two-stage multisplitting methods
• Multi-Splittings of Matrices and Parallel Solution of Linear Systems
• Matrix multisplitting relaxation methods for linear complementarity problems
• A Unified Representation and Theory of Algebraic Additive Schwarz and Multisplitting Methods
• On the Convergence of the Multisplitting Methods for the Linear Complementarity Problem
• Matrix Multisplitting Methods with Applications to Linear Complementarity Problems∶ Parallel Asynchronous Methods
• Parallel solutions of variational inequality problems with nonlinear source terms
• Weighted max-norm estimate of additive Schwarz iteration scheme for solving linear complementarity problems

This page was built for publication: Multisplitting iteration schemes for solving a class of nonlinear complementarity problems