Presentation 1993/11/19
Finding All Solutions of Piecewise-Linear Resistive Circuits
Kiyotaka Yamamura,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) An efficient algorithm is presented for finding all solutions of piecewise-lineax resistive circuits.In this algorithm,a simple sign test is performed to eliminate many linear regions that do not contain a solution.This makes the number of simultaneous linear equations to be solved much smaller.This test,in its original form,is applied to each linear region;but this is time- consuming because the number of linear regions is generally very large.In this paper,it is shown that the sign test can be applied to super-regions consisting of adjacent linear regions.Therefore, many linear regions are discarded at the same time,and the computational efficiency of the algorithm is substantially improved.The branch-and-bound method is used in applying the sign test to super-regions.Some numerical examples are given,and it is shown that all solutions are computed very rapidly.The proposed algorithm is simple,efficient,and can be easily programmed.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) piecewise-linear resistive cirouit / all solution / sign test / separability / branch-and-bound method
Paper # NLP93-58
Date of Issue

Conference Information
Committee NLP
Conference Date 1993/11/19(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Nonlinear Problems (NLP)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Finding All Solutions of Piecewise-Linear Resistive Circuits
Sub Title (in English)
Keyword(1) piecewise-linear resistive cirouit
Keyword(2) all solution
Keyword(3) sign test
Keyword(4) separability
Keyword(5) branch-and-bound method
1st Author's Name Kiyotaka Yamamura
1st Author's Affiliation Department of Computer Science,Faculty of Engineering,Gunma University()
Date 1993/11/19
Paper # NLP93-58
Volume (vol) vol.93
Number (no) 335
Page pp.pp.-
#Pages 8
Date of Issue