Quadratically convergent algorithm for computing real root of non-linear transcendental equations
Abstract 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...
Main Authors: | Srinivasarao Thota, Vivek Kumar Srivastav |
---|---|
Format: | Article |
Language: | English |
Published: |
BMC
2018-12-01
|
Series: | BMC Research Notes |
Subjects: | |
Online Access: | http://link.springer.com/article/10.1186/s13104-018-4008-z |
Similar Items
-
ON NEW HYBRID ROOT-FINDING ALGORITHMS FOR SOLVING TRANSCENDENTAL EQUATIONS USING EXPONENTIAL AND HALLEY'S METHODS
by: Srinivasarao Thota, et al.
Published: (2023-07-01) -
Blended Root Finding Algorithm Outperforms Bisection and Regula Falsi Algorithms
by: Chaman Lal Sabharwal
Published: (2019-11-01) -
A Story of Computational Science: Colonel Titus’ Problem from the 17th Century
by: Trond Steihaug
Published: (2022-06-01) -
AN ASSESSMENT OF THE DISPLACEMENT OF A CAM FOLLOWER USING REGULA FALSI METHOD
by: KOLAWOLE ADESOLA OLADEJO, et al.
Published: (2021-06-01) -
AN ASSESSMENT OF THE DISPLACEMENT OF A CAM FOLLOWER USING REGULA FALSI METHOD
by: KOLAWOLE ADESOLA OLADEJO, et al.
Published: (2021-06-01)