Field-of-values analysis of preconditioned iterative methods for nonsymmetric elliptic problems

1997 ◽  
Vol 78 (1) ◽  
pp. 103-117 ◽  
Author(s):  
Gerhard Starke
Keyword(s):  
Iterative Methods ◽  
Elliptic Problems ◽  
Field Of Values ◽  
Preconditioned Iterative ◽  
Preconditioned Iterative Methods

Verification of Iterative Methods for the Linear Complementarity Problem

2016 ◽  
pp. 545-580 ◽  
Author(s):  
H. Saberi Najafi ◽  
S. A. Edalatpanah
Keyword(s):  
Fixed Point ◽  
Iterative Methods ◽  
Linear Complementarity Problem ◽  
Numerical Experiments ◽  
Linear Complementarity Problems ◽  
Linear Complementarity ◽  
Convergence Results ◽  
Fixed Point Principle ◽  
Preconditioned Iterative ◽  
Preconditioned Iterative Methods

In the present chapter, we give an overview of iterative methods for linear complementarity problems (abbreviated as LCPs). We also introduce these iterative methods for the problems based on fixed-point principle. Next, we present some new properties of preconditioned iterative methods for solving the LCPs. Convergence results of the sequence generated by these methods and also the comparison analysis between classic Gauss-Seidel method and preconditioned Gauss-Seidel (PGS) method for LCPs are established under certain conditions. Finally, the efficiency of these methods is demonstrated by numerical experiments. These results show that the mentioned models are effective in actual implementation and competitive with each other.

Sign in / Sign up

Export Citation Format

Share Document