Please use this identifier to cite or link to this item:
|Title:||Refinement computations of electromagnetic fields using FE and meshless methods|
Wong, Ho-ching Chris
Moving least squares approximation
|Source:||IEEE transactions on magnetics, May 2005, v. 41, no. 5, p. 1456-1459.|
|Abstract:||A refinement algorithm for electromagnetic field computations using a combination of finite element and meshless methods is introduced. Bridging scales are used to separate the finite element and meshless shape functions to make the refinement hierarchical and to uphold the mathematical properties such as consistency and linear independence for all the bases. To facilitate the application of the proposed algorithm, details about the node addition, requirements for the node distribution, and relationships between the finite element and meshless shape functions, as well as the determination of the stop criterion are also fully addressed. Primary numerical results are reported to demonstrate and validate the applicability and advantages of the proposed algorithm over traditional ones.|
|Rights:||© 2005 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.|
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
|Appears in Collections:||EE Journal/Magazine Articles|
IC Journal/Magazine Articles
Files in This Item:
|refinement-computations_05.pdf||202.28 kB||Adobe PDF||View/Open|
All items in the PolyU Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated. No item in the PolyU IR may be reproduced for commercial or resale purposes.