Communication reduction problem in Schur complement method on distributed memory architecture.
碩士 === 國立中山大學 === 應用數學系研究所 === 106 === A common approach to solving a large sparse linear system in parallel is using the k-way partition method to relabel the variables and equations so that the rearranged matrix has a block arrow form, followed by Schur complement method to eliminate the resulting...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2018
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/25qu93 |