Conference Paper

Quadratically Convergent Algorithm for Computing Real Root of Non-Linear Transcendental Functions

Authors:
  • http://www.united.ac.in/Our-Institutions/United-Institute-of-Technology-Allahabad
  • SR University
To read the full-text of this research, you can request a copy directly from the authors.

Abstract

The present paper describes a new algorithm to find a root of non-linear transcendental equations. It is found that the Regula-Falsi method always gives guaranteed results but slow convergence. However, the 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.

No full-text available

Request Full-text Paper PDF

To read the full-text of this research,
you can request a copy directly from the authors.

ResearchGate has not been able to resolve any citations for this publication.
ResearchGate has not been able to resolve any references for this publication.