Зображення обкладинки

Quadratically convergent algorithm for computing real root of non-linear transcendental equations

Збережено в:
Опубліковано в::BMC Research Notes vol. 11 (2018), p. 1
Автор: Thota, Srinivasarao
Інші автори: Srivastav, Vivek Kumar
Опубліковано:
Springer Nature B.V.
Предмети:
Numerical analysis
Applied mathematics
Methods
Algorithms
Iterative methods
Convergence
Nonlinear equations
Engineers
Онлайн доступ:Citation/Abstract
Full Text
Full Text - PDF
Теги: Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
Короткий огляд:Objectives The present paper describes a new algorithm to find a root of non-linear transcendental equations. It is found that Regula-Falsi method always gives guaranteed result but slow convergence. However, Newton–Raphson method does not give guaranteed result but faster than Regula-Falsi method. Therefore, the present paper used these two ideas and developed a new algorithm which has better convergence than Regula-Falsi and guaranteed result. One of the major issue in Newton–Raphson method is, it fails when first derivative is zero or approximately zero. Results The proposed method implemented the failure condition of Newton–Raphson method with better convergence. Error calculation has been discussed for certain real life examples using Bisection, Regula-Falsi, Newton–Raphson method and new proposed method. The computed results show that the new proposed quadratically convergent method provides better convergence than other methods.
ISSN:1756-0500
DOI:10.1186/s13104-018-4008-z
Джерело:Health & Medical Collection