• DocumentCode
    2304820
  • Title

    Numerical Methods for Solving High Order Polynomial Equations

  • Author

    Ling Wang ; Wang, Ling ; Zhou, Guanchen ; Cui, Yuhuan

  • Author_Institution
    Coll. of Sci., Hebei United Univ., Tangshan, China
  • fYear
    2011
  • fDate
    25-27 April 2011
  • Firstpage
    150
  • Lastpage
    153
  • Abstract
    The problem of finding the roots of a polynomial equation is important because many calculations in engineering and scientific computation can be summarized to it. An adaptive algorithm based on Sturm´s theorem which could find the isolate intervals for all the real roots rapidly is used to locate all the roots. To find the numerical root, they will first be roughly approximated by dichotomy method. And then these roots are computed by Newton method using the initial values got in the first step. This method overcomes the shortcomings of dichotomy method and iterative method. The first step could find a good initial point quickly for Newton method, and Newton method converges faster than dichotomy method. Numerical example shows the effectiveness of this method.
  • Keywords
    Newton method; polynomials; Newton method; Sturm theorem; dichotomy method; high order polynomial equation; numerical root; Approximation algorithms; Educational institutions; Iterative methods; Mathematical model; Newton method; Polynomials; Dichotomy Method; Newton iteration method; Real root of polynomial; Sturm sequenc;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information and Computing (ICIC), 2011 Fourth International Conference on
  • Conference_Location
    Phuket Island
  • Print_ISBN
    978-1-61284-688-0
  • Type

    conf

  • DOI
    10.1109/ICIC.2011.83
  • Filename
    5954526