| 作成者 |
|
|
|
|
|
|
|
|
|
| 本文言語 |
|
| 出版者 |
|
|
|
| 発行日 |
|
| 収録物名 |
|
| 巻 |
|
| 号 |
|
| 開始ページ |
|
| 終了ページ |
|
| 出版タイプ |
|
| アクセス権 |
|
| 関連DOI |
|
| 関連DOI |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 関連URI |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 関連URI |
|
| 関連HDL |
|
| 関連情報 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 概要 |
The iterative Domain Decomposition Method (DDM) is one of the most effective parallel algorithm for large scale problems due to its excellent parallelism and variety of researches have already been do...ne. As the iterative DDM satisfies continuity among subdomains through the iterative calculations, it is indispensable to reduce the number of iterations with a preconditioning technique especially for speed-up for computing. Thus, we have chosen the Balancing Domain Decomposition (BDD) proposed by J. Mandel. The BDD is a Neu-mann-Neumann type preconditioner with a coarse grid correction, and then its convergence estimates are in-dependent of the number of subdomains. In this research, we introduce the BDD algorithm and how to apply it for elastic problems, then we develop a parallel BDD based on the Hierarchical DDM (HDDM) and apply it to some numerical examples on parallel computers.続きを見る
|
Mendeley出力
JSME-TA_2003_ogino_bdd