Multisplitting iteration schemes for solving a class of nonlinear complementarity problems
\(H\)-matrixasynchronous iterationfinite element methodfree boundary problemsmultisplitting methodparallel computation
Nonlinear boundary value problems for linear elliptic equations (35J65) Free boundary problems for PDEs (35R35) Numerical computation of solutions to systems of equations (65H10) Numerical mathematical programming methods (65K05) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
The authors consider the following nonlinear complementarity problem: Find an \(x\in \mathbb{R}^n\), \[ x\geq0,\quad Ax+f(x)\geq0,\quad x^\top (Ax+f(x))=0. \] Here \(A\) is a given \(H\)-matrix \((n\times n)\), \(f(x)=(f_i(x_i))^n_{i=1}\), \(\frac{\partial f_i(x_i)}{\partial x_i}\geq 0\). Such problems may arise on the application of the finite element method to some free boundary problems with nonlinear source terms (there is brief example in the work). Keeping in mind the multithreading calculations, the authors bring synchronous and asynchronous parallel multisplitting iteration schemes. These schemes are the extensions to the above nonlinear problem of the linear complementarity synchronous and linear solver asynchronous schemes from \textit{Z.Z. Bai} [SIAM J.~Matrix Anal.~Appl. 21, No. 1, 67--78 (1999; Zbl 0942.65059)] and \textit{A. Frommer, H. Schwandt}, and \textit{D. B. Szyld} [ETNA 5, 48--61 (1997; Zbl 0890.65027)]. The convergence of the algorithms is investigated. The work contains results of numerical tests which show the greater performance of the asynchronous method. Unfortunately these tests do not contain the specifications of \(f(x)\). It is not clear, how essential nonlinearities include they.
- Synchronous and asynchronous multisplitting iteration schemes for solving mixed linear complementarity problems with H-matrices
- Matrix Multisplitting Methods with Applications to Linear Complementarity Problems∶ Parallel Asynchronous Methods
- Matrix multisplitting relaxation methods for linear complementarity problems
- Modulus-based synchronous multisplitting iteration methods for a restricted class of nonlinear complementarity problems
- Modulus-based multisplitting iteration methods for a class of nonlinear complementarity problems
- \(H\)-splittings and two-stage iterative methods
- A unified framework for the construction of various matrix multisplitting iterative methods for large sparse system of linear equations
- A Unified Representation and Theory of Algebraic Additive Schwarz and Multisplitting Methods
- Asynchronous parallel successive overrelaxation for the symmetric linear complementarity problem
- Asynchronous weighted additive Schwarz methods
- Convergence of parallel multisplitting iterative methods for M-matrices
- Convergence of splitting and Newton methods for complementarity problems: An application of some sensitivity results
- Matrix Multisplitting Methods with Applications to Linear Complementarity Problems∶ Parallel Asynchronous Methods
- Matrix multisplitting relaxation methods for linear complementarity problems
- Multi-Splittings of Matrices and Parallel Solution of Linear Systems
- On the convergence of a basic iterative method for the implicit complementarity problem
- On the Convergence of the Multisplitting Methods for the Linear Complementarity Problem
- Parallel solutions of variational inequality problems with nonlinear source terms
- Parallel successive overrelaxation methods for symmetric linear complementarity problems and linear programs
- Parallel, synchronous and asynchronous two-stage multisplitting methods
- Relaxed asynchronous iterations for the linear complementarity problem
- Solution of nonsymmetric, linear complementarity problems by iterative methods
- Sparsity-preserving SOR algorithms for separable quadratic and linear programming
- The convergence of parallel iteration algorithms for linear complementarity problems
- Weighted max-norm estimate of additive Schwarz iteration scheme for solving linear complementarity problems
- A class of generalized multisplitting relaxation methods for linear complementarity problems
- Modulus-based matrix splitting algorithms for the quasi-complementarity problems
- A multisplitting method for symmetric linear complementarity problems
- A preconditioned multisplitting and Schwarz method for linear complementarity problem
- Inexact multisplitting methods for linear complementarity problems
- Improved convergence theorems of multisplitting methods for the linear complementarity problem
- 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
This page was built for publication: Multisplitting iteration schemes for solving a class of nonlinear complementarity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q871671)
