Talk:Aizerman's conjecture
Latest comment: 12 years ago by Kuznetsov N.V. in topic Conjecture History
 | This article is rated Stub-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | |||||||||||||
| ||||||||||||||
Conjecture History edit
I think it would be good to add a historical overview of this cojecture (see, e.g., Counterexamples to Aizerman's and Kalman's conjectures and DF method [1] (V.O. Bragin, V.I. Vagaitsev, N.V. Kuznetsov, G.A. Leonov, Algorithms for Finding Hidden Oscillations in Nonlinear Systems. The Aizerman and Kalman Conjectures and Chua's Circuits, Journal of Computer and Systems Sciences International, 2011, Vol. 50, No. 4, pp. 511-543) [2] ) Also it should be noted that the conjecture is true for n=1 (dimension of the system), and for n=2 there is necessary and sufficient conditions of absolute stability (while Popov and Circle criteria give only sufficient conditions) nk (talk) 10:08, 30 September 2011 (UTC)
References edit
- ^ "Aizerman's and Kalman's conjectures and DF method" (PDF).
- ^ Bragin V.O., Vagaitsev V.I., Kuznetsov N.V., Leonov G.A. (2011). "Algorithms for Finding Hidden Oscillations in Nonlinear Systems. The Aizerman and Kalman Conjectures and Chua's Circuits". Journal of Computer and Systems Sciences International. 50 (4): 511–543. doi:10.1134/S106423071104006X.
{{cite journal}}: CS1 maint: multiple names: authors list (link)