Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
From Halley to Secant: Redefining root finding with memory‐based methods including convergence and stability
Root‐finding methods solve equations and identify unknowns in physics, engineering, and
computer science. Memory‐based root‐seeking algorithms may look back to expedite …
computer science. Memory‐based root‐seeking algorithms may look back to expedite …
[HTML][HTML] Efficient families of multi-point iterative methods and their self-acceleration with memory for solving nonlinear equations
In this paper, we have constructed new families of derivative-free three-and four-parametric
methods with and without memory for finding the roots of nonlinear equations. Error analysis …
methods with and without memory for finding the roots of nonlinear equations. Error analysis …
A modified Chebyshev–Halley‐type iterative family with memory for solving nonlinear equations and its stability analysis
In this paper, we propose a new iterative scheme with memory for solving nonlinear
equations numerically in order to achieve higher order of convergence in comparison to the …
equations numerically in order to achieve higher order of convergence in comparison to the …
[HTML][HTML] 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 …
proposed scheme is based on a cubically convergent Hansen–Patrick-type method. The …
On the construction of some tri-parametric iterative methods with memory
In this work, two-step methods with memory by applying three self-accelerator parameters
are proposed and analyzed. In fact, we hit the high bound 7.7720 0 1 3≈ 1.98082 …
are proposed and analyzed. In fact, we hit the high bound 7.7720 0 1 3≈ 1.98082 …
Stability and applicability of iterative methods with memory
Based on the third-order Traub's method, two iterative schemes with memory are introduced.
The proper inclusion of accelerating parameters allows the introduction of memory …
The proper inclusion of accelerating parameters allows the introduction of memory …
A new family of adaptive methods with memory for solving nonlinear equations
In this work, an adaptive method with memory is developed such that all previous
information are applied. The importance of the proposed method can be seen because of …
information are applied. The importance of the proposed method can be seen because of …
[HTML][HTML] An Ostrowski-type method with memory using a novel self-accelerating parameter
In this paper, an Ostrowski-type method with memory is proposed for solving nonlinear
equations. To this end, we first present an optimal fourth-order Ostrowski-type method …
equations. To this end, we first present an optimal fourth-order Ostrowski-type method …
[PDF][PDF] On an efficient family with memory with high order of convergence for solving nonlinear equations
The primary goal of this work is to introduce general family Steffensen-like methods with
memory of the high efficiency indices. To achieve this target two parameters are introduced …
memory of the high efficiency indices. To achieve this target two parameters are introduced …
An efficient optimal derivative-free fourth-order method and its memory variant for non-linear models and their dynamics
We propose a new optimal iterative scheme without memory free from derivatives for solving
non-linear equations. There are many iterative schemes existing in the literature which …
non-linear equations. There are many iterative schemes existing in the literature which …