Progress in the solving of a circuit design problem. (English) Zbl 0998.65051
The authors propose a new global branch-and-prune algorithm for the solution of systems of nonlinear equations. The pruning technique combines an interval Newton method with a constraint satisfaction algorithm that has been recently proposed by the authors.
The algorithm is compared with two other known algorithms on a circuit design problem suggested by J. J. Ebers and J. L. Moll [Large-scale behaviour of junction transistors. IEE Proc. 42, 1761-1772 (1954)]. This experiment shows that the new algorithm is five times faster.
The algorithm is compared with two other known algorithms on a circuit design problem suggested by J. J. Ebers and J. L. Moll [Large-scale behaviour of junction transistors. IEE Proc. 42, 1761-1772 (1954)]. This experiment shows that the new algorithm is five times faster.
Reviewer: Etienne Emmrich (Berlin)
MSC:
65H10 | Numerical computation of solutions to systems of equations |
65G30 | Interval and finite arithmetic |
94C05 | Analytic circuit theory |