A Linear-Time Algorithm for Extracting Tree and Loop Bases in Computational Electromagnetics

In this paper, we propose a novel loop extraction algorithm that significantly outperforms other computational electromagnetics methods. Since the algorithm does not involve loop independence tests and the rejection of candidate loops, it is also more efficient than the polynomial-time loop extraction algorithms. Further tests demonstrate that our algorithm can find a spanning tree and associated subminimal loops in linear time for a donut structure consisting of many holes