Overlapped Partitioning Algorithm for the Solution of LSEs with Fixed Size Processor Array
Summary :
In this paper we present an Overlapped Block Gauss-Seidel (OBGS) algorithm for the solution of large scale LSEs (Linear System of Equations) based on array architecture which we have already proposed. Better partitioning for processor array usually requires (1) balanced block size, and (2) minimum coupling between blocks for better convergence. These conditions can well be satisfied by overlapping some variables in computation algorithm. The mathematical implication of overlapped partitioning is discussed at first, and some examples show the effectiveness of OBGS algorithm. Conclusion points out that the convergence properties can well be improved by proper choice of overlapped variables. An efficient algorithm is given for choosing block and variables in order to realize above conditions.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E76-A No.6 pp.1011-1018
- Publication Date
- 1993/06/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Modeling and Simulation
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
Ben CHEN, Mahoki ONODA, "Overlapped Partitioning Algorithm for the Solution of LSEs with Fixed Size Processor Array" in IEICE TRANSACTIONS on Fundamentals,
vol. E76-A, no. 6, pp. 1011-1018, June 1993, doi: .
Abstract: In this paper we present an Overlapped Block Gauss-Seidel (OBGS) algorithm for the solution of large scale LSEs (Linear System of Equations) based on array architecture which we have already proposed. Better partitioning for processor array usually requires (1) balanced block size, and (2) minimum coupling between blocks for better convergence. These conditions can well be satisfied by overlapping some variables in computation algorithm. The mathematical implication of overlapped partitioning is discussed at first, and some examples show the effectiveness of OBGS algorithm. Conclusion points out that the convergence properties can well be improved by proper choice of overlapped variables. An efficient algorithm is given for choosing block and variables in order to realize above conditions.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e76-a_6_1011/_p
Copy
@ARTICLE{e76-a_6_1011,
author={Ben CHEN, Mahoki ONODA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Overlapped Partitioning Algorithm for the Solution of LSEs with Fixed Size Processor Array},
year={1993},
volume={E76-A},
number={6},
pages={1011-1018},
abstract={In this paper we present an Overlapped Block Gauss-Seidel (OBGS) algorithm for the solution of large scale LSEs (Linear System of Equations) based on array architecture which we have already proposed. Better partitioning for processor array usually requires (1) balanced block size, and (2) minimum coupling between blocks for better convergence. These conditions can well be satisfied by overlapping some variables in computation algorithm. The mathematical implication of overlapped partitioning is discussed at first, and some examples show the effectiveness of OBGS algorithm. Conclusion points out that the convergence properties can well be improved by proper choice of overlapped variables. An efficient algorithm is given for choosing block and variables in order to realize above conditions.},
keywords={},
doi={},
ISSN={},
month={June},}
Copy
TY - JOUR
TI - Overlapped Partitioning Algorithm for the Solution of LSEs with Fixed Size Processor Array
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1011
EP - 1018
AU - Ben CHEN
AU - Mahoki ONODA
PY - 1993
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E76-A
IS - 6
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - June 1993
AB - In this paper we present an Overlapped Block Gauss-Seidel (OBGS) algorithm for the solution of large scale LSEs (Linear System of Equations) based on array architecture which we have already proposed. Better partitioning for processor array usually requires (1) balanced block size, and (2) minimum coupling between blocks for better convergence. These conditions can well be satisfied by overlapping some variables in computation algorithm. The mathematical implication of overlapped partitioning is discussed at first, and some examples show the effectiveness of OBGS algorithm. Conclusion points out that the convergence properties can well be improved by proper choice of overlapped variables. An efficient algorithm is given for choosing block and variables in order to realize above conditions.
ER -
English
