An efficient algorithm is proposed for finding all solutions of piecewise-linear resistive circuits. This algorithm is based on a new test for nonexistence of a solution to a system of piecewise-linear equations f/sub i/(x)=0(i=1.2,/spl middot//spl middot//spl middot/,n) in a super-region. Unlike the conventional sign test, which checks whether the solution surfaces of the single piecewise-linear equations exist or not in a super-region, the new test checks whether they intersect or not in the super-region. Such a test can be performed by using linear programming. It is shown that the simplex method can be performed very efficiently by exploiting the adjacency of super-regions in each step. The proposed algorithm is much more efficient than the conventional sign test algorithms and can find all solutions of large scale circuits very efficiently. Moreover, it can find all characteristic curves of piecewise-linear resistive circuits.
展开▼
机译：提出了一种有效的算法来查找分段线性电阻电路的所有解决方案。该算法基于新检验，该检验不存在分段线性方程组f / sub i /（x）= 0（i = 1.2，/ spl middot // spl middot // spl middot /，n ）。与传统的符号测试不同，传统的符号测试检查单个分段线性方程的解表面是否在超区域中，而新的测试则检查它们在超区域中是否相交。可以通过使用线性编程来执行这种测试。结果表明，通过利用每个步骤中超区域的邻接，可以非常有效地执行单纯形方法。所提出的算法比常规的符号测试算法有效得多，并且可以非常有效地找到大规模电路的所有解决方案。而且，它可以找到分段线性电阻电路的所有特性曲线。
展开▼
