The Conjugate Residual method, one of the iterative methods for solving linear systems, is applied to the problems with a dense coefficient matrix on distributed memory parallel computers. Based on an assumption on the computation and communication times of the proposed algorithm for parallel computers, it is shown that the optimal number of processing elements is proportional to the problem size N. The validity of the prediction is confirmed through numerical experiments on Hitachi SR2201.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Muneharu YOKOYAMA, Takaomi SHIGEHARA, Hiroshi MIZOGUCHI, Taketoshi MISHIMA, "Iterative Methods for Dense Linear Systems on Distributed Memory Parallel Computers" in IEICE TRANSACTIONS on Fundamentals,
vol. E82-A, no. 3, pp. 483-486, March 1999, doi: .
Abstract: The Conjugate Residual method, one of the iterative methods for solving linear systems, is applied to the problems with a dense coefficient matrix on distributed memory parallel computers. Based on an assumption on the computation and communication times of the proposed algorithm for parallel computers, it is shown that the optimal number of processing elements is proportional to the problem size N. The validity of the prediction is confirmed through numerical experiments on Hitachi SR2201.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e82-a_3_483/_p
Copy
@ARTICLE{e82-a_3_483,
author={Muneharu YOKOYAMA, Takaomi SHIGEHARA, Hiroshi MIZOGUCHI, Taketoshi MISHIMA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Iterative Methods for Dense Linear Systems on Distributed Memory Parallel Computers},
year={1999},
volume={E82-A},
number={3},
pages={483-486},
abstract={The Conjugate Residual method, one of the iterative methods for solving linear systems, is applied to the problems with a dense coefficient matrix on distributed memory parallel computers. Based on an assumption on the computation and communication times of the proposed algorithm for parallel computers, it is shown that the optimal number of processing elements is proportional to the problem size N. The validity of the prediction is confirmed through numerical experiments on Hitachi SR2201.},
keywords={},
doi={},
ISSN={},
month={March},}
Copy
TY - JOUR
TI - Iterative Methods for Dense Linear Systems on Distributed Memory Parallel Computers
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 483
EP - 486
AU - Muneharu YOKOYAMA
AU - Takaomi SHIGEHARA
AU - Hiroshi MIZOGUCHI
AU - Taketoshi MISHIMA
PY - 1999
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E82-A
IS - 3
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - March 1999
AB - The Conjugate Residual method, one of the iterative methods for solving linear systems, is applied to the problems with a dense coefficient matrix on distributed memory parallel computers. Based on an assumption on the computation and communication times of the proposed algorithm for parallel computers, it is shown that the optimal number of processing elements is proportional to the problem size N. The validity of the prediction is confirmed through numerical experiments on Hitachi SR2201.
ER -