Progress in the solving of a circuit design problem
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 \textit{J. J. Ebers} and \textit{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.
- Experiments using interval analysis for solving a circuit design problem
- A constraint satisfaction approach to a circuit design problem
- scientific article; zbMATH DE number 3985121
- scientific article; zbMATH DE number 29142
- Solving the Linear Complementarity Problem in Circuit Simulation
- Circuit optimization by rewiring
- Analog circuit for solving assignment problems
- scientific article; zbMATH DE number 3875297
- Circuit minimization problem
- Converging search for a solution of technical diagnosis problems in digital circuits
- Experiments using interval analysis for solving a circuit design problem
- Global optimization by continuous grasp
- Deterministic global optimization using interval constraint propagation techniques
- Algorithmic differentiation and hull-consistency enforcing using C++ template meta-programming
- Presentation of a highly tuned multithreaded interval solver for underdetermined and well-determined nonlinear systems. Empirical evaluation of innovations
This page was built for publication: Progress in the solving of a circuit design problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5954664)
