| |
ISSN 2234-8417 (Online)
ISSN 1598-5857 (Print)
|
| |
| |
 |
| |
|
| |
|
| |
 |
Table of Contents |
|
| |
|
| |
|
| |
|
| |
| |
 Performance comparison of preconditioned iterative methods with direct preconditioners |
| |
|
By Jae Heon Yun, Hyo Jin Lim
..........1517 |
| |
|
|
| |
| |
|
|
 Generic
Number - 1517 |
| References
- 0 |
| Written
Date -
May 16th, 14 |
| Modified
Date -
May 16th, 14 |
| Downloaded
Counts - 1141 |
| Visited
Counts - 1582 |
| |
| Original
File |
|
|
|
| Summary |
In this paper, we first provide comparison results of preconditioned AOR methods
with direct preconditioners $I+\beta L$, $I+\beta U$ and $I+\beta (L+U)$ for
solving a linear system whose coefficient matrix is a large sparse irreducible L-
matrix, where $\beta > 0$. Next we propose how to find a near optimal parameter
$\beta$ for which Krylov subspace method with these direct preconditioners
performs nearly best. Lastly numerical experiments are provided to compare the
performance of preconditioned iterative methods and to illustrate the theoretical
results. |
|
|
| |
|
| |
|
|
|
