For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
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
Publication Date: 2014/05/01
Online ISSN: 1745-1337
Type of Manuscript: PAPER
Category: Nonlinear Problems
nonlinear circuit analysis, circuit simulation, finding all solutions, mathematical programming,
Full Text: PDF>>
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.