Newton's Cube Root Finding Data Sequence
Autor: | Jirarat Ieamsaard, Suchart Yammen |
---|---|
Rok vydání: | 2021 |
Předmět: |
TheoryofComputation_MISCELLANEOUS
Root (linguistics) Sequence Iterative method 05 social sciences 050301 education Approximation algorithm 0102 computer and information sciences 01 natural sciences Decimal symbols.namesake 010201 computation theory & mathematics ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION symbols 0503 education Newton's method Algorithm Root-finding algorithm Mathematics Cube root |
Zdroj: | 2021 9th International Electrical Engineering Congress (iEECON). |
DOI: | 10.1109/ieecon51072.2021.9440352 |
Popis: | One of the main objectives of this paper is to study, analyze and develop Newton’s root finding algorithm. The proposed method provides an iterative procedure which systematically creating a sequence of approximations of a root which that converge to a root. The experimental result with a positive number-based cube root algorithm shows that the developed algorithm has converged to with three decimal points of the desired cube root in only four iterations. |
Databáze: | OpenAIRE |
Externí odkaz: |