By Topic

Reality of chaos in the double scroll circuit: A computer-assisted proof

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Matsumoto, T. ; Dept. of Electr. Eng., Waseda Univ., Tokyo, Japan ; Chua, L.O. ; Ayaki, K.

The authors prove three key inequalities stated in the paper by L.O. Chua, M. Komouro, and T. Matsumoto (see ibid., vol. CAS-33, p. 1072-1118, 1986) by giving verifiable error bounds to the quantities involved in the inequalities with an assistance of a computer. This provides another rigorous proof that the so-called double scroll circuit is chaotic in the sense of Shilnikov. Since a computer is used, everything must be transparent; there should be no black box. To provide a rigorous computer-base free from roundoff errors, it is shown that all the computations are reduced to four logic operations: AND, OR, NOT, and XOR. Based on this, the computer performs internal analysis, which is a method of computing intervals containing the true values. This is important for two reasons: first, the double scroll circuit then becomes, the first real, physical system in which chaos is (i) observed in the laboratory, (ii) confirmed by computer simulation, and (iii) proven mathematically. Second, the author's approach can easily be modified to apply to other problems, providing a powerful tool for a large class of problems

Published in:

Circuits and Systems, IEEE Transactions on  (Volume:35 ,  Issue: 7 )