Name
Abstract | ||
|---|---|---|
In this paper, we present preconditioned generalized accelerated overrelaxation methods. We compare the spectral radii of the iteration matrices of the preconditioned and original methods. The comparison results show that the preconditioned GAOR methods converge faster than the GAOR method whenever the GAOR method is convergent. Finally, we present two numerical examples to confirm our theoretical results. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1016/j.amc.2012.12.021 | Applied Mathematics and Computation |
Keywords | Field | DocType |
preconditioned gaor method,gaor method,original method,spectral radius,theoretical result,iteration matrix,accelerated overrelaxation method,comparison result,numerical example,convergence,linear system | Convergence (routing),Mathematical optimization,Linear system,Matrix (mathematics),Algorithm,Mathematics | Journal |
Volume | Issue | ISSN |
219 | 11 | 0096-3003 |
Citations | PageRank | References |
2 | 0.43 | 4 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Guangbin Wang | 1 | 35 | 8.44 |
| Ting Wang | 2 | 36 | 9.43 |
| Fuping Tan | 3 | 3 | 1.50 |