A New Algorithm for Computing a Root of Transcendental Equations Using Series Expansion (original) (raw)
Related papers
A New Trigonometrical Algorithm for Computing Real Root of Non-linear Transcendental Equations
International Journal of Applied and Computational Mathematics, 2019
This paper presents a new algorithm to find a non-zero real root of the transcendental equations using trigonometrical formula. Indeed, the new proposed algorithm is based on the combination of inverse of sine series and Newton Raphson method, which produces better approximate root than Newton Raphson method. The implementation of the proposed algorithm in MATLAB is also discussed. Certain numerical examples are presented to show the efficiency of the proposed algorithm. This algorithm will help to implement in the commercial package for finding a real root of a given transcendental equation.
On Solving Transcendental Equations using Various Root Finding Algorithms with Microsoft Excel
Notion Press; 1st edition (17 May 2022), 2022
In this book, we discuss various root finding algorithms, such as bisection method, regula-falsi method, Newton-Rapson method, Halley's method, Steffensen's method and a hybrid root finding algorithm, to find a root of the given transcendental equations. We also present a new hybrid root finding algorithm using exponential function and regula-falsi method. Certain numerical examples are presented to illustrate the algorithms using Microsoft excel. The proposed hybrid method is also discussed in Microsoft excel with sample computations.
New Algorithms for Computing a Root of Non-Linear Equations Using Exponential Series
Palestine Journal of Mathematics, 2021
In this paper, we present new algorithms/methods to find a non-zero real root of the transcendental equations using exponential series. The new proposed method is based on the exponential series, which produces better approximate root than some existing methods. MATLAB and Maple implementation of the proposed method is discussed. Certain numerical examples are presented to validate the efficiency of the proposed algorithm. The method will help to implement in the commercial package for finding a real root of a given transcendental equation.
International Conference on Computational Intelligence: Promoting Industrialization through Computational Intelligence, Simulation, Statistical and Mathematical Modelling, 2022
The objective of this paper is to propose a new hybrid root finding algorithm for solving transcendental equations. The proposed algorithm is based on the well-known root finding methods namely the regula-falsi method and exponential method (RF-EXP). We show using numerical examples that the proposed algorithm is convergent faster than other related methods. Several numerical examples are presented to illustrate the proposed algorithms, and comparison of this algorithm with other existing methods is presented to show the efficiency and accuracy. Implementation of the proposed algorithm is presented in MS Excel.
AN ITERATIVE METHOD FOR SOLVING NON-LINEAR TRANSCENDENTAL EQUATIONS
J. Math. Comput. Sci., 2020
In this paper, we introduced a new method to compute a non-zero real root of the transcendental equations. The proposed method results in better approximate root than the existing methods such as bisection method, regula-falsi method and secant method. The implementation of the proposed method in MATLAB is applied on different problems to demonstrate the applicability of the method. The proposed method is better in reducing error rapidly, hence converges faster as compared to the existing methods. This method will help to employ in the commercial package for finding a non-zero real root of a given nonlinear equations (transcendental, algebraic and exponential).
On New Root Finding Algorithms for Solving Nonlinear Transcendental Equations
In this paper, we present new iterative algorithms to find a root of the given nonlinear transcendental equations. In the proposed algorithms, we use nonlinear Taylor's polynomial interpolation and a modified error correction term with a fixed-point concept. We also investigated for possible extension of the higher order iterative algorithms in single variable to higher dimension. Several numerical examples are presented to illustrate the proposed algorithms.
A New Hybrid Root-Finding Algorithm to Solve Transcendental Equations Using Arcsine Function
Information Sciences Letters, 2023
The objective of this paper is to propose a new hybrid root finding algorithms for solving non-linear equations (NLEs) or transcendental equations (TEs). The proposed algorithm is based on the trigonometrical algorithm using arcsine function to find a root. Several numerical examples are presented to illustrate the proposed algorithms, and comparisons are presented with other existing methods to show efficiency and accuracy. Implementation of the proposed algorithms is presented in a mathematical software tool Maple.
Ural Mathematical Journal, 2023
The objective of this paper is to propose two new hybrid root finding algorithms for solving transcendental equations. The proposed algorithms are based on the well-known root finding methods namely the Halley's method, regula-falsi method and exponential method. We show using numerical examples that the proposed algorithms converge faster than other related methods. The first hybrid algorithm consists of regula-falsi method and exponential method (RF-EXP). In the second hybrid algorithm, we use regula-falsi method and Halley's method (RF-Halley). Several numerical examples are presented to illustrate the proposed algorithms, and comparison of these algorithms with other existing methods are presented to show the efficiency and accuracy. The implementation of the proposed algorithms is presented in Microsoft Excel (MS Excel) and the mathematical software tool Maple.
An Algorithm to Compute Real Root of Transcendental Equations Using Hyperbolic Tangent Function
International Journal of Open Problems in Computer Science and Mathematics, 2021
This paper presents a new algorithm to nd a non-zero real root of the transcendental equations using hyperbolic tangent function. Indeed, the new proposed algorithm is based on the combination of hyperbolic tangent series and Newton Raphson method, which produces better approximate root than Newton Raphson method. The implementation of the proposed algorithm is programmed in MATLAB and Maple. Certain numerical examples are presented to validate the efficiency of the proposed algorithm. This algorithm will help to implement in the commercial package for fi nding a real root of a given transcendental equation.
Quadratically convergent algorithm for computing real root of non‑linear transcendental equations
BMC Research Notes, 2018
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.