A parallel computing for magnetostatic problems with iterative domain decomposition method

Daisuke Tagami, Hiroshi Kanayama, Ryuji Shioya, Takeshi Nakiri

研究成果: ジャーナルへの寄稿Conference article

2 引用 (Scopus)

抄録

A numerical analysis with an iterative domain decomposition method is performed for magnetostatic problems, which is based on the initial step of an iterative scheme without the Lagrange multiplier. The magnetic vector potential, which is considered as an unknown function, is descretized by the Nedelec element of simplex type. The iterative domain decomposition method is combined with the Conjugate Gradient (CG) procedure, and the Hierarchical Domain Decomposition Method (HDDM), which has been shown effective for structural problems, is adopted for the parallel computing. Numerical results show that the CG procedure converges, and that the computed magnetic flux density is suitable. Moreover a magnetostatic problem where the number of degrees of freedom is about one million can be solved by using HDDM.

元の言語英語
ページ(範囲)321-329
ページ数9
ジャーナルTheoretical and Applied Mechanics
49
出版物ステータス出版済み - 12 1 2000
イベント49th National Congress on Theoretical and Applied Mechanics 2000 - Tokyo, 日本
継続期間: 1 25 20001 27 2000

Fingerprint

parallel computing
Domain decomposition methods
Magnetostatics
Parallel processing systems
decomposition
Lagrange multipliers
Magnetic flux
Numerical analysis
method

All Science Journal Classification (ASJC) codes

  • Mechanics of Materials

これを引用

A parallel computing for magnetostatic problems with iterative domain decomposition method. / Tagami, Daisuke; Kanayama, Hiroshi; Shioya, Ryuji; Nakiri, Takeshi.

:: Theoretical and Applied Mechanics, 巻 49, 01.12.2000, p. 321-329.

研究成果: ジャーナルへの寄稿Conference article

Tagami, Daisuke ; Kanayama, Hiroshi ; Shioya, Ryuji ; Nakiri, Takeshi. / A parallel computing for magnetostatic problems with iterative domain decomposition method. :: Theoretical and Applied Mechanics. 2000 ; 巻 49. pp. 321-329.
@article{c1d40ff256954be6a7fc4166dfbfabe7,
title = "A parallel computing for magnetostatic problems with iterative domain decomposition method",
abstract = "A numerical analysis with an iterative domain decomposition method is performed for magnetostatic problems, which is based on the initial step of an iterative scheme without the Lagrange multiplier. The magnetic vector potential, which is considered as an unknown function, is descretized by the Nedelec element of simplex type. The iterative domain decomposition method is combined with the Conjugate Gradient (CG) procedure, and the Hierarchical Domain Decomposition Method (HDDM), which has been shown effective for structural problems, is adopted for the parallel computing. Numerical results show that the CG procedure converges, and that the computed magnetic flux density is suitable. Moreover a magnetostatic problem where the number of degrees of freedom is about one million can be solved by using HDDM.",
author = "Daisuke Tagami and Hiroshi Kanayama and Ryuji Shioya and Takeshi Nakiri",
year = "2000",
month = "12",
day = "1",
language = "English",
volume = "49",
pages = "321--329",
journal = "Theoretical and Applied Mechanics",
issn = "0285-6042",
publisher = "University of Tokyo Press",

}

TY - JOUR

T1 - A parallel computing for magnetostatic problems with iterative domain decomposition method

AU - Tagami, Daisuke

AU - Kanayama, Hiroshi

AU - Shioya, Ryuji

AU - Nakiri, Takeshi

PY - 2000/12/1

Y1 - 2000/12/1

N2 - A numerical analysis with an iterative domain decomposition method is performed for magnetostatic problems, which is based on the initial step of an iterative scheme without the Lagrange multiplier. The magnetic vector potential, which is considered as an unknown function, is descretized by the Nedelec element of simplex type. The iterative domain decomposition method is combined with the Conjugate Gradient (CG) procedure, and the Hierarchical Domain Decomposition Method (HDDM), which has been shown effective for structural problems, is adopted for the parallel computing. Numerical results show that the CG procedure converges, and that the computed magnetic flux density is suitable. Moreover a magnetostatic problem where the number of degrees of freedom is about one million can be solved by using HDDM.

AB - A numerical analysis with an iterative domain decomposition method is performed for magnetostatic problems, which is based on the initial step of an iterative scheme without the Lagrange multiplier. The magnetic vector potential, which is considered as an unknown function, is descretized by the Nedelec element of simplex type. The iterative domain decomposition method is combined with the Conjugate Gradient (CG) procedure, and the Hierarchical Domain Decomposition Method (HDDM), which has been shown effective for structural problems, is adopted for the parallel computing. Numerical results show that the CG procedure converges, and that the computed magnetic flux density is suitable. Moreover a magnetostatic problem where the number of degrees of freedom is about one million can be solved by using HDDM.

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

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

M3 - Conference article

AN - SCOPUS:0034580428

VL - 49

SP - 321

EP - 329

JO - Theoretical and Applied Mechanics

JF - Theoretical and Applied Mechanics

SN - 0285-6042

ER -