| タイトル | Multi-color incomplete Cholesky conjugate gradient methods for vector computers |
| 本文（外部サイト） | http://hdl.handle.net/2060/19860019188 |
| 著者（英） | Poole, E. L. |
| 著者所属（英） | Virginia Univ. |
| 発行日 | 1986-05-01 |
| 言語 | eng |
| 内容記述 | In this research, we are concerned with the solution on vector computers of linear systems of equations, Ax = b, where A is a larger, sparse symmetric positive definite matrix. We solve the system using an iterative method, the incomplete Cholesky conjugate gradient method (ICCG). We apply a multi-color strategy to obtain p-color matrices for which a block-oriented ICCG method is implemented on the CYBER 205. (A p-colored matrix is a matrix which can be partitioned into a pXp block matrix where the diagonal blocks are diagonal matrices). This algorithm, which is based on a no-fill strategy, achieves O(N/p) length vector operations in both the decomposition of A and in the forward and back solves necessary at each iteration of the method. We discuss the natural ordering of the unknowns as an ordering that minimizes the number of diagonals in the matrix and define multi-color orderings in terms of disjoint sets of the unknowns. We give necessary and sufficient conditions to determine which multi-color orderings of the unknowns correpond to p-color matrices. A performance model is given which is used both to predict execution time for ICCG methods and also to compare an ICCG method to conjugate gradient without preconditioning or another ICCG method. Results are given from runs on the CYBER 205 at NASA's Langley Research Center for four model problems. |
| NASA分類 | NUMERICAL ANALYSIS |
| レポートNO | 86N28660
NASA-CR-178117
NAS 1.26:178117 |
| 権利 | No Copyright |
| URI | https://repository.exst.jaxa.jp/dspace/handle/a-is/153720 |
|
