A domain decomposition approach for magnetic field problems

Kanayama Hiroshi, Shioya Ryuji, Daisuke Tagami, Nakiri Takeshi, Saito Masahiro

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 the 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, that the computed magnetic flux density is suitable, and that HDDM is effective for a magnetostatic problem where the number of degrees of freedom is about one million.

Original languageEnglish
Title of host publicationEuropean Congress on Computational Methods in Applied Sciences and Engineering, ECCOMAS 2000
Publication statusPublished - Dec 1 2000
EventEuropean Congress on Computational Methods in Applied Sciences and Engineering, ECCOMAS 2000 - Barcelona, Spain
Duration: Sep 11 2000Sep 14 2000

Publication series

NameEuropean Congress on Computational Methods in Applied Sciences and Engineering, ECCOMAS 2000

Other

OtherEuropean Congress on Computational Methods in Applied Sciences and Engineering, ECCOMAS 2000
CountrySpain
CityBarcelona
Period9/11/009/14/00

Fingerprint

Domain decomposition methods
Domain Decomposition Method
Domain Decomposition
Magnetic Field
Magnetic fields
Decomposition
Magnetostatics
Conjugate Gradient
Vector Potential
Lagrange multipliers
Magnetic flux
Parallel processing systems
Parallel Computing
Iterative Scheme
Numerical analysis
Numerical Analysis
Degree of freedom
Converge
Unknown
Numerical Results

All Science Journal Classification (ASJC) codes

  • Artificial Intelligence
  • Applied Mathematics

Cite this

Hiroshi, K., Ryuji, S., Tagami, D., Takeshi, N., & Masahiro, S. (2000). A domain decomposition approach for magnetic field problems. In European Congress on Computational Methods in Applied Sciences and Engineering, ECCOMAS 2000 (European Congress on Computational Methods in Applied Sciences and Engineering, ECCOMAS 2000).

A domain decomposition approach for magnetic field problems. / Hiroshi, Kanayama; Ryuji, Shioya; Tagami, Daisuke; Takeshi, Nakiri; Masahiro, Saito.

European Congress on Computational Methods in Applied Sciences and Engineering, ECCOMAS 2000. 2000. (European Congress on Computational Methods in Applied Sciences and Engineering, ECCOMAS 2000).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Hiroshi, K, Ryuji, S, Tagami, D, Takeshi, N & Masahiro, S 2000, A domain decomposition approach for magnetic field problems. in European Congress on Computational Methods in Applied Sciences and Engineering, ECCOMAS 2000. European Congress on Computational Methods in Applied Sciences and Engineering, ECCOMAS 2000, European Congress on Computational Methods in Applied Sciences and Engineering, ECCOMAS 2000, Barcelona, Spain, 9/11/00.
Hiroshi K, Ryuji S, Tagami D, Takeshi N, Masahiro S. A domain decomposition approach for magnetic field problems. In European Congress on Computational Methods in Applied Sciences and Engineering, ECCOMAS 2000. 2000. (European Congress on Computational Methods in Applied Sciences and Engineering, ECCOMAS 2000).
Hiroshi, Kanayama ; Ryuji, Shioya ; Tagami, Daisuke ; Takeshi, Nakiri ; Masahiro, Saito. / A domain decomposition approach for magnetic field problems. European Congress on Computational Methods in Applied Sciences and Engineering, ECCOMAS 2000. 2000. (European Congress on Computational Methods in Applied Sciences and Engineering, ECCOMAS 2000).
@inproceedings{a3ff719810bd4d8a802b5177ef6d9f55,
title = "A domain decomposition approach for magnetic field problems",
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 the 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, that the computed magnetic flux density is suitable, and that HDDM is effective for a magnetostatic problem where the number of degrees of freedom is about one million.",
author = "Kanayama Hiroshi and Shioya Ryuji and Daisuke Tagami and Nakiri Takeshi and Saito Masahiro",
year = "2000",
month = "12",
day = "1",
language = "English",
isbn = "8489925704",
series = "European Congress on Computational Methods in Applied Sciences and Engineering, ECCOMAS 2000",
booktitle = "European Congress on Computational Methods in Applied Sciences and Engineering, ECCOMAS 2000",

}

TY - GEN

T1 - A domain decomposition approach for magnetic field problems

AU - Hiroshi, Kanayama

AU - Ryuji, Shioya

AU - Tagami, Daisuke

AU - Takeshi, Nakiri

AU - Masahiro, Saito

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 the 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, that the computed magnetic flux density is suitable, and that HDDM is effective for a magnetostatic problem where the number of degrees of freedom is about one million.

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 the 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, that the computed magnetic flux density is suitable, and that HDDM is effective for a magnetostatic problem where the number of degrees of freedom is about one million.

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

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

M3 - Conference contribution

AN - SCOPUS:84893400001

SN - 8489925704

SN - 9788489925700

T3 - European Congress on Computational Methods in Applied Sciences and Engineering, ECCOMAS 2000

BT - European Congress on Computational Methods in Applied Sciences and Engineering, ECCOMAS 2000

ER -