• DocumentCode
    390700
  • Title

    A recursive root moment method for finding roots of polynomials based on neural constrained learning method

  • Author

    Huang, De-Shuang

  • Author_Institution
    Hefei Inst. of Intelligent Machines, Acad. Sinica, Anhui, China
  • Volume
    1
  • fYear
    2002
  • fDate
    28-31 Oct. 2002
  • Firstpage
    703
  • Abstract
    This paper proposes using the recursive root moment method (RRMM) based on feedforward neural networks (FNN) trained by a constrained learning algorithm (CLA) to find the roots of polynomials, which is of lower computational complexity than the root moment method (RMM) and the method using the relations between the roots and the coefficients (RRC) of polynomials. As a result, the RRMM has faster training speed and higher accuracy than the latter two methods. The experimental results verify our claims.
  • Keywords
    computational complexity; feedforward neural nets; learning (artificial intelligence); polynomials; recursive estimation; signal processing; computational complexity; feedforward neural networks; neural constrained learning algorithm; polynomial root finding; recursive root moment method; training speed; Computational complexity; Computational intelligence; Filters; Intelligent networks; Learning systems; Machine learning; Moment methods; Neural networks; Polynomials; Signal processing algorithms;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    TENCON '02. Proceedings. 2002 IEEE Region 10 Conference on Computers, Communications, Control and Power Engineering
  • Print_ISBN
    0-7803-7490-8
  • Type

    conf

  • DOI
    10.1109/TENCON.2002.1181371
  • Filename
    1181371