• DocumentCode
    3027626
  • Title

    Complexity analysis of dichotomy method in solving the approximated solution of equations

  • Author

    Zhang, Xiaoqin ; Fang, Junbin ; Lin, Changsheng ; Ying, Yulin

  • Author_Institution
    Coll. of. Math. & Inf. Sci., Wenzhou Univ., Wenzhou, China
  • Volume
    1
  • fYear
    2011
  • fDate
    9-11 Dec. 2011
  • Firstpage
    257
  • Lastpage
    259
  • Abstract
    The dichotomy method is a classic way of solving the approximated solution of equations. In the actual teaching process, due to the lack of knowledge about the dichotomy method´s complexity, teachers can not answer the question about the advantages of dichotomy method raised by students-“why we choose the dichotomy method for solving equations, but not k-dichotomy method, what are the advantages of dichotomy method?”. This paper analyzes the complexity of the dichotomy method from a tree structure perspective. A general conclusion is obtained which can be used as an assisted teaching content in the teaching process of the dichotomy method.
  • Keywords
    teaching; approximated solution of equations; complexity analysis; dichotomy method; teaching process; Binary trees; Complexity theory; Education; Equations; Search methods; Vegetation;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    IT in Medicine and Education (ITME), 2011 International Symposium on
  • Conference_Location
    Cuangzhou
  • Print_ISBN
    978-1-61284-701-6
  • Type

    conf

  • DOI
    10.1109/ITiME.2011.6130828
  • Filename
    6130828