Related papers: On two families of iterative methods without memor…
Is it possible for a first-order method, i.e., only first derivatives allowed, to be quadratically convergent? For univariate loss functions, the answer is yes -- the Steffensen method avoids second derivatives and is still quadratically…
The aim of this paper is to introduce a new Newton-type iterative method and then to show that this process converges to the unique solution of the scalar nonlinear equation f(x)=0 under weaker conditions involving only f and f' by fixed…
Some fractional Newton methods have been proposed in order to find roots of nonlinear equations using fractional derivatives. In this paper we introduce a fractional Newton method with order $\alpha+1$ and compare with another fractional…
Linear programming relaxations are central to {\sc map} inference in discrete Markov Random Fields. The ability to properly solve the Lagrangian dual is a critical component of such methods. In this paper, we study the benefit of using…
We established a new eighth-order iterative method, consisting of three steps, for solving nonlinear equations. Per iteration the method requires four evaluations (three function evaluations and one evaluation of the first derivative).…
In this paper we present iterative methods of high efficiency by the criteria of J. F. Traub and A. M. Ostrowski. We define {\it s-nonstationary iterative processes} and prove that, for any one-point iterative process without memory, such…
In this paper a class of simple, but nonlinear, systems of recursions involving $2$ dependent variables $x_{j}\left( n\right) $ is identified, such that the solutions of their initial-values problems -- with arbitrary initial data…
We study the dynamics of four families of methods obtained with a weight function from a convex combination of Newton's method and a Newton-Halley type method on polynomials with two roots. We find the analytical expressions for the fixed…
We focus on the numerical approximation of the Cahn-Hilliard type equations, and present a family of second-order unconditionally energy-stable schemes. By reformulating the equation into an equivalent system employing a scalar auxiliary…
We address the numerical solution of second-order Mean Field Game problems through Newton iterations in infinite dimensions, introduced in [14], where quadratic convergence of the method was rigorously established. Building upon this…
The iterative problem of solving nonlinear equations is studied. A new Newton like iterative method with adjustable parameters is designed based on the dynamic system theory. In order to avoid the derivative function in the iterative…
The Newton iteration is a popular method for minimising a cost function on Euclidean space. Various generalisations to cost functions defined on manifolds appear in the literature. In each case, the convergence rate of the generalised…
An iterative formula based on Newton Method alone is presented for the iterative solutions of equations that ensures convergence in cases where the traditional Newton Method may fail to converge to the desired root. In addition, the method…
Many problems in applied mathematics require root finding algorithms. Unfortunately, root finding methods have limitations. Firstly, regarding the convergence, there is a trade-off between the size of it's domain and it's rate. Secondly the…
We construct a family of integrable equations of the form $v_t=f(v,v_x,v_{xx},v_{xxx})$ such that $f$ is a transcendental function in $v,v_x,v_{xx}$. This family is related to the Krichever-Novikov equation by a differential substitution.…
The present author recently proposed and proved a relationship theorem between nonlinear polynomial equations and the corresponding Jacobian matrix. By using this theorem, this paper derives a Newton iterative formula without requiring the…
The object of the present work is to present the new classes of third-order and fourth-order iterative methods for solving nonlinear equations. Our third-order method includes methods of Weerakoon \cite{Weerakoon}, Homeier \cite{Homeier2},…
In this work, we define a more general family of polynomials in several variables satisfying a linear recurrence relation. Then we provide explicit formulas and determinantal expressions. Finally, we apply these results to recurrent…
Efficient methods for computing with matrices over finite fields often involve randomised algorithms, where matrices with a certain property are sought via repeated random selection. Complexity analyses for these algorithms require…
In this paper, we investigate the existence of $C^n$, $n\in \mathbb{N}^+$, solutions for a class of second-order iterative functional equations involving iterates of the unknown function and a nonlinear term. Applying the Fiber Contraction…