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

• YAMAMURA Kiyotaka

  Faculty of Science and Engineering, Chuo University

• TANAKA Hideki

  Faculty of Science and Engineering, Chuo University

抄録

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.

収録刊行物

• IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

  IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E97.A (5), 1037-1041, 2014

  一般社団法人 電子情報通信学会

キーワード

• nonlinear circuit analysis
• circuit simulation
• finding all solutions
• mathematical programming

詳細情報

• CRID: 1390001206312471296
• NII論文ID: 130004770825
• DOI: 10.1587/transfun.e97.a.1037
• ISSN: 17451337
• ISSN: 09168508
• Web Site: https://www.jstage.jst.go.jp/article/transfun/E97.A/5/E97.A_1037/_pdf
• 本文言語コード: en
• データソース種別:
  • JaLC
  • Crossref
  • CiNii Articles
  • KAKEN
• 抄録ライセンスフラグ: 使用不可