| タイトル | Multiprocessor sparse L/U decomposition with controlled fill-in |
| 本文（外部サイト） | http://hdl.handle.net/2060/19860007475 |
| 著者（英） | Alaghband, G.; Jordan, H. F. |
| 著者所属（英） | NASA Langley Research Center |
| 発行日 | 1985-10-01 |
| 言語 | eng |
| 内容記述 | Generation of the maximal compatibles of pivot elements for a class of small sparse matrices is studied. The algorithm involves a binary tree search and has a complexity exponential in the order of the matrix. Different strategies for selection of a set of compatible pivots based on the Markowitz criterion are investigated. The competing issues of parallelism and fill-in generation are studied and results are provided. A technque for obtaining an ordered compatible set directly from the ordered incompatible table is given. This technique generates a set of compatible pivots with the property of generating few fills. A new hueristic algorithm is then proposed that combines the idea of an ordered compatible set with a limited binary tree search to generate several sets of compatible pivots in linear time. Finally, an elimination set to reduce the matrix is selected. Parameters are suggested to obtain a balance between parallelism and fill-ins. Results of applying the proposed algorithms on several large application matrices are presented and analyzed. |
| NASA分類 | COMPUTER PROGRAMMING AND SOFTWARE |
| レポートNO | 86N16945
AD-A211570
NASA-CR-178016
NAS 1.26:178016
ICASE-85-48 |
| 権利 | No Copyright |
| URI | https://repository.exst.jaxa.jp/dspace/handle/a-is/154893 |
