A reordering scheme for the vectorizable preconditioner for the large sparse linear systems on the CRAY-2


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 2, No. 6, pp. 960-968, Nov. 1995
10.3745/KIPSTE.1995.2.6.960,   PDF Download:

Abstract

In this paper we present a reordering scheme that could lead to efficient vectorization of the preconditioners for the large sparse linear systems arising from partial differential equations on the CRAY-2. This reordering scheme is a line version of the conventional red/black ordering. This reordering scheme, coupled with a variant of ILU(Incomplete LU) preconditioning, can overcome the poor rate of convergence of the conventional red/black reordering, if relatively large number of fill-ins were used. We substantiate our claim by conducting various experiments on the CRAY-2 machine. Also, the computation of the Frobenius norm of the error matrices agree with our claim.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
M. S. Back, "A reordering scheme for the vectorizable preconditioner for the large sparse linear systems on the CRAY-2," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 2, no. 6, pp. 960-968, 1995. DOI: 10.3745/KIPSTE.1995.2.6.960.

[ACM Style]
Ma Sang Back. 1995. A reordering scheme for the vectorizable preconditioner for the large sparse linear systems on the CRAY-2. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 2, 6, (1995), 960-968. DOI: 10.3745/KIPSTE.1995.2.6.960.