このエントリーをはてなブックマークに追加


ID 30197
フルテキストURL
著者
Olszewski, Piotr Okayama University
Nakata, Takayoshi Okayama University
Takahashi, Norio Okayama University Kaken ID publons researchmap
Fujiwara, Koji Okayama University
抄録

A simple algorithm yielding unique face subdivision patterns of locally refined tetrahedral elements by the Delaunay tessellation process is presented. Due to the numerous advantages of edge elements, the algorithm is combined with the magnetostatic edge element computer code. A comparative analysis of four different error estimates used to locate elements for refinement, including a new one suitable for edge elements, is described. The performance of the proposed algorithm and the effectiveness of the error estimates are demonstrated by means of three-dimensional test problems

キーワード
error analysis
magnetostatics
mesh generation
備考
Digital Object Identifier: 10.1109/20.250778
Published with permission from the copyright holder.this is the institute's copy, as published in Magnetics, IEEE Transactions on, Mar 1993, Volume 29, Issue: 2, Pages 1898-1901.
Publisher URL:http://dx.doi.org/10.1109/20.250778
Copyright © 1993 IEEE. All rights reserved.
発行日
1992-09-04
出版物タイトル
Magnetics
29巻
2号
開始ページ
1898
終了ページ
1901
資料タイプ
学術雑誌論文
言語
英語
査読
有り
DOI
Submission Path
electricity_and_magnetism/148