Performance evaluation of Hopfield network for simple examples

Kiichi Urahama

Research output: Contribution to journalArticle

Abstract

The performance guarantees of the Hopfield network are given for two simple graph problems. A lower bound of cutsize is evaluated for the maximum cut problem through the analysis of eigenvalues at equilibrium states. The condition of constraint satisfaction and an upper bound of the cutsize are given for the graph bipartitioning problem. In addition, an effective numerical scheme is proposed to integrate the differential equations of the Hopfield network by using the backward Euler formula with one-step Gauss-Seidel relaxation. Theoretical estimates of the performance of the algorithm are verified experimentally.

Original languageEnglish
Pages (from-to)1412-1415
Number of pages4
JournalUnknown Journal
Volume3
Publication statusPublished - 1991
Externally publishedYes

Fingerprint

eigenvalue
Differential equations
analysis
evaluation

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering
  • Electronic, Optical and Magnetic Materials

Cite this

Performance evaluation of Hopfield network for simple examples. / Urahama, Kiichi.

In: Unknown Journal, Vol. 3, 1991, p. 1412-1415.

Research output: Contribution to journalArticle

Urahama, Kiichi. / Performance evaluation of Hopfield network for simple examples. In: Unknown Journal. 1991 ; Vol. 3. pp. 1412-1415.
@article{2c77a76e4bc94ea78c272a70af9f4eb8,
title = "Performance evaluation of Hopfield network for simple examples",
abstract = "The performance guarantees of the Hopfield network are given for two simple graph problems. A lower bound of cutsize is evaluated for the maximum cut problem through the analysis of eigenvalues at equilibrium states. The condition of constraint satisfaction and an upper bound of the cutsize are given for the graph bipartitioning problem. In addition, an effective numerical scheme is proposed to integrate the differential equations of the Hopfield network by using the backward Euler formula with one-step Gauss-Seidel relaxation. Theoretical estimates of the performance of the algorithm are verified experimentally.",
author = "Kiichi Urahama",
year = "1991",
language = "English",
volume = "3",
pages = "1412--1415",
journal = "Quaternary International",
issn = "1040-6182",
publisher = "Elsevier Limited",

}

TY - JOUR

T1 - Performance evaluation of Hopfield network for simple examples

AU - Urahama, Kiichi

PY - 1991

Y1 - 1991

N2 - The performance guarantees of the Hopfield network are given for two simple graph problems. A lower bound of cutsize is evaluated for the maximum cut problem through the analysis of eigenvalues at equilibrium states. The condition of constraint satisfaction and an upper bound of the cutsize are given for the graph bipartitioning problem. In addition, an effective numerical scheme is proposed to integrate the differential equations of the Hopfield network by using the backward Euler formula with one-step Gauss-Seidel relaxation. Theoretical estimates of the performance of the algorithm are verified experimentally.

AB - The performance guarantees of the Hopfield network are given for two simple graph problems. A lower bound of cutsize is evaluated for the maximum cut problem through the analysis of eigenvalues at equilibrium states. The condition of constraint satisfaction and an upper bound of the cutsize are given for the graph bipartitioning problem. In addition, an effective numerical scheme is proposed to integrate the differential equations of the Hopfield network by using the backward Euler formula with one-step Gauss-Seidel relaxation. Theoretical estimates of the performance of the algorithm are verified experimentally.

UR - http://www.scopus.com/inward/record.url?scp=0026404664&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0026404664&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0026404664

VL - 3

SP - 1412

EP - 1415

JO - Quaternary International

JF - Quaternary International

SN - 1040-6182

ER -