• DocumentCode
    299297
  • Title

    Orthogonalized steepest descent method for solving nonlinear equations

  • Author

    Ninomiya, Hiroshi ; Asai, Hideki

  • Author_Institution
    Dept. of Comput. Sci., Shizuoka Univ., Hamamatsu, Japan
  • Volume
    1
  • fYear
    1995
  • fDate
    30 Apr-3 May 1995
  • Firstpage
    740
  • Abstract
    This paper describes a novel algorithm based on Steepest Descent Method (SDM) for solving a system of nonlinear algebraic equations. First, we compare SDM with Newton-Raphson Method (NRM) and propose a novel technique which is derived from the equivalent property between them. The proposed method is an efficient algorithm which not only can overcome drawbacks of NRM but also can exploit the convergence speed of NRM. We refer to this technique as orthogonalized Steepest Descent Method. We demonstrate the validity of the proposed technique for several nonlinear equations and Hopfield neural network analysis
  • Keywords
    Hopfield neural nets; Jacobian matrices; convergence of numerical methods; nonlinear equations; Hopfield neural network analysis; convergence speed; nonlinear algebraic equations; orthogonalized steepest descent method; Computational modeling; Computer simulation; Convergence; Jacobian matrices; Matrix decomposition; Nonlinear equations;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Circuits and Systems, 1995. ISCAS '95., 1995 IEEE International Symposium on
  • Conference_Location
    Seattle, WA
  • Print_ISBN
    0-7803-2570-2
  • Type

    conf

  • DOI
    10.1109/ISCAS.1995.521623
  • Filename
    521623