This paper is concerned about an implementation of an accelerated domain decomposition iterative
procedure. In [4], Douglas and Huang had shown the convergence for one dimensional
partitioning case. This time we make an implementation to show the numerical results, and
further more extend our procedure to two dimensional partitioning case.
Our results show that the parameter sequence do accelerate our iterative procedure. In
one dimensional partitioning case, we have the rule to choose the parameter sequence[4], but
in two dimensional partitioning case, we still have no idea about the rule, but we still try to
find some parameters to make our procedure more e cient. After some tests, we find that
the sequence {0.4, 0.43, 0.45, 0.47, 0.5} works. Though the iteration steps in two dimensional
partitioning are not decreasing, our results show the computation time is almost the same
as which in the two dimensional partitioning case. It means that the parallelized program
could cut down the computation cost.
| Identifer | oai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0715102-143756 |
| Date | 15 July 2002 |
| Creators | Li, Yi-mou |
| Contributors | ALLEN T. L. HORNG, Tzon-Tzer Lu, Chien-sen Huang, Zi-Cai Li, Shih-Yu Shen |
| Publisher | NSYSU |
| Source Sets | NSYSU Electronic Thesis and Dissertation Archive |
| Language | English |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0715102-143756 |
| Rights | unrestricted, Copyright information available at source archive |
Page generated in 0.0012 seconds