메뉴 건너뛰기




Volumn 42, Issue 8, 1995, Pages 497-499

Comments on “Necessary and Sufficient Condition for Absolute Stability of Neural Networks”

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC STABILITY; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DIFFERENTIAL EQUATIONS; EIGENVALUES AND EIGENFUNCTIONS; LYAPUNOV METHODS; MATRIX ALGEBRA; POLYNOMIALS; SYSTEM STABILITY;

EID: 0029359622     PISSN: 10577122     EISSN: None     Source Type: Journal    
DOI: 10.1109/81.404065     Document Type: Note
Times cited : (63)

References (8)
  • 1
    • 38249012613 scopus 로고
    • Recent directions in matrix stability
    • D. Hershkowitz, “Recent directions in matrix stability,” Linear Algebra and its Applicat., vol. 171, pp. 161–186, 1992.
    • (1992) Linear Algebra and its Applicat. , vol.171 , pp. 161-186
    • Hershkowitz, D.1
  • 3
    • 0028377673 scopus 로고
    • On a class of globally stable neural circuits
    • Feb.
    • E. Kaszkurewicz and A. Bhaya, “On a class of globally stable neural circuits,” IEEE Trans. Circuits Syst. I, vol. 41, pp. 171–174, Feb. 1994.
    • (1994) IEEE Trans. Circuits Syst. I , vol.41 , pp. 171-174
    • Kaszkurewicz, E.1    Bhaya, A.2
  • 4
    • 43949155364 scopus 로고
    • On global asymptotic stability of a class of nonlinear systems arising in neural network theory
    • Oct.
    • M. Forti, “On global asymptotic stability of a class of nonlinear systems arising in neural network theory,” J. Differential Equations, vol. 113, pp. 246–264, Oct. 1994.
    • (1994) J. Differential Equations , vol.113 , pp. 246-264
    • Forti, M.1
  • 5
    • 0001670416 scopus 로고
    • Problem of absolute stability
    • Dec.
    • S. Persidskii, “Problem of absolute stability,” Automation and Remote Contr., vol. 30, no. 12, pp. 1889–1895, Dec. 1969.
    • (1969) Automation and Remote Contr. , vol.30 , Issue.12 , pp. 1889-1895
    • Persidskii, S.1
  • 7
    • 34249773746 scopus 로고
    • The P-matrix problem is co-NP-complete
    • Apr.
    • G. E. Coxson, “The P-matrix problem is co-NP-complete,” Mathematical Programming, vol. 64, no. 2, ser. A, pp. 173–178, Apr. 1994.
    • (1994) Mathematical Programming , vol.64 , Issue.2 , pp. 173-178
    • Coxson, G.E.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.