Predispatch Linear System Solution With Preconditioned Iterative Methods

2020 ◽  
Vol 32 (1) ◽  
pp. 145-152
Author(s):  
Silvia M. S. Carvalho ◽  
Aurelio R. L. Oliveira ◽  
Mayk. V. Coelho
Keyword(s):  
Linear System ◽  
Iterative Methods ◽  
System Solution ◽  
Preconditioned Iterative ◽  
Preconditioned Iterative Methods

Convergence Analysis of Preconditioned SSOR Iterative Method for Linear Systems

2014 ◽  
Vol 644-650 ◽  
pp. 1988-1991
Author(s):  
Ting Zhou
Keyword(s):  
Linear System ◽  
Iterative Method ◽  
Convergence Analysis ◽  
Linear Systems ◽  
Iterative Methods ◽  
Convergence Result ◽  
Numerical Example ◽  
Preconditioned Iterative ◽  
Preconditioned Iterative Methods

For solving the linear system, different preconditioned iterative methods have been proposed by many authors. In this paper, we present preconditioned SSOR iterative method for solving the linear systems. Meanwhile, we apply the preconditioner to H-matrix and obtain the convergence result. Finally, a numerical example is also given to illustrate our results.

Comparison Results on Preconditioned AOR-Type Iterative Method for M-Matrices

2013 ◽  
Vol 756-759 ◽  
pp. 2629-2633
Author(s):  
Ting Zhou ◽  
Hong Fang Cui
Keyword(s):  
Linear System ◽  
Convergence Rate ◽  
Iterative Method ◽  
Iterative Methods ◽  
Science And Engineering ◽  
Numerical Example ◽  
Comparison Results ◽  
Preconditioned Iterative ◽  
Preconditioned Iterative Methods

For solving the linear system, different preconditioned iterative methods have been proposed by many authors. M-matrices appear in many areas of science and engineering. In this paper, we present preconditioned AOR-type iterative method and the SOR-type iterative method with a preconditioner for solving the M-matrices. In addition, the relation between the convergence rate of preconditioned AOR-type iterative method and the parameters are brought to light. Finally, a numerical example is also given to illustrate the results.

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