A Simple and Fast Edge Finding Algorithm for Generating an RWG Function

摘要

The search pointer array data structure is presented according to the index characteristic of the edge node on the basis function; thus, a new edge finding algorithm is developed with reduced numerical complexity, of the order O(N), instead of the complexity O(N~2), for classical direct search, or O(N log(N)) for the Adelson-Velsky and Landis (AVL) tree. Numerical experiments show that the new algorithm features fast speed, simplicity, and less memory requirement, which meets the demand of large-scale computational electromagnetic problems as solved by a multilevel fast multipole method (MLFMM).