Finding All Solutions of Piecewise-Linear Resistive Circuits Using Separable Programming
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E97-A No.5 pp.1037-1041
- Publication Date
- 2014/05/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E97.A.1037
- Type of Manuscript
- PAPER
- Category
- Nonlinear Problems
Authors
Kiyotaka YAMAMURA
Chuo University
Hideki TANAKA
Chuo University
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Kiyotaka YAMAMURA, Hideki TANAKA, "Finding All Solutions of Piecewise-Linear Resistive Circuits Using Separable Programming" in IEICE TRANSACTIONS on Fundamentals,
vol. E97-A, no. 5, pp. 1037-1041, May 2014, doi: 10.1587/transfun.E97.A.1037.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E97.A.1037/_p
Copy
@ARTICLE{e97-a_5_1037,
author={Kiyotaka YAMAMURA, Hideki TANAKA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Finding All Solutions of Piecewise-Linear Resistive Circuits Using Separable Programming},
year={2014},
volume={E97-A},
number={5},
pages={1037-1041},
abstract={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.},
keywords={},
doi={10.1587/transfun.E97.A.1037},
ISSN={1745-1337},
month={May},}
Copy
TY - JOUR
TI - Finding All Solutions of Piecewise-Linear Resistive Circuits Using Separable Programming
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1037
EP - 1041
AU - Kiyotaka YAMAMURA
AU - Hideki TANAKA
PY - 2014
DO - 10.1587/transfun.E97.A.1037
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E97-A
IS - 5
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - May 2014
AB - 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.
ER -
English
