This paper focus on a new blended root-finding algorithm to solve the given transcendental equations. This algorithm is based on the classical methods, namely Newton-Raphson method and trisection method. One of the advantages of the proposed algorithm is not only fast converging but also guarantee the root. The proposed algorithm is easy to understand and one can implement this algorithm in any mathematical software tools. Several numerical examples are presented to illustrate the algorithm and comparisons are made to show the efficiency of the proposed algorithm.
2010 AMS classifications: 65N30