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...

Full beskrivning

Sparad:
Bibliografiska uppgifter
Huvudupphovsmän: Srinivasarao Thota, Vivek Kumar Srivastav
Materialtyp: Artigo
Språk:Inglês
Publicerad: BMC 2018-12-01
Serie:BMC Research Notes
Ämnen:
Root of transcendental equations
Regula-Falsi method
Newton–Raphson method
Quadratic convergence
Länkar:http://link.springer.com/article/10.1186/s13104-018-4008-z
Taggar: Lägg till en tagg
Inga taggar, Lägg till första taggen!

Liknande verk