By Topic

A simple algorithm for adaptive refinement of tetrahedral meshes combined with edge elements

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Olszewski, P. ; Dept. of Electr. Eng., Okayama Univ., Japan ; Nakata, T. ; Takahashi, N. ; Fujiwara, K.

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

Published in:

Magnetics, IEEE Transactions on  (Volume:29 ,  Issue: 2 )