About: IEICE technical report. Nonlinear problems is an academic journal. The journal publishes majorly in the area(s): Synchronization (computer science) & Chaotic. Over the lifetime, 62 publications have been published receiving 152 citations.
TL;DR: In this paper, the chaotic simulated annealing algorithm for combinatorial optimization problems is examined in the light of the global bifurcation structure of the chaotic neural networks.
Abstract: The chaotic simulated annealing algorithm for combinatorial optimization problems is examined in the light of the global bifurcation structure of the chaotic neural networks. We show that the result of the chaotic simulated annealing algorithm is primarily dependent upon the global bifurcation structure of the chaotic neural networks and unlike the stochastic simulated annealing infinitely slow chaotic annealing does not necessarily provide an optimum result. As an improved algorithm, the adaptive chaotic simulated annealing algorithm is introduced. Using several instances of 20- and 40-city traveling salesman problems, efficiency of the adaptive algorithm is demonstrated. @S1063-651X~98!15510-1#
TL;DR: In this paper, the authors present an efficient algorithm for finding all solutions of piecewise-linear resistive circuits using two types of sign tests; one is a new test that is proposed in this paper, and the other is the test proposed by Yamamura and Ochiai (1992).
Abstract: This paper presents an efficient algorithm for finding all solutions of piecewise-linear resistive circuits. The algorithm uses two types of sign tests; one is a new test that is proposed in this paper, and the other is the test proposed by Yamamura and Ochiai (1992). The computational complexity of the new test is much smaller than that of Yamamura and Ochiai's test. These tests eliminate many linear regions that do not contain a solution. Therefore, the number of simultaneous linear equations to be solved is substantially reduced. The proposed algorithm is very simple and efficient. >
TL;DR: An efficient algorithm is proposed for finding all solutions of piecewise-linear (PWL) resistive circuits using the simplex method and it is shown that the proposed algorithm could find all solution of relatively large scale problems in practical computation time.
Abstract: An efficient algorithm is proposed for finding all solutions of piecewise-linear (PWL) resistive circuits using the simplex method. By numerical examples, it is shown that the proposed algorithm could find all solutions of relatively large scale problems (including those where the number of PWL resistors is 500-2000 and the number of linear regions is 10/sup 500/-1000/sup 2000/) in practical computation time.
TL;DR: In this paper, the authors proposed a method to analyze circuits using Haar wavelet transform, which can easily treat such matrices, thus the calculation and its comprehension become easier at the expense of more number of bases.
Abstract: In this paper, we propose a method to analyze circuits using Haar wavelet transform. Recently, the method to analyze the circuit using Daubechies wavelets has been proposed. Then a Fourier-like approach as well as Laplace-like one for the solutions of transient problems by an algebraic system of equations is obtained and numerical time stepping is avoided. In that method, the matrices to express the integral and derivative are not easy to handle. In the proposed method, we can easily treat such matrices, thus the calculation and its comprehension become easier at the expense of more number of bases.