Finding All Solutions of Piecewise-Linear Resistive Circuits Using Separable Programming

Kiyotaka YAMAMURA  Hideki TANAKA  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E97-A   No.5   pp.1037-1041
Publication Date: 2014/05/01
Online ISSN: 1745-1337
DOI: 10.1587/transfun.E97.A.1037
Type of Manuscript: PAPER
Category: Nonlinear Problems
nonlinear circuit analysis,  circuit simulation,  finding all solutions,  mathematical programming,  

Full Text: PDF(762KB)>>
Buy this Article

A new algorithm is proposed for finding all solutions of piecewise-linear resistive circuits using separable programming. In this algorithm, the problem of finding all solutions is formulated as a separable programming problem, and it is solved by the modified simplex method using the restricted-basis entry rule. Since the modified simplex method finds one solution per application, the proposed algorithm can find all solutions efficiently. Numerical examples are given to confirm the effectiveness of the proposed algorithm.