scholarly journals Modified Dai-Yuan iterative scheme for Nonlinear Systems and its Application

2021 ◽  
Vol 0 (0) ◽  
pp. 0
Author(s):  
Mohammed Yusuf Waziri ◽  
Kabiru Ahmed ◽  
Abubakar Sani Halilu ◽  
Aliyu Mohammed Awwal
Keyword(s):  
Nonlinear Systems ◽  
Global Convergence ◽  
Iterative Methods ◽  
Nonsmooth Optimization ◽  
Projection Method ◽  
Numerical Experiments ◽  
Iterative Scheme ◽  
Search Direction ◽  
Derivative Free ◽  
Convergence Of The Scheme

<p style='text-indent:20px;'>By exploiting the idea employed in the spectral Dai-Yuan method by Xue et al. [IEICE Trans. Inf. Syst. 101 (12)2984-2990 (2018)] and the approach applied in the modified Hager-Zhang scheme for nonsmooth optimization [PLos ONE 11(10): e0164289 (2016)], we develop a Dai-Yuan type iterative scheme for convex constrained nonlinear monotone system. The scheme's algorithm is obtained by combining its search direction with the projection method [Kluwer Academic Publishers, pp. 355-369(1998)]. One of the new scheme's attribute is that it is derivative-free, which makes it ideal for solving non-smooth problems. Furthermore, we demonstrate the method's application in image de-blurring problems by comparing its performance with a recent effective method. By employing mild assumptions, global convergence of the scheme is determined and results of some numerical experiments show the method to be favorable compared to some recent iterative methods.</p>

scholarly journals Derivative-Free Iterative Methods with Some Kurchatov-Type Accelerating Parameters for Solving Nonlinear Systems

Symmetry ◽  
2021 ◽  
Vol 13 (6) ◽  
pp. 943
Author(s):  
Xiaofeng Wang ◽  
Yingfanghua Jin ◽  
Yali Zhao
Keyword(s):  
Nonlinear Systems ◽  
Iterative Methods ◽  
Numerical Experiments ◽  
Order Of Convergence ◽  
Nonlinear Ordinary Differential Equations ◽  
New Methods ◽  
Derivative Free ◽  
Initial Scheme ◽  
With Memory ◽  
Theoretical Results

Some Kurchatov-type accelerating parameters are used to construct some derivative-free iterative methods with memory for solving nonlinear systems. New iterative methods are developed from an initial scheme without memory with order of convergence three. New methods have the convergence order 2+5≈4.236 and 5, respectively. The application of new methods can solve standard nonlinear systems and nonlinear ordinary differential equations (ODEs) in numerical experiments. Numerical results support the theoretical results.

scholarly journals A modified Perry-type derivative-free projection method for solving large-scale nonlinear monotone equations

2021 ◽  
Author(s):  
Mompati Koorapetse ◽  
P Kaelo ◽  
S Kooepile-Reikeletseng
Keyword(s):  
Global Convergence ◽  
Projection Method ◽  
Conjugate Gradient ◽  
Gradient Method ◽  
Large Scale ◽  
Numerical Results ◽  
Projection Technique ◽  
Monotone Equations ◽  
Derivative Free ◽  
Nonlinear Monotone Equations

In this paper, a new modified Perry-type derivative-free projection method for solving large-scale nonlinear monotone equations is presented. The method is developed by combining a modified Perry's conjugate gradient method with the hyperplane projection technique. Global convergence and numerical results of the proposed method are established. Preliminary numerical results show that the proposed method is promising and efficient compared to some existing methods in the literature.

scholarly journals Two Efficient Derivative-Free Iterative Methods for Solving Nonlinear Systems

Algorithms ◽  
2016 ◽  
Vol 9 (1) ◽  
pp. 14 ◽  
Author(s):  
Xiaofeng Wang ◽  
Xiaodong Fan
Keyword(s):  
Nonlinear Systems ◽  
Iterative Methods ◽  
Derivative Free

scholarly journals The “global” convergence of Broyden-like methods with suitable line search

1986 ◽  
Vol 28 (1) ◽  
pp. 75-92 ◽  
Author(s):  
Anderas Griewank
Keyword(s):  
Global Convergence ◽  
Iterative Methods ◽  
Level Set ◽  
Superlinear Convergence ◽  
Line Search ◽  
Divided Difference ◽  
Inverse Function ◽  
System Of Nonlinear Equations ◽  
Derivative Free ◽  
Quasi Newton

Iterative methods for solving a square system of nonlinear equations g(x) = 0 often require that the sum of squares residual γ (x) ≡ ½∥g(x)∥2 be reduced at each step. Since the gradient of γ depends on the Jacobian ∇g, this stabilization strategy is not easily implemented if only approximations Bk to ∇g are available. Therefore most quasi-Newton algorithms either include special updating steps or reset Bk to a divided difference estimate of ∇g whenever no satisfactory progress is made. Here the need for such back-up devices is avoided by a derivative-free line search in the range of g. Assuming that the Bk are generated from an rbitrary B0 by fixed scale updates, we establish superlinear convergence from within any compact level set of γ on which g has a differentiable inverse function g−1.

scholarly journals An Optimal Fourth Order Derivative-Free Numerical Algorithm for Multiple Roots

Symmetry ◽  
2020 ◽  
Vol 12 (6) ◽  
pp. 1038 ◽  
Author(s):  
Sunil Kumar ◽  
Deepak Kumar ◽  
Janak Raj Sharma ◽  
Clemente Cesarano ◽  
Praveen Agarwal ◽  
...  
Keyword(s):  
Iterative Methods ◽  
Numerical Algorithm ◽  
Fourth Order ◽  
Iterative Scheme ◽  
Higher Order ◽  
New Technique ◽  
Multiple Roots ◽  
Order Convergence ◽  
Higher Order Methods ◽  
Derivative Free

A plethora of higher order iterative methods, involving derivatives in algorithms, are available in the literature for finding multiple roots. Contrary to this fact, the higher order methods without derivatives in the iteration are difficult to construct, and hence, such methods are almost non-existent. This motivated us to explore a derivative-free iterative scheme with optimal fourth order convergence. The applicability of the new scheme is shown by testing on different functions, which illustrates the excellent convergence. Moreover, the comparison of the performance shows that the new technique is a good competitor to existing optimal fourth order Newton-like techniques.

scholarly journals Convergent Homotopy Analysis Method for Solving Linear Systems

2013 ◽  
Vol 2013 ◽  
pp. 1-6 ◽  
Author(s):  
H. Nasabzadeh ◽  
F. Toutounian
Keyword(s):  
Iterative Method ◽  
Linear Systems ◽  
Iterative Methods ◽  
Homotopy Analysis Method ◽  
Numerical Experiments ◽  
Series Solution ◽  
Iterative Scheme ◽  
New Method ◽  
Analysis Method ◽  
Homotopy Analysis

By using homotopy analysis method (HAM), we introduce an iterative method for solving linear systems. This method (HAM) can be used to accelerate the convergence of the basic iterative methods. We also show that by applying HAM to a divergent iterative scheme, it is possible to construct a convergent homotopy-series solution when the iteration matrix G of the iterative scheme has particular properties such as being symmetric, having real eigenvalues. Numerical experiments are given to show the efficiency of the new method.

scholarly journals A Modified PRP-CG Type Derivative-Free Algorithm with Optimal Choices for Solving Large-Scale Nonlinear Symmetric Equations

Symmetry ◽  
2021 ◽  
Vol 13 (2) ◽  
pp. 234
Author(s):  
Jamilu Sabi’u ◽  
Kanikar Muangchoo ◽  
Abdullah Shah ◽  
Auwal Bala Abubakar ◽  
Lateef Olakunle Jolaoso
Keyword(s):  
Global Convergence ◽  
Nonlinear Equations ◽  
Conjugate Gradient ◽  
Large Scale ◽  
Search Direction ◽  
Large Scale Systems ◽  
Measure Function ◽  
Derivative Free ◽  
Newton Direction

Inspired by the large number of applications for symmetric nonlinear equations, this article will suggest two optimal choices for the modified Polak–Ribiére–Polyak (PRP) conjugate gradient (CG) method by minimizing the measure function of the search direction matrix and combining the proposed direction with the default Newton direction. In addition, the corresponding PRP parameters are incorporated with the Li and Fukushima approximate gradient to propose two robust CG-type algorithms for finding solutions for large-scale systems of symmetric nonlinear equations. We have also demonstrated the global convergence of the suggested algorithms using some classical assumptions. Finally, we demonstrated the numerical advantages of the proposed algorithms compared to some of the existing methods for nonlinear symmetric equations.

Derivative free iterative methods for nonlinear systems

2015 ◽  
Vol 259 ◽  
pp. 955-966 ◽  
Author(s):  
José L. Hueso ◽  
Eulalia Martínez ◽  
Carles Teruel
Keyword(s):  
Nonlinear Systems ◽  
Iterative Methods ◽  
Derivative Free

scholarly journals On a New Iterative Scheme without Memory with Optimal Eighth Order

2014 ◽  
Vol 2014 ◽  
pp. 1-6 ◽  
Author(s):  
M. Sharifi ◽  
S. Karimi Vanani ◽  
F. Khaksar Haghani ◽  
M. Arab ◽  
S. Shateyi
Keyword(s):  
Nonlinear Equations ◽  
Numerical Experiments ◽  
Iterative Scheme ◽  
Convergence Order ◽  
Free Form ◽  
Eighth Order ◽  
Derivative Free ◽  
Theoretical Results

The purpose of this paper is to derive and discuss a three-step iterative expression for solving nonlinear equations. In fact, we derive a derivative-free form for one of the existing optimal eighth-order methods and preserve its convergence order. Theoretical results will be upheld by numerical experiments.

Sign in / Sign up

Export Citation Format

Share Document