### 抄録

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 2000 → 1 27 2000 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Mechanics of Materials

### これを引用

*Theoretical and Applied Mechanics*,

*49*, 321-329.

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

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

*Theoretical and Applied Mechanics*, 巻. 49, pp. 321-329.

}

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 -