A simple algorithm for finding all solutions of piecewise-linear networks

An efficient algorithm is presented for the searching of all solutions of a piecewise-linear (PWL) resistive network. Let P/sub /n be the number of largest segments of PWL resistors, and P/sub /n/sub -1/ the second largest. The algorithm presented is better than the brute-force method by a factor of P/sub /n*P/sub /n/sub -1/ and the Chua and Ying method, the most efficient method at the present time, by a factor of at least P/sub /n/sub -1/. The algorithm is based on a PWL network theorem, which is also introduced.<
>