A Simple Algorithm for Finding All Solutions of Piecewise-Linear Resistive Circuits
スポンサーリンク
概要
- 論文の詳細を見る
An efficient algorithm is presented for finding all solutions of piecewise-linear resistive circuits. In this algorithm, a simple sign test is performed to eliminate many linear regions that do not contain a solution. Therefore, the number of simultaneous linear equations to be solved is substantially decreased. This test, in its original form, requires O(Ln^2) additions and comparisons in the worst case, where n is the number of variables and L is the number of linear regions. In this paper, an effective technique is proposed that reduces the computational complexity of the sign test to O(Ln). Some numerical examples are given, and it is shown that all solutions can be computed very efficiently. The proposed algorithm is simple and can be easily programmed by using recursive functions.
- 一般社団法人電子情報通信学会の論文
- 1993-10-25
著者
関連論文
- An Efficient Algorithm for Finding All DC Solutions of Piecewise-Linear Circuits(Regular Section)
- A Practical Approach for the Fixed-Point Homotopy Method Using a Solution-Tracing Circuit
- Finding All Solutions of Nonlinear Equations Using Inverses of Approximate Jacobian Matrices
- Finding All Solutions of Transistor Circuits Using Linear Programming
- A Contraction Algorithm Using a Sign Test for Finding All Solutions of Piecewise-Linear Resistive Circuits
- Finding All Solutions of Weakly Nonlinear Equations Using Linear Programming
- A Simple Algorithm for Finding All Solutions of Piecewise-Linear Resistive Circuits
- On the Stability of dc Operating Points Obtained by Solving Hybrid Equations
- Computation of Constrained Channel Capacity by Newton's Method