Bibliographic Details
| Title: |
Efficient Algorithms and Data Structures for Element-Free Galerkin Method. |
| Authors: |
Parreira, Guilherme F., Fonseca, Alexandre R., Lisboa, Adriano C., Silva, Elson J., Mesquita, Renato C. |
| Source: |
IEEE Transactions on Magnetics; Apr2006, Vol. 42 Issue 4, p659-662, 4p |
| Subject Terms: |
Galerkin methods, Numerical analysis, Data structures, Algorithms, Electronic data processing, Boundary value problems |
| Abstract: |
The element-free Galerkin method (EFG) has specific characteristics that require the usage of techniques and data structures in order to provide efficient calculation. This paper address two problems concerning the EFG implementation. The point location problem, which must find in which subdomain the integration point is located, and the influence domain problem, which must find the nearest nodes to build an influence domain and construct the shape functions. This work proposes the use of new data structures and algorithms in order to solve these problems, speeding up the method and providing a fast and correct influence domain construction. [ABSTRACT FROM AUTHOR] |
|
Copyright of IEEE Transactions on Magnetics is the property of IEEE and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Complementary Index |