Two algorithms for obtaining sparse loop matrices

This paper deals with the problem of obtaining a linearly independent set of loop matrix equations, whose nonzero pattern is as sparse as possible. Unlike existing procedures, based on trees and associated fundamental loops, the two algorithms proposed in this paper attempt to find as short as possi...

Ausführliche Beschreibung