scholarly journals Novel higher order iterative schemes based on the $ q- $Calculus for solving nonlinear equations

2021 ◽  
Vol 7 (3) ◽  
pp. 3524-3553
Author(s):  
Gul Sana ◽  
◽  
Muhmmad Aslam Noor ◽  
Dumitru Baleanu ◽  
◽  
...  
Keyword(s):  
Iterative Methods ◽  
Nonlinear Equations ◽  
Approximate Solutions ◽  
Auxiliary Function ◽  
Quantum Calculus ◽  
New Methods ◽  
Classical Calculus ◽  
Mathematical Sciences ◽  
Modern Era ◽  
Taylor’S Series

<abstract><p>The conventional infinitesimal calculus that concentrates on the idea of navigating the $ q- $symmetrical outcomes free from the limits is known as Quantum calculus (or $ q- $calculus). It focuses on the logical rationalization of differentiation and integration operations. Quantum calculus arouses interest in the modern era due to its broad range of applications in diversified disciplines of the mathematical sciences. In this paper, we instigate the analysis of Quantum calculus on the iterative methods for solving one-variable nonlinear equations. We introduce the new iterative methods called $ q- $iterative methods by employing the $ q- $analogue of Taylor's series together with the inclusion of an auxiliary function. We also investigate the convergence order of our newly suggested methods. Multiple numerical examples are utilized to demonstrate the performance of new methods with an acceptable accuracy. In addition, approximate solutions obtained are comparable to the analogous solutions in the classical calculus when the quantum parameter $ q $ tends to one. Furthermore, a potential correlation is established by uniting the $ q- $iterative methods and traditional iterative methods.</p></abstract>

scholarly journals On Iterative Methods for Solving Nonlinear Equations in Quantum Calculus

2021 ◽  
Vol 5 (3) ◽  
pp. 60
Author(s):  
Gul Sana ◽  
Pshtiwan Othman Mohammed ◽  
Dong Yun Shin ◽  
Muhmmad Aslam Noor ◽  
Mohammad Salem Oudat
Keyword(s):  
Iterative Methods ◽  
Nonlinear Equations ◽  
Coupled System ◽  
Numerical Examples ◽  
Quantum Calculus ◽  
Acceptable Accuracy ◽  
System Technique ◽  
Taylor’S Series

Quantum calculus (also known as the q-calculus) is a technique that is similar to traditional calculus, but focuses on the concept of deriving q-analogous results without the use of the limits. In this paper, we suggest and analyze some new q-iterative methods by using the q-analogue of the Taylor’s series and the coupled system technique. In the domain of q-calculus, we determine the convergence of our proposed q-algorithms. Numerical examples demonstrate that the new q-iterative methods can generate solutions to the nonlinear equations with acceptable accuracy. These newly established methods also exhibit predictability. Furthermore, an analogy is settled between the well known classical methods and our proposed q-Iterative methods.

scholarly journals Iteration Methods with an Auxiliary Function for Nonlinear Equations

2020 ◽  
Vol 2020 ◽  
pp. 1-15
Author(s):  
Faisal Ali ◽  
Waqas Aslam ◽  
Imran Khalid ◽  
Akbar Nadeem
Keyword(s):  
Nonlinear Equation ◽  
Iterative Methods ◽  
Nonlinear Equations ◽  
Auxiliary Function ◽  
New Family ◽  
Special Cases ◽  
Engineering Models ◽  
Iteration Methods ◽  
Scientific Engineering ◽  
Taylor’S Series

Various iterative methods have been introduced by involving Taylor’s series on the auxiliary function g x to solve the nonlinear equation f x = 0 . In this paper, we introduce the expansion of g x with the inclusion of weights w i such that ∑ i = 1 p w i = 1 and knots τ i ∈ 0,1 in order to develop a new family of iterative methods. The methods proposed in the present paper are applicable for different choices of auxiliary function g x , and some already known methods can be viewed as the special cases of these methods. We consider the diverse scientific/engineering models to demonstrate the efficiency of the proposed methods.

scholarly journals Some New Iterative Methods for Nonlinear Equations

2010 ◽  
Vol 2010 ◽  
pp. 1-12 ◽  
Author(s):  
Muhammad Aslam Noor ◽  
Khalida Inayat Noor ◽  
Eisa Al-Said ◽  
Muhammad Waseem
Keyword(s):  
Iterative Methods ◽  
Nonlinear Equations ◽  
Fourth Order ◽  
System Of Equations ◽  
Decomposition Technique ◽  
Methods Comparison ◽  
Numerical Examples ◽  
New Methods ◽  
And Performance

We suggest and analyze some new iterative methods for solving the nonlinear equationsf(x)=0using the decomposition technique coupled with the system of equations. We prove that new methods have convergence of fourth order. Several numerical examples are given to illustrate the efficiency and performance of the new methods. Comparison with other similar methods is given.

scholarly journals A Family of Fourteenth-Order Convergent Iterative Methods for Solving Nonlinear Equations

2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Fiza Zafar ◽  
Gulshan Bibi
Keyword(s):  
Iterative Method ◽  
Iterative Methods ◽  
Nonlinear Equations ◽  
Order Of Convergence ◽  
Efficiency Index ◽  
Numerical Examples ◽  
New Class ◽  
First Derivative ◽  
New Methods ◽  
Specific Step

We present a family of fourteenth-order convergent iterative methods for solving nonlinear equations involving a specific step which when combined with any two-step iterative method raises the convergence order by n+10, if n is the order of convergence of the two-step iterative method. This new class include four evaluations of function and one evaluation of the first derivative per iteration. Therefore, the efficiency index of this family is 141/5 =1.695218203. Several numerical examples are given to show that the new methods of this family are comparable with the existing methods.

SOME NEWTON-TYPE ITERATIVE METHODS WITH AND WITHOUT MEMORY FOR SOLVING NONLINEAR EQUATIONS

2014 ◽  
Vol 11 (05) ◽  
pp. 1350078 ◽  
Author(s):  
XIAOFENG WANG ◽  
TIE ZHANG
Keyword(s):  
Iterative Methods ◽  
Nonlinear Equations ◽  
Order Of Convergence ◽  
Type Method ◽  
New Methods ◽  
Hermite Interpolating Polynomial ◽  
With Memory ◽  
Theoretical Results ◽  
Very High ◽  
High Computational Efficiency

In this paper, we present some three-point Newton-type iterative methods without memory for solving nonlinear equations by using undetermined coefficients method. The order of convergence of the new methods without memory is eight requiring the evaluations of three functions and one first-order derivative in per full iteration. Hence, the new methods are optimal according to Kung and Traubs conjecture. Based on the presented methods without memory, we present two families of Newton-type iterative methods with memory. Further accelerations of convergence speed are obtained by using a self-accelerating parameter. This self-accelerating parameter is calculated by the Hermite interpolating polynomial and is applied to improve the order of convergence of the Newton-type method. The corresponding R-order of convergence is increased from 8 to 9, [Formula: see text] and 10. The increase of convergence order is attained without any additional calculations so that the two families of the methods with memory possess a very high computational efficiency. Numerical examples are demonstrated to confirm theoretical results.

scholarly journals Optimal High-Order Methods for Solving Nonlinear Equations

2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
S. Artidiello ◽  
A. Cordero ◽  
Juan R. Torregrosa ◽  
M. P. Vassileva
Keyword(s):  
Weight Function ◽  
Iterative Methods ◽  
Nonlinear Equations ◽  
Order Of Convergence ◽  
High Order ◽  
Function Technique ◽  
Numerical Tests ◽  
New Methods ◽  
Theoretical Results ◽  
Made In

A class of optimal iterative methods for solving nonlinear equations is extended up to sixteenth-order of convergence. We design them by using the weight function technique, with functions of three variables. Some numerical tests are made in order to confirm the theoretical results and to compare the new methods with other known ones.

scholarly journals Modified Homotopy Perturbation Technique for the Approximate Solution of Nonlinear Equations

2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
Farooq Ahmed Shah
Keyword(s):  
Approximate Solution ◽  
Iterative Methods ◽  
Nonlinear Equations ◽  
Homotopy Perturbation Method ◽  
Perturbation Technique ◽  
Numerical Examples ◽  
Homotopy Perturbation ◽  
New Methods ◽  
And Performance ◽  
Homotopy Perturbation Technique

We use a new modified homotopy perturbation method to suggest and analyze some new iterative methods for solving nonlinear equations. This new modification of the homotopy method is quite flexible. Various numerical examples are given to illustrate the efficiency and performance of the new methods. These new iterative methods may be viewed as an addition and generalization of the existing methods for solving nonlinear equations.

Experiments with iterative methods for linear systems using GeoGebra and TI-Nspire

1970 ◽  
Vol 11 ◽  
pp. 89-102
Author(s):  
Gregor Milicic ◽  
Simon Plangg
Keyword(s):  
Linear Systems ◽  
Iterative Methods ◽  
Stem Education ◽  
Approximate Solutions ◽  
New Methods ◽  
Dynamical Aspect ◽  
Key Topics ◽  
Algorithmic Thinking ◽  
Unsolvable Problems

Algorithms and algorithmic thinking are key topics in STEM Education. By using algorithms approximate solutions can be obtained for analytical unsolvable problems. Before new methods can be safely applied they have to be thoroughly tested in experiments. In this article we present a series of exercise where students can experiment with algorithms and test them using GeoGebra or the TI-Nspire. Based on the results of such experiments the students can compare algorithms, showing them a heuristic and dynamical aspect of Mathematics.

scholarly journals Introduction to Higher-Order Iterative Methods for Finding Multiple Roots of Nonlinear Equations

2013 ◽  
Vol 2013 ◽  
pp. 1-3 ◽  
Author(s):  
Rajinder Thukral
Keyword(s):  
Iterative Methods ◽  
Nonlinear Equations ◽  
Higher Order ◽  
Multiple Roots ◽  
Multiple Zeros ◽  
New Methods

We introduce two higher-order iterative methods for finding multiple zeros of nonlinear equations. Per iteration the new methods require three evaluations of function and one of its first derivatives. It is proved that the two methods have a convergence of order five or six.

scholarly journals Higher-Order Derivative-Free Iterative Methods for Solving Nonlinear Equations and Their Basins of Attraction

Mathematics ◽  
2019 ◽  
Vol 7 (11) ◽  
pp. 1052 ◽  
Author(s):  
Jian Li ◽  
Xiaomeng Wang ◽  
Kalyanasundaram Madhu
Keyword(s):  
Iterative Methods ◽  
Nonlinear Equations ◽  
Complex Plane ◽  
Dynamical Behavior ◽  
Efficiency Index ◽  
Basins Of Attraction ◽  
Type Method ◽  
New Methods ◽  
Derivative Free ◽  
Higher Order Derivative

Based on the Steffensen-type method, we develop fourth-, eighth-, and sixteenth-order algorithms for solving one-variable equations. The new methods are fourth-, eighth-, and sixteenth-order converging and require at each iteration three, four, and five function evaluations, respectively. Therefore, all these algorithms are optimal in the sense of Kung–Traub conjecture; the new schemes have an efficiency index of 1.587, 1.682, and 1.741, respectively. We have given convergence analyses of the proposed methods and also given comparisons with already established known schemes having the same convergence order, demonstrating the efficiency of the present techniques numerically. We also studied basins of attraction to demonstrate their dynamical behavior in the complex plane.

Sign in / Sign up

Export Citation Format

Share Document