Parallel elastic finite element analysis using the balancing domain decomposition

Masao Ogino, Ryuji Shioya, Hiroshi Kanayama, Daisuke Tagami, Shinobu Yoshimura

研究成果: ジャーナルへの寄稿記事

3 引用 (Scopus)

抄録

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 done. 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 Neumann-Neumann type preconditioner with a coarse grid correction, and then its convergence estimates are independent 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.

元の言語英語
ページ(範囲)1360-1367
ページ数8
ジャーナルNihon Kikai Gakkai Ronbunshu, A Hen/Transactions of the Japan Society of Mechanical Engineers, Part A
69
発行部数9
出版物ステータス出版済み - 9 2003

Fingerprint

Domain decomposition methods
Decomposition
Finite element method
Parallel algorithms

All Science Journal Classification (ASJC) codes

  • Mechanical Engineering

これを引用

Parallel elastic finite element analysis using the balancing domain decomposition. / Ogino, Masao; Shioya, Ryuji; Kanayama, Hiroshi; Tagami, Daisuke; Yoshimura, Shinobu.

:: Nihon Kikai Gakkai Ronbunshu, A Hen/Transactions of the Japan Society of Mechanical Engineers, Part A, 巻 69, 番号 9, 09.2003, p. 1360-1367.

研究成果: ジャーナルへの寄稿記事

@article{cd38626f1828473c8af840994c7e97d4,
title = "Parallel elastic finite element analysis using the balancing domain decomposition",
abstract = "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 done. 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 Neumann-Neumann type preconditioner with a coarse grid correction, and then its convergence estimates are independent 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.",
author = "Masao Ogino and Ryuji Shioya and Hiroshi Kanayama and Daisuke Tagami and Shinobu Yoshimura",
year = "2003",
month = "9",
language = "English",
volume = "69",
pages = "1360--1367",
journal = "Nihon Kikai Gakkai Ronbunshu, A Hen/Transactions of the Japan Society of Mechanical Engineers, Part A",
issn = "0387-5008",
publisher = "一般社団法人日本機械学会",
number = "9",

}

TY - JOUR

T1 - Parallel elastic finite element analysis using the balancing domain decomposition

AU - Ogino, Masao

AU - Shioya, Ryuji

AU - Kanayama, Hiroshi

AU - Tagami, Daisuke

AU - Yoshimura, Shinobu

PY - 2003/9

Y1 - 2003/9

N2 - 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 done. 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 Neumann-Neumann type preconditioner with a coarse grid correction, and then its convergence estimates are independent 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.

AB - 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 done. 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 Neumann-Neumann type preconditioner with a coarse grid correction, and then its convergence estimates are independent 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.

UR - http://www.scopus.com/inward/record.url?scp=0344099161&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0344099161&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0344099161

VL - 69

SP - 1360

EP - 1367

JO - Nihon Kikai Gakkai Ronbunshu, A Hen/Transactions of the Japan Society of Mechanical Engineers, Part A

JF - Nihon Kikai Gakkai Ronbunshu, A Hen/Transactions of the Japan Society of Mechanical Engineers, Part A

SN - 0387-5008

IS - 9

ER -