• DocumentCode
    2016605
  • Title

    A Constrained Learning Algorithm for Finding Multiple Real Roots of Polynomial

  • Author

    Zhang, Xinli ; Wan, Min ; Yi, Zhang

  • Author_Institution
    Sch. of Comput. Sci. & Eng., Univ. of Electron. Sci. & Technol. of China, Chengdu
  • Volume
    2
  • fYear
    2008
  • fDate
    17-18 Oct. 2008
  • Firstpage
    38
  • Lastpage
    41
  • Abstract
    A constrained learning algorithm is proposed for finding the multiple real roots by neural networks based on the complete discrimination system of polynomial. By coupling a constrained condition into the error function of the neural networks, the proposed algorithm is effectively to avoid the weights fluctuating in a large range. To speed up the convergence speed, a momentum term is added into the learning algorithm. Experiment results show that the presented constrained algorithm is of not only faster convergent speed, but also more effectiveness comparing to the unconstrained one.
  • Keywords
    convergence; learning (artificial intelligence); mathematics computing; neural nets; polynomials; constrained learning algorithm; convergence; error function; momentum; multiple real root; neural network; polynomial discrimination system; Algorithm design and analysis; Computational intelligence; Computer networks; Computer science; Design engineering; Equations; Information technology; Laboratories; Neural networks; Polynomials; complete discrimination system of polynomial; constrained learning algorithm; multiple real roots;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computational Intelligence and Design, 2008. ISCID '08. International Symposium on
  • Conference_Location
    Wuhan
  • Print_ISBN
    978-0-7695-3311-7
  • Type

    conf

  • DOI
    10.1109/ISCID.2008.77
  • Filename
    4725452