Convergence Stability of Through-Flow Analyses via the Implementation of the Secant and Bisection Iteration Schemes

Author(s):  
Vassilios Pachidis ◽  
Ioannis Templalexis ◽  
Pericles Pilidis

One of the most frequently encountered problems in engineering is dealing with non-linear equations. For example, the solution of the full Radial Equilibrium Equation (REE) in Streamline Curvature (SLC) through-flow methods is a typical case of a scientific analysis associated with a complex mathematical problem that can not be handled analytically. Various schemes are used routinely in scientific studies for the numerical solution of mathematical problems. In simple cases, these methods can be applied in their original form with success. The Newton-Raphson for example is one such scheme, commonly employed in simple engineering problems that require an iterative solution. Frequently however, the analysis of more complex phenomena may fall beyond the range of applicability of ‘textbook’ numerical methods, and may demand the design of more dedicated algorithms for the mathematical solution of a specific problem. These algorithms can be empirical in nature, developed from scratch, or the combination of previously established techniques. In terms of robustness and efficiency, all these different schemes would have their own merits and shortcomings. The success or failure of the numerical scheme applied depends also on the limitations imposed by the physical characteristics of the computational platform used, as well as by the nature of the problem itself. The effects of these constraints need to be assessed and taken into account, so that they can be anticipated and controlled. This manuscript discusses the development, validation and deployment of a convergence algorithm for the fast, accurate and robust numerical solution of the non-linear equations of motion for two-dimensional flow fields. The algorithm is based on a hybrid scheme, combining the Secant and Bisection iteration methods. Although it was specifically developed to address the computational challenges presented by SLC-type of analyses, it can also be used in other engineering problems. The algorithm was developed to provide a mid-of-the-range option between the very efficient but notoriously unstable Newton-Raphson scheme and other more robust, but less efficient schemes, usually employing some sort of Dynamic Convergence Control (DCC). It was also developed to eliminate the large user intervention, usually required by standard numerical methods. This new numerical scheme was integrated into a compressor SLC software and was tested rigorously, particularly at compressor operating regimes traditionally exhibiting convergence difficulties (i.e. part-speed performance). The analysis showed that the algorithm could successfully reach a converged solution, equally robustly but much more efficiently compared to a hybrid Newton-Raphson scheme employing DCC. The performance of these two schemes, in terms of speed of execution, is presented here. Typical error histories and comparisons of simulated results against experimental are also presented in this manuscript for a particular case-study.

2017 ◽  
Vol 1 (1) ◽  
pp. 95
Author(s):  
Siti Nurhabibah Hutagalung

Abstract - The study of the characteristics of non-liier functions can be carried out experimentally and theoretically. One part of theoretical analysis is computation. For computational purposes, numerical methods can be used to solve equations complicated, for example non-linear equations. There are a number of numerical methods that can be used to solve nonlinear equations, the Newton-Raphson method. Keywords - Numerical, Newton Raphson.


2021 ◽  
Vol 23 (07) ◽  
pp. 858-866
Author(s):  
Gauri Thakur ◽  
◽  
J.K. Saini ◽  

In numerical analysis, methods for finding roots play a pivotal role in the field of many real and practical applications. The efficiency of numerical methods depends upon the convergence rate (how fast the particular method converges). The objective of this study is to compare the Bisection method, Newton-Raphson method, and False Position Method with their limitations and also analyze them to know which of them is more preferred. Limitations of these methods have allowed presenting the latest research in the area of iterative processes for solving non-linear equations. This paper analyzes the field of iterative methods which are developed in recent years with their future scope.


Eng ◽  
2021 ◽  
Vol 2 (1) ◽  
pp. 80-98
Author(s):  
Chaman Lal Sabharwal

Finding the roots of non-linear and transcendental equations is an important problem in engineering sciences. In general, such problems do not have an analytic solution; the researchers resort to numerical techniques for exploring. We design and implement a three-way hybrid algorithm that is a blend of the Newton–Raphson algorithm and a two-way blended algorithm (blend of two methods, Bisection and False Position). The hybrid algorithm is a new single pass iterative approach. The method takes advantage of the best in three algorithms in each iteration to estimate an approximate value closer to the root. We show that the new algorithm outperforms the Bisection, Regula Falsi, Newton–Raphson, quadrature based, undetermined coefficients based, and decomposition-based algorithms. The new hybrid root finding algorithm is guaranteed to converge. The experimental results and empirical evidence show that the complexity of the hybrid algorithm is far less than that of other algorithms. Several functions cited in the literature are used as benchmarks to compare and confirm the simplicity, efficiency, and performance of the proposed method.


Author(s):  
Umair Khalid Qureshi

This article is presented a modified quadrature iterated methods of Boole rule and Weddle rule for solving non-linear equations which arise in applied sciences and engineering. The proposed methods are converged quadratically and the idea of developed research comes from Boole rule and Weddle rule. Few examples are demonstrated to justify the proposed method as the assessment of the newton raphson method, steffensen method, trapezoidal method, and quadrature method. Numerical results and graphical representations of modified quadrature iterated methods are examined with C++ and EXCEL. The observation from numerical results that the proposed modified quadrature iterated methods are performance good and well executed as the comparison of existing methods for solving non-linear equations.


2019 ◽  
Vol 21 (1) ◽  
pp. 21-31
Author(s):  
Patrisius Batarius ◽  
Alfri Aristo SinLae

Determining the root of an equation means making the equation equal zero, (f (f) = 0). In engineering, there are often complex mathematical equations. With the numerical method approach, the equation can be searching for the value of the equation root. However, to find a double root approach with several numerical methods such as the bisection method, regulatory method, Newton-Raphson method, and Secant method, it is not efficient in determining multiple roots. This study aims to determine the roots of non-linear equations that have multiple roots using the modified Secant method. Besides knowing the effect of determining the initial value for the Secant method that is modifying in determining the non-linear root of persistence that has multiple roots. Comparisons were also make to other numerical methods in determining twin roots with the modified Secant method. A comparison is done to determine the initial value used. Simulations are performing on equations that have one single root and two or more double roots.


Sign in / Sign up

Export Citation Format

Share Document