An Efficient Two-Step Iterative Family Adaptive with Memory for Solving Nonlinear Equations and Their Applications
We propose a new iterative scheme without memory for solving nonlinear equations. The proposed scheme is based on a cubically convergent Hansen–Patrick-type method. The beauty of our techniques is that they work even though the derivative is very small in the vicinity of the required root or <inl...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2022-11-01
|
| Series: | Mathematical and Computational Applications |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2297-8747/27/6/97 |
| Summary: | We propose a new iterative scheme without memory for solving nonlinear equations. The proposed scheme is based on a cubically convergent Hansen–Patrick-type method. The beauty of our techniques is that they work even though the derivative is very small in the vicinity of the required root or <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msup><mi>f</mi><mo>′</mo></msup><mrow><mo>(</mo><mi>x</mi><mo>)</mo></mrow><mo>=</mo><mn>0</mn></mrow></semantics></math></inline-formula>. On the contrary, the previous modifications either diverge or fail to work. In addition, we also extended the same idea for an iterative method with memory. Numerical examples and comparisons with some of the existing methods are included to confirm the theoretical results. Furthermore, basins of attraction are included to describe a clear picture of the convergence of the proposed method as well as that of some of the existing methods. Numerical experiments are performed on engineering problems, such as fractional conversion in a chemical reactor, Planck’s radiation law problem, Van der Waal’s problem, trajectory of an electron in between two parallel plates. The numerical results reveal that the proposed schemes are of utmost importance to be applied on various real–life problems. Basins of attraction also support this aspect. |
|---|---|
| ISSN: | 1300-686X 2297-8747 |