Premium
Infinite‐link closed‐mesh diakoptics
Author(s) -
Gregory K.,
Smith I. R.,
Kettleborough J. G.
Publication year - 1998
Publication title -
international journal of numerical modelling: electronic networks, devices and fields
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.249
H-Index - 30
eISSN - 1099-1204
pISSN - 0894-3370
DOI - 10.1002/(sici)1099-1204(199803/04)11:2<105::aid-jnm292>3.0.co;2-6
Subject(s) - computer science , range (aeronautics) , matrix (chemical analysis) , algorithm , mathematical optimization , subdivision , power (physics) , sparse matrix , point (geometry) , link (geometry) , mathematics , engineering , geometry , computer network , materials science , civil engineering , physics , quantum mechanics , composite material , gaussian , aerospace engineering
This paper describes a computationally efficient diakoptic algorithm for the solution of closed‐mesh electrical network equations. The algorithm is designed for use with time‐varying and/or discontinuous equations describing limited size power supply systems, allowing them to be torn into smaller subdivisions in a manner that is independent of their structure. The efficiency of the algorithm is demonstrated by comparing its performance with that obtained when using a more conventional sparse matrix technique, on the basis of the number of floating point operations required for the solution of a range of typical network problems. Mention is made of the parallel processes inherent in the resultant equation structure. © 1998 John Wiley & Sons, Ltd.