IEICE TRANSACTIONS on Fundamentals
An Efficient Algorithm for Finding All DC Solutions of Piecewise-Linear Circuits
Summary :
An efficient algorithm is proposed for finding all dc solutions of piecewise-linear (PWL) circuits. This algorithm is based on a powerful test (termed the LP test) for nonexistence of a solution to a system of PWL equations in a given region using the dual simplex method. The proposed algorithm also uses a special technique that decreases the number of regions on which the LP test is performed. By numerical examples, it is shown that the proposed algorithm could find all solutions of large scale problems, including those where the number of variables is 500 and the number of linear regions is 10500, in practical computation time.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E85-A No.11 pp.2459-2467
- Publication Date
- 2002/11/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Nonlinear Problems
Authors
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, Masaki SATO, Osamu NAKAMURA, Takayoshi KUMAKURA, "An Efficient Algorithm for Finding All DC Solutions of Piecewise-Linear Circuits" in IEICE TRANSACTIONS on Fundamentals,
vol. E85-A, no. 11, pp. 2459-2467, November 2002, doi: .
Abstract: An efficient algorithm is proposed for finding all dc solutions of piecewise-linear (PWL) circuits. This algorithm is based on a powerful test (termed the LP test) for nonexistence of a solution to a system of PWL equations in a given region using the dual simplex method. The proposed algorithm also uses a special technique that decreases the number of regions on which the LP test is performed. By numerical examples, it is shown that the proposed algorithm could find all solutions of large scale problems, including those where the number of variables is 500 and the number of linear regions is 10500, in practical computation time.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e85-a_11_2459/_p
Copy
@ARTICLE{e85-a_11_2459,
author={Kiyotaka YAMAMURA, Masaki SATO, Osamu NAKAMURA, Takayoshi KUMAKURA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={An Efficient Algorithm for Finding All DC Solutions of Piecewise-Linear Circuits},
year={2002},
volume={E85-A},
number={11},
pages={2459-2467},
abstract={An efficient algorithm is proposed for finding all dc solutions of piecewise-linear (PWL) circuits. This algorithm is based on a powerful test (termed the LP test) for nonexistence of a solution to a system of PWL equations in a given region using the dual simplex method. The proposed algorithm also uses a special technique that decreases the number of regions on which the LP test is performed. By numerical examples, it is shown that the proposed algorithm could find all solutions of large scale problems, including those where the number of variables is 500 and the number of linear regions is 10500, in practical computation time.},
keywords={},
doi={},
ISSN={},
month={November},}
Copy
TY - JOUR
TI - An Efficient Algorithm for Finding All DC Solutions of Piecewise-Linear Circuits
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2459
EP - 2467
AU - Kiyotaka YAMAMURA
AU - Masaki SATO
AU - Osamu NAKAMURA
AU - Takayoshi KUMAKURA
PY - 2002
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E85-A
IS - 11
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - November 2002
AB - An efficient algorithm is proposed for finding all dc solutions of piecewise-linear (PWL) circuits. This algorithm is based on a powerful test (termed the LP test) for nonexistence of a solution to a system of PWL equations in a given region using the dual simplex method. The proposed algorithm also uses a special technique that decreases the number of regions on which the LP test is performed. By numerical examples, it is shown that the proposed algorithm could find all solutions of large scale problems, including those where the number of variables is 500 and the number of linear regions is 10500, in practical computation time.
ER -
English
