By Topic

An optimized parallel admittance matrix approach using the adjacence-graph recursive-thresholding technique

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

3 Author(s)
Esposito, A. ; Dept. of Innovation Eng., Lecce Univ., Italy ; Malucelli, F. ; Tarricone, L.

The admittance method is an accurate approach for the analysis of electromagnetic circuits. Unfortunately, until now it has suffered from two main limitations, i.e., its high numerical complexity and its lack of robustness, due to the risk of numerical ill conditioning in a linear system representing the core of the approach. In a previous paper, both drawbacks have been solved, using a strategy based on the system partitioning into many independent and well-conditioned reduced-size subsystems, thanks to the exploitation of the matrix adjacence graph properties. In this paper, we demonstrate that the use of this strategy paves the way to a natural, straightforward, and low-cost migration on distributed platforms, with a consequent substantial reduction in computer times. Furthermore, the use of suitable optimization strategies proposed here allows an optimum partitioning of the system in order to maximize the parallel efficiency

Published in:

Microwave Theory and Techniques, IEEE Transactions on  (Volume:50 ,  Issue: 9 )