Next Article in Journal
Automated Eye Disease Diagnosis Using a 2D CNN with Grad-CAM: High-Accuracy Detection of Retinal Asymmetries for Multiclass Classification
Previous Article in Journal
Full-Element Analysis of Side-Channel Leakage Dataset on Symmetric Cryptographic Advanced Encryption Standard
Previous Article in Special Issue
On the Fixed Points of Large Enriched Contractions in Convex Metric Space with an Application
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Semilocal Convergence Domain of a Chandrasekhar Integral Equation

by
Eulalia Martínez
1,† and
Arleen Ledesma
2,*,†
1
Instituto de Matemática Multidisciplinar, Universitat Politècnica de València, Camino de Vera s/n, 46022 Valencia, Spain
2
Escuela de Matemática, Universidad Autónoma de Santo Domingo (UASD), Alma Máter, Santo Domingo 10105, Dominican Republic
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Symmetry 2025, 17(5), 767; https://doi.org/10.3390/sym17050767
Submission received: 27 March 2025 / Revised: 30 April 2025 / Accepted: 13 May 2025 / Published: 15 May 2025

Abstract

:
In this study, we discuss the semilocal convergence analysis of a fourth-order iterative method in Banach spaces. We assume the Fréchet derivative satisfies the Lipschitz continuity condition, obtains suitable recurrence relations, and determines the domain of convergence under appropriate initial estimates. In addition, the uniqueness domain for the solution and the error bounds are obtained. Next, several numerical examples, one which includes a Chandrasekhar integral equation, are carried out to apply the theoretical findings for semilocal convergence. Then, a final overview is provided.

1. Introduction

Finding solutions to nonlinear equations of the form P x = 0 (where P : D X Y is a differentiable nonlinear operator, X , Y are complete normed linear spaces, and D is a non-empty, open, and convex set) is a fundamental and widely studied problem in applied mathematics. As it is often difficult to obtain an exact solution to the previous equation, we typically seek a numerical approximation instead. In such cases, we rely on approximation methods, which are typically iterative.
There are different types of convergence results used to approximate solutions to nonlinear equations. The first type, referred to as local convergence, depends on the existence of a presumed solution and requires the initial value to be sufficiently close to it. The second type, known as semilocal convergence, does not assume the existence of a specific solution, but the initial values must still satisfy certain conditions to guarantee convergence. Analyzing the semilocal convergence of iterative methods in Banach spaces is of great theoretical interest, as it enables the derivation of key results such as the existence and uniqueness of solutions, the convergence rate, a priori error estimates, and convergence regions, based solely on assumptions about the initial approximation x 0 rather than the solution itself. Such results have practical relevance in solving equations arising from differential and integral models. A semilocal convergence study can be developed through two distinct approaches, namely recurrent relations and recurrent functions.
For the classical Newton’s method [1], the semilocal convergence using recurrence relations was obtained by Kantorovich in [2]. Polyak [3] affirms that Kantorovich established in [4] a rigorous theoretical framework for the method of successive approximations applied to solving functional equations and introduced a semilocal analysis of Newton’s method by leveraging Banach’s contraction mapping principle. He focused on proving the conditions under which the method converges to a solution, thereby laying the groundwork for subsequent developments in numerical analysis and optimization. This was later refined to semilocal quadratic convergence in 1948, known as the Newton–Kantorovich theorem [5]. Kantorovich developed two distinct approaches to proving the aforementioned theorem, with one involving recurrence relations and the other employing majorant functions. The first proof [5] used recurrence relations, while the second [6] was founded on the majorant function framework. Mysovskikh [7] presented a more straightforward proof of semilocal quadratic convergence, based on slightly altered theoretical premises. Since the work carried out by Kantorovich, extensive research has explored the convergence and error bounds of Newton’s method based on the theorem’s assumptions or related conditions. Among these contributions, the convergence theorems by Ortega and Rheinboldt [8] stand out. Rall (see [9]) proposed an alternative approach for studying semilocal convergence, which relied on recurrence relations and was simpler to analyze. Furthermore, numerous variations of the Newton–Kantorovich theorem have been proposed, each with distinct assumptions and conclusions.
Several studies have explored the semilocal convergence of third-order methods, including the Chebyshev method, addressed in [10,11], and the Halley scheme, discussed in [12]. Many of these works build on Kantorovich’s framework for analyzing the Newton method (see [13,14]). Gutierrez and Hernández [15] provide a comprehensive theory that unifies these third-order methods. All of these papers established that the convergence of sequences in Banach spaces can be traced back to the convergence of a majorant sequence. Then, Hernández [16] introduced a novel form of recurrence relations for the Chebyshev method, composed of two sequences of positive real numbers.
Recently, scholars have carried out studies on semilocal convergence for higher-order iterative methods. For example, Chen et al. [17] studied the semilocal convergence for a modified Newton’s method using recurrence relations. Using that approach, Wang et al. [18] analyzed the semilocal convergence for a sixth-order variant of the Jarratt method. Hueso and Martínez [19] proved a convergence result for a third- and fourth-order family of methods. Jaiswal [20] examined the semilocal convergence of an existing eighth-order method for solving nonlinear equations in Banach spaces under relaxed conditions, utilizing Rall’s straightforward techniques. Later, Cordero et al. [21] used recurrence relations to prove the semilocal convergence in Banach spaces for the multidimensional extension of Chun’s scheme. Argyros et al. [22] provided the semilocal convergence of a two-step Jarratt-type method by using restricted convergence regions combined with majorizing scalar sequences.
Wang et al. [23] established a semilocal convergence study of an iterative method using a recursive relation without requiring higher-order derivatives. They determined the domains of existence and uniqueness by appropriately choosing the initial point and applying the Lipschitz condition to the first-order Fréchet derivative across the region. In [24], a fourth-order family of methods for solving nonlinear equations was proposed and the stability of the class was analyzed using complex dynamical tools. Subsequently, ref. [25] provided local convergence results. Now, the purpose of this paper is to establish the semilocal convergence of this iterative scheme in Banach spaces and obtain error estimates through a system of recurrence relations.
This paper is organized as follows: Section 2 presents preliminary results and introduces the auxiliary functions. Section 3 outlines the development of the recurrence relations. In Section 4, the semilocal convergence is established. Section 5 provides numerical examples to support our theoretical findings. Section 6 concludes the paper and provides final remarks.

2. Preliminary Results

Let X , Y be Banach spaces and P : D X Y a nonlinear twice continuously Fréchet differentiable operator in an open convex domain of D. Consider the family of iterative schemes defined for k = 0 , 1 , 2 , by
y k = x k 2 3 P x k 1 P x k x k + 1 = x k 5 8 α + α P y k 1 P x k + α 3 P x k 1 P y k + 3 8 α 3 P y k 1 P x k 2 P x k 1 P x k .
where α C is a parameter and x 0 is the initial estimate. This family was studied in [24], and its local convergence analysis was carried out in [25]. Let us denote Γ x k = P x k 1 and Γ y k = P y k 1 .
Let x 0 D such that Γ x 0 exists and
(C1
Γ x 0 β .
(C2
Γ x 0 P x 0 η .
(C3
P x ρ , x D .
(C4
P x P y ϑ x y , x , y D .
Let us define β 0 = Γ x 0 , η 0 = Γ x 0 P x 0 , a 0 = ρ β 0 η 0 , and b 0 = ϑ β 0 η 0 2 , where β 0 , η 0 R + . From the first step in (1), we have
y 0 x 0 = 2 3 Γ x 0 P x 0 = 2 3 η 0 .
Prior to performing the semilocal convergence analysis, we apply the following lemmas:
Lemma 1
([26]). If operator P has continuous derivatives up to order k + 1 in an open convex subset D and P k + 1 x ρ for all x D , then if x 0 D , the following is obtained:
P x = j = 0 k 1 k ! P k x x x 0 k + R x 0 , k x x 0 ,
where the remainder can be expressed as
R x 0 , k x x 0 = 1 k ! 0 1 1 t k P k + 1 x 0 + t x x 0 x x 0 k + 1 d t
and
R x 0 , k x x 0 ρ k + 1 ! x x 0 k + 1 .
The previous lemma provides an expression and a bound for the remainder of Taylor’s expansion of the operator P , and the next lemma (Banach Lemma) will allow us to guarantee the existence and boundedness of an inverse matrix. Both lemmas will be used in the upcoming proofs.
Lemma 2
(Banach Lemma [27]). Let T L X , X , where L X , X is the space of all continuous linear operators on X into X. For such T, the norm
T = s u p x 1 T x
is defined. If T < 1 , then I T is an invertible matrix and
I T 1 1 1 T .
Now, in order to set the semilocal study, we analyze the iterative method (1) step by step. Let us find a bound for x 1 x 0 and x 1 y 0 . We have
x 1 x 0 = x 1 y 0 + y 0 x 0 ,
and using the triangular inequality, we can write
x 1 x 0 x 1 y 0 + y 0 x 0 ,
where from (1), we obtain the following:
x 1 x 0 = 5 8 α + α Γ y 0 P x 0 + α 3 Γ x 0 P y 0 + 3 8 α 3 Γ y 0 P x 0 2 Γ x 0 P x 0 ,
and
x 1 y 0 = 1 24 + α α Γ y 0 P x 0 α 3 Γ x 0 P y 0 3 8 α 3 Γ y 0 P x 0 2 Γ x 0 P x 0 .
By applying Banach’s Lemma, we aim to prove the existence of the inverse of the operator Γ x 0 P y 0 = P x 0 1 P y 0 and then the existence of the inverse of Γ y 0 P x 0 = P y 0 1 P x 0 . Thus, using (C1), (C3) and the definition of β 0 , the following condition must be met:
I Γ x 0 P y 0 Γ x 0 P x 0 P y 0 = Γ x 0 x 0 y 0 P x d x Γ x 0 x 0 y 0 P x d x β 0 ρ y 0 x 0 = 2 3 β 0 ρ η 0 = 2 3 a 0 < 1 .
By the Banach Lemma, Γ x 0 P y 0 1 exists and
Γ y 0 P x 0 3 3 2 a 0 .
Next, we prove the existence of the inverse of the operator Γ y 0 P x 0 . Hence, the next condition must be satisfied
I Γ y 0 P x 0 = Γ y 0 P y 0 Γ y 0 P x 0 = Γ y 0 P x 0 I Γ x 0 P y 0 2 a 0 3 2 a 0 < 1 ,
if 2 a 0 < 3 2 a 0 , which leads to a 0 < 3 4 and by the Banach Lemma, Γ y 0 P x 0 1 exists and
Γ x 0 P y 0 1 1 I Γ y 0 P x 0 3 2 a 0 3 4 a 0 .
By taking the norm in (3) and using (4)–(6), the following is obtained:
x 1 y 0 1 24 + α + 3 α 3 2 a 0 + α 3 2 a 0 3 3 4 a 0 + 3 8 α 3 9 3 2 a 0 2 η 0
x 1 y 0 p α a 0 η 0 ,
where
p α t = 1 24 + α + 3 α 3 2 t + α 3 2 t 3 3 4 t + 3 8 α 3 9 3 2 t 2 ,
replacing (2) and (7) in (2), we have
x 1 x 0 p α a 0 + 2 3 η 0 = g α a 0 η 0 ,
where by definition
g α t = p α t + 2 3 .
The result obtained from Lemma 2 is applied to I Γ x 0 P x 1 in order to prove the existence of the inverse matrix of Γ x 0 P x 1 and the inverse of P x 1 . Therefore, the following condition must hold:
I Γ x 0 P x 1 Γ x 0 P x 0 P x 1 = Γ x 0 x 0 x 1 P x d x Γ x 0 x 0 x 1 P x d x β 0 ρ x 1 x 0 β 0 ρ g α a 0 η 0 = a 0 g α a 0 < 1 ,
by the Banach Lemma, Γ x 1 P x 0 exists and
Γ x 1 P x 0 1 1 I Γ x 0 P x 1 1 1 a 0 g α a 0 .
Therefore,
Γ x 1 P x 0 1 I Γ x 0 P x 1 1 1 a 0 g α a 0 = P x 0 f α a 0 ,
where by definition
f α t = 1 1 t g α t .
Taylor’s expansion of P x 1 around x 0 can be described as follows:
P x 1 = P x 0 + P x 0 x 1 x 0 + 1 2 P x 0 x 1 x 0 2 + 0 1 P x 0 + t x 1 x 0 P x 0 x 1 x 0 2 1 t d t ,
Multiplying by P x 0 , the first step in (1), we have
3 2 P x 0 y 0 x 0 = P x 0 ,
Then, replacing (15) in (14), we obtain
P x 1 = 3 2 P x 0 y 0 x 0 + P x 0 x 1 x 0 + 1 2 P x 0 x 1 x 0 2 + 0 1 P x 0 + t x 1 x 0 P x 0 x 1 x 0 2 1 t d t , P x 1 = P x 0 x 1 y 0 1 2 y 0 x 0 + 1 2 P x 0 x 1 x 0 2 + 0 1 P x 0 + t x 1 x 0 P x 0 x 1 x 0 2 1 t d t , P x 1 = P y 0 x 0 y 0 P t d t x 1 y 0 1 2 y 0 x 0 + 1 2 P x 0 x 1 x 0 2 + 0 1 P x 0 + t x 1 x 0 P x 0 x 1 x 0 2 1 t d t .
Now, Taylor’s expansion of P y 0 around x 0 is
P y 0 = P x 0 + P x 0 y 0 x 0 + 0 1 P x 0 + t y 0 x 0 P x 0 y 0 x 0 d t .
From the first step in (1), we have y 0 x 0 = 2 3 u 0 x 0 , where
u 0 = x 0 Γ x 0 P x 0 .
Therefore,
P y 0 = P x 0 + P x 0 2 3 u 0 x 0 + 0 1 P x 0 + t 2 3 u 0 x 0 P x 0 2 3 u 0 x 0 d t , P y 0 = P x 0 2 3 P x 0 u 0 x 0 2 3 0 1 P x 0 + t 2 3 u 0 x 0 P x 0 u 0 x 0 d t .
Then,
Γ x 0 P x 1 = Γ x 0 P x 0 2 3 P x 0 u 0 x 0 2 3 0 1 P x 0 + t 2 3 u 0 x 0 P x 0 u 0 x 0 d t x 0 y 0 P t d t x 1 y 0 1 2 y 0 x 0 + 1 2 Γ x 0 P x 0 x 1 x 0 2 + Γ x 0 0 1 P x 0 + t x 1 x 0 P x 0 x 1 x 0 2 1 t d t
and taking the norm
Γ x 0 P x 1 Γ x 0 P x 0 2 3 P x 0 u 0 x 0 2 3 0 1 P x 0 + t 2 3 u 0 x 0 P x 0 x 0 y 0 P t d t x 1 y 0 1 2 y 0 x 0 + 1 2 Γ x 0 P x 0 x 1 x 0 2 + Γ x 0 0 1 P x 0 + t x 1 x 0 P x 0 x 1 x 0 2 1 t d t , Γ x 0 P x 1 Γ x 0 P x 0 x 1 y 0 + 2 3 Γ x 0 P x 0 u 0 x 0 x 1 y 0 + 2 9 Γ x 0 ϑ u 0 x 0 2 x 1 y 0 + Γ x 0 ρ y 0 x 0 x 1 y 0 + 1 2 Γ x 0 P x 0 y 0 x 0 + 1 2 2 3 Γ x 0 P x 0 u 0 x 0 y 0 x 0 + 1 2 2 9 Γ x 0 ϑ u 0 x 0 2 y 0 x 0 + 1 2 Γ x 0 ρ y 0 x 0 2 + 1 2 β 0 ρ x 1 x 0 2 + Γ x 0 ϑ 6 x 1 x 0 3 ,
where
0 1 P x 0 + t x 1 x 0 P x 0 x 1 x 0 2 1 t d t 0 1 ϑ x 0 + t x 1 t x 0 x 0 x 1 x 0 2 1 t d t 0 1 ϑ t x 1 x 0 3 1 t d t = ϑ x 1 x 0 3 0 1 t t 2 d t = ϑ x 1 x 0 3 t 2 2 t 3 3 0 1 = ϑ 6 x 1 x 0 3
and
2 3 0 1 P x 0 + t 2 3 u 0 x 0 P x 0 u 0 x 0 d t 2 3 0 1 ϑ x 0 2 3 t u 0 t x 0 x 0 u 0 x 0 d t 4 9 0 1 ϑ u 0 x 0 2 t d t = 4 9 ϑ u 0 x 0 2 0 1 t d t = 4 9 ϑ u 0 x 0 2 t 2 2 0 1 = 2 9 ϑ u 0 x 0 2 .
Using (2) and conditions (C1)–(C4), we have
Γ x 0 P x 1 p α a 0 η 0 + 2 3 β 0 ρ p α a 0 η 0 2 + 2 9 β 0 ϑ p α a 0 η 0 3 + 2 3 β 0 ρ p α a 0 η 0 2 + 1 2 2 3 η 0 + 1 3 2 3 β 0 ρ η 0 2 + 1 9 2 3 β 0 ϑ η 0 3 + 1 2 2 3 2 3 β 0 ρ η 0 2 + 1 2 β 0 ρ g α a 0 η 0 2 + β 0 ϑ 6 g α a 0 η 0 3 .
Now, using (8), (9), and the definition for a 0 , b 0 , we obtain
Γ x 0 P x 1 p α a 0 + 2 3 a 0 p α a 0 + 2 9 b 0 p α a 0 + 2 3 a 0 p α a 0 + 1 3 + 2 9 a 0 + 2 27 b 0 + 2 9 a 0 + 1 2 a 0 g α 2 a 0 + 1 6 b 0 g α 3 a 0 η 0 , Γ x 0 P x 1 p α a 0 + 4 3 a 0 p α a 0 + 2 9 b 0 p α a 0 + 1 3 + 4 9 a 0 + 2 27 b 0 + 1 2 a 0 g α 2 a 0 + 1 6 b 0 g α 3 a 0 η 0 .
Thus,
Γ x 0 P x 1 1 3 + p α a 0 1 + 4 3 a 0 + 2 9 b 0 + 1 2 a 0 g α 2 a 0 + 1 6 b 0 g α 3 a 0 η 0 ,
Then, taking (11) and (16), we obtain
Γ x 1 P x 1 = Γ x 1 P x 0 Γ x 0 P x 1 Γ x 1 P x 0 Γ x 0 P x 1 f α a 0 1 3 + p α a 0 1 + 4 3 a 0 + 2 9 b 0 + 1 2 a 0 g α 2 a 0 + 1 6 b 0 g α 3 a 0 η 0 = f α a 0 φ α a 0 , b 0 η 0 ,
where by definition
φ α t , u = 1 3 + p α t 1 + 4 3 t + 2 9 u + 1 2 t g α 2 t + 1 6 u g α 3 t .
In the following section, we will establish the recurrence relations and present some technical lemmas, which will be crucial for the demonstration of the convergence properties of the iterative scheme (1).

3. Recurrence Relations for the Scheme

Consider the following sequences:
a k + 1 = a k f α 2 a k φ α a k , b k ,
b k + 1 = b k f α 3 a k φ α 2 a k , b k ,
η k + 1 = η k f α a k φ α a k , b k ,
for k = 0 , 1 , 2 ,
Now, we present the following lemmas:
Lemma 3.
Let p α , g α , f α , a n d φ α be the functions defined by (8), (10), (13) and (17), respectively. Suppose that a 0 0 , 3 4 and f α 2 a 0 φ α a 0 , b 0 < 1 . Then, the following can be stated:
(i) 
p α t , g α t , and f α t are increasing functions and p α t > 0 , g α t > 0 , f α t > 1 t 0 , 3 4 .
(ii) 
φ α t , u is increasing as a function of t and increasing as a function of u t 0 , 3 4 and u > 0 .
(iii) 
The sequences a k , b k , a n d η k are decreasing; a k g α a k < 1 and f α 2 a k φ α a k , b k < 1 .
Proof of Lemma 3.
Let p α t , g α t , f α t , and φ α t , u be the functions defined by (8), (10), (13) and (17), respectively.
(i)
Considering t 0 , 3 4 , we determine that the derivative of p α t is
p α t = 3 α 2 3 2 t 2 + α 3 2 3 4 t 3 2 t 4 3 3 4 t 2 + 3 8 α 3 9 2 2 3 2 t 3 p α t = 6 α 3 2 t 2 + 2 α 3 4 t 2 + 3 8 α 3 36 3 2 t 3 .
We have determined that p α t > 0 for all t in the interval 0 , 3 4 . Therefore, p α t is increasing for t 0 , 3 4 . Also, the following can be determined:
p α 0 = 1 24 + α + α + α 3 + 3 8 α 3 > 0
and p α t > 0 .
Consequently, g α t = p α t > 0 is increasing; g α 0 = p α 0 + 2 3 > 0 and g α t > 0 . Thus,
f α t = t g α t + g α t 1 t g α t 2 ,
since g α t > 0 , g α t > 0 , then f α t > 0 . Therefore, f α t is increasing; f α 0 = 1 and f α t > 1 .
(ii)
From (17), we have determined that
φ α t , u = 1 3 + p α t 1 + 4 3 t + 2 9 u + 1 2 t g α 2 t + 1 6 u g α 3 t ,
then
φ α t , u t = 1 3 + p α t 4 3 + p α t 1 + 4 3 t + 2 9 u + t g α t g α t + 1 2 g α 2 t + 1 2 u g α 2 t g α t .
Consequently, φ α t , u is increasing as a function of t and φ α 0 , u > 0 . In addition,
φ α t , u u = 1 3 + p α t 2 9 + + 1 6 g α 3 t ,
Therefore, φ α t , u is increasing as a function of u.
It is concluded that φ α t , u is increasing as a function of t and also increasing as a function of u, t 0 , 3 4 , and u > 0 .
(iii)
Suppose that
f α 2 a 0 φ α a 0 , b 0 < 1 .
Then,
a 1 = a 0 f α 2 a 0 φ α a 0 , b 0 < a 0
and
b 1 = b 0 f α 3 a 0 φ α 2 a 0 , b 0 = b 0 f α 2 a 0 φ α a 0 , b 0 f α a 0 φ α a 0 , b 0 = b 0 f α a 0 φ α a 0 , b 0 < b 0 ,
as f α 2 a 0 φ α a 0 , b 0 < 1 and f α 2 a 0 > 1 implies that f α a 0 φ α a 0 , b 0 < 1 .
Furthermore, we have determined that
η 1 = η 0 f α a 0 φ α a 0 , b 0 < η 0 .
By induction, suppose that k > 0 , we have
a k < a k 1 f α 2 a k 1 φ α a k 1 , b k 1 < 1 b k < b k 1 f α 3 a k 1 φ α 2 a k 1 , b k 1 < 1 η k < η k 1 f α a k 1 φ α a k 1 , b k 1 < 1 .
For the above reasons and the fact that f α and φ α are increasing, we have
f α 2 a k φ α a k , b k < f α 2 a k 1 φ α a k 1 , b k 1 < 1 f α 3 a k φ α 2 a k , b k < f α 3 a k 1 φ α 2 a k 1 , b k 1 < 1 f α a k φ α a k , b k < f α a k 1 φ α a k 1 , b k 1 < 1 .
Thus,
a k = a k 1 f α 2 a k 1 φ α a k 1 , b k 1 < a k 1 b k = b k 1 f α 3 a k 1 φ α 2 a k 1 , b k 1 < b k 1 η k = η k 1 f α a k 1 φ α a k 1 , b k 1 < η k 1 .
Consequently, a k , b k , and η k are decreasing sequences.
Since g α a k is increasing and a k < a k 1 < < a 0 , k 0 , then by induction g α a k < g α a k 1 < < g α a 0 and a k g α a k < a 0 g α a 0 < 1 are obtained. Hence, a k g α a k < 1 and f α 2 a k φ α a k , b k < 1 .
Lemma 4.
Let p α , g α , f α , a n d φ α be the functions defined by (8), (10), (13) and (17), respectively. Suppose that δ 0 , 1 . Then, p α δ t < p α t , g α δ t < g α t , f α δ t < f α t , and φ α δ t , δ 2 u < δ φ α t , u .
Proof of Lemma 4.
For the proof of this lemma, we have considered the definitions of the functions.
Suppose that δ 0 , 1 . Then,
φ α δ t , δ 2 u = 1 3 + p α δ t 1 + 4 3 δ t + 2 9 δ 2 u + 1 2 δ t g α 2 δ t + 1 6 δ 2 u g α 3 δ t 1 3 + p α t 1 + 4 3 δ t + 2 9 δ 2 u + 1 2 δ t g α 2 t + 1 6 δ 2 u g α 3 t δ 1 3 + p α t 1 + 4 3 t + 2 9 u + 1 2 δ t g α 2 t + 1 6 δ u g α 3 t = δ φ α t , u .
Lemma 5.
Under the hypothesis of Lemma 3, if we define σ = a 1 a 0 = f α 2 a 0 φ α a 0 , b 0 and μ = 1 f α a 0 , the following are obtained:
(i) 
σ 0 , 1 .
(ii) 
a k σ 2 k 1 a k 1 σ 2 k 1 a 0 ,
b k σ 2 2 k 1 b k 1 σ 2 2 k 1 b 0 .
(iii) 
f α a k φ α a k , b k σ 2 k μ , k N .
(iv) 
η k η 0 σ 2 k 1 μ k .
(v) 
k = m m + n 1 η k μ m σ 2 m 1 η 0 1 σ 2 m μ n 1 σ 2 m μ .
Proof of Lemma 5.
Suppose that σ = a 1 a 0 = f α 2 a 0 φ α a 0 , b 0 and μ = 1 f α a 0 . Then,
(i)
σ 0 , 1 , because f α 2 a 0 φ α a 0 , b 0 < 1 .
(ii)
a 1 = a 0 f α 2 a 0 φ α a 0 , b 0 = σ a 0 , a 2 = a 1 f α 2 a 1 φ α a 1 , b 1 = σ a 0 f α 2 σ a 0 φ α σ a 0 , σ 2 b 0 σ a 0 f α 2 a 0 σ φ α a 0 , b 0 = σ 2 a 0 f α 2 a 0 φ α a 0 , b 0 = σ 2 a 1 = σ 3 a 0 .
Using mathematical induction, we can ascertain that
a k = a k 1 f α 2 a k 1 φ α a k 1 , b k 1 σ 2 k 2 a k 2 f α 2 σ 2 k 2 a k 2 φ α σ 2 k 2 a k 2 , σ 2 k 2 2 b k 2 σ 2 k 2 a k 2 f α 2 a k 2 σ 2 k 2 φ α a k 2 , b k 2 = σ 2 k 2 2 a k 2 f α 2 a k 2 φ α a k 2 , b k 2 = σ 2 k 2 2 a k 1 = σ 2 k 1 a k 1 . a k σ 2 k 1 a k 1 σ 2 k 1 σ 2 k 2 σ a 0 = σ 2 k 1 a 0 .
Similarly,
b 1 = b 0 f α 3 a 0 φ α 2 a 0 , b 0 = b 0 f α 2 a 0 φ α a 0 , b 0 f α a 0 φ α a 0 , b 0 σ 2 b 0 , b 2 = b 1 f α 3 a 1 φ α 2 a 1 , b 1 σ 2 b 0 f α 3 σ a 0 φ α 2 σ a 0 , σ 2 b 0 σ 2 b 0 f α 3 a 0 σ 2 φ α 2 a 0 , b 0 = σ 4 b 0 f α 3 a 0 φ α 2 a 0 , b 0 = σ 4 b 1 σ 6 b 0 ,
and using mathematical induction, we determine that
b k = b k 1 f α 3 a k 1 φ α 2 a k 1 , b k 1 σ 2 2 k 2 b k 2 f α 3 σ 2 k 2 a k 2 φ α 2 σ 2 k 2 a k 2 , σ 2 2 k 2 b k 2 σ 2 2 k 2 b k 2 f α 3 a k 2 σ 2 k 2 2 φ α 2 a k 2 , b k 2 = σ 2 k 1 b k 2 f α 3 a k 2 σ 2 k 1 φ α 2 a k 2 , b k 2 = σ 2 2 k 1 b k 1 . b k = σ 2 2 k 1 b k 1 σ 2 2 k 1 σ 2 2 k 2 σ 2 b 0 σ 2 2 k 1 b 0 .
(iii)
f α a k φ α a k , b k f α σ 2 k 1 a 0 φ α σ 2 k 1 a 0 , σ 2 2 k 1 b 0
σ 2 k 1 f α a 0 φ α a 0 , b 0 = σ 2 k 1 f α 2 a 0 φ α a 0 , b 0 f α a 0 = σ 2 k 1 σ f α a 0 = σ 2 k f α a 0 = σ 2 k μ .
(iv)
As a direct consequence of the previous statement, we have
j = 0 k 1 f α a j φ α a j , b j j = 0 k 1 σ 2 j f α a 0 ,
and the product expansion is
P = j = 0 k 1 σ 2 j f α a 0 = j = 0 k 1 σ 2 j j = 0 k 1 f α a 0 = σ j = 0 k 1 2 j j = 0 k 1 f α a 0 = σ 2 k 1 2 1 f α k a 0 = σ 2 k 1 f α k a 0 = σ 2 k 1 μ k .
By definition of η k ,
η k = η k 1 f α a k 1 φ α a k 1 , b k 1 η 0 j = 0 k 1 f α a j φ α a j , b j η 0 σ 2 k 1 μ k .
(v)
k = m m + n 1 η k k = m m + n 1 η 0 σ 2 k 1 μ k k = m n 1 η 0 σ 2 k + m 1 μ k + m = k = m n 1 η 0 σ 2 m 2 m 2 k 1 2 m σ 2 m 2 m 1 2 m μ k μ m = μ m σ 2 m 1 k = m n 1 η 0 σ 2 m 2 k 1 μ k .
Since k 2 k 1 and σ 0 , 1 , we have determined that σ 2 m 2 k 1 σ 2 m k ; therefore,
k = m m + n 1 η k μ m σ 2 m 1 k = m n 1 η 0 σ 2 m k μ k = μ m σ 2 m 1 k = m n 1 η 0 σ 2 m μ k .
We then normalize the terms of the geometric progression to obtain
k = m m + n 1 η k μ m σ 2 m 1 η 0 1 σ 2 m μ n 1 σ 2 m μ .
Furthermore, as a consequence of the last statement from the aforementioned Lemma 5, since μ < 1 and σ < 1 , we obtain a convergent series which establishes that
k = 0 η k = 1 1 σ μ η 0 .
Lemma 6.
Under the hypothesis of Lemma 3 and conditions (C1)–(C4), it is verified, for all k 0 , that
(i) 
Γ x k exists and Γ x k Γ x k 1 f α a k 1 .
(ii) 
Γ x k P x k η k .
(iii) 
ρ Γ x k Γ x k P x k a k .
(iv) 
ϑ Γ x k Γ x k P x k 2 b k .
(v) 
x k + 1 x k g α a k η k , y k B x 0 , 2 3 + R η 0 ¯ , and x k + 1 B x 0 , R η 0 ¯ .
(vi) 
R = 1 a 0 , α R .
Proof of Lemma 6.
By following the previously outlined development and employing an inductive method, the proof of this lemma can be obtained.
(i)
Let x 0 D ; then, Γ x 0 = P x 0 1 exists by the Banach Lemma and Γ x 0 β with β 0 = a 0 ρ η 0 . Moreover, there exists Γ x 1 , and from (16), we have
Γ x 1 Γ x 0 f α a 0 .
By induction, Γ x k exists and
Γ x k Γ x k 1 f α a k 1 .
(ii)
From (C2), we have determined that Γ x 0 P x 0 η , with Γ x 0 P x 0 = η 0 . Thus,
Γ x 1 P x 1 Γ x 1 P x 1 Γ x 0 f α a 0 P x 1 = η 1 = η 0 f α a 0 φ α a 0 , b 0 .
Using induction, the following is obtained:
Γ x k P x k Γ x k P x k Γ x k 1 f α a k 1 P x k = η k = η k 1 f α a k 1 φ α a k 1 , b k 1
Γ x k P x k η k 1 f α a k 1 φ α a k 1 , b k 1 .
(iii)
We have determined that ρ = a 0 β 0 η 0 , with Γ x 0 = β 0 and Γ x 0 P x 0 = η 0 . Therefore,
ρ Γ x 0 Γ x 0 P x 0 = a 0 .
Then,
ρ Γ x 1 Γ x 1 P x 1 ρ Γ x 0 f α a 0 η 1 = a 0 β 0 η 0 β 0 f α a 0 η 0 f α a 0 φ α a 0 , b 0 = a 0 f α 2 a 0 φ α a 0 , b 0 = a 1 .
Using this method, ρ Γ x 1 Γ x 1 P x 1 = a 1 , and by induction,
ρ Γ x k Γ x k P x k = a k .
(iv)
Similarly to the previous item,
ϑ Γ x 0 Γ x 0 P x 0 2 = ϑ β 0 η 0 2 = a 0 β 0 η 0 β 0 η 0 2 = a 0 η 0 = b 0 .
Then,
ϑ Γ x 1 Γ x 1 P x 1 2 ϑ Γ x 0 f α a 0 η 1 2 = a 0 β 0 η 0 β 0 f α a 0 η 0 2 f α 2 a 0 φ α 2 a 0 , b 0 = a 0 η 0 f α 3 a 0 φ α 2 a 0 , b 0 = b 0 f α 3 a 0 φ α 2 a 0 , b 0 = b 1 .
Using this method, ϑ Γ x 1 Γ x 1 P x 1 2 = b 1 , and by induction,
ϑ Γ x k Γ x k P x k 2 = b k .
(v)
For this proof, we proceed as follows:
x k + 1 x k i = 0 k x i + 1 x i i = 0 k g α a i η i g α a 0 i = 0 k η i R η 0 ,
with R = g α a 0 1 1 μ σ .
For the sequence y k , we have
y k x 0 y k x k + x k x 0 2 3 η k + i = 0 k g α a i η i 2 3 η k + g α a 0 i = 0 k η i 2 3 η 0 + R η 0 2 3 + R η 0 .
Therefore, y k B x 0 , 2 3 + R η 0 ¯ .
(vi)
From the definition of R , μ , and σ , the following can be obtained:
R = g α a 0 1 1 μ σ = g α a 0 1 f α a 0 φ α a 0 , b 0 g α a 0 1 f α a 0 = g α a 0 1 1 1 a 0 g α a 0 1 a 0 ,
where φ α a 0 , b 0 < 1 and a 0 g α a 0 < 1 by the hypothesis of Lemma 3 and the definitions of g α , f α , and φ α .

4. Semilocal Convergence Analysis

With the results previously obtained, we will establish the domains of existence and uniqueness of the solution.
Theorem 1.
Let X , Y be Banach spaces and P : D X Y a nonlinear twice continuously Fréchet differentiable operator in an open convex domain of D. Assume x 0 D and that conditions (C1)–(C4) hold. Consider a 0 = ρ β 0 η 0 and b 0 = ϑ β 0 η 0 2 with a 0 = 0 , 3 4 and functions p α , g α , f α , and φ α defined by (8), (10), (13) and (17), respectively. If B x 0 , 2 3 + R η 0 ¯ D , with R = g α a 0 1 1 μ σ , μ = 1 f α a 0 , and σ = f α 2 a 0 φ α a 0 , b 0 < 1 , then the sequence x k defined by (1) converges to a solution x * of P x = 0 . The R-order of convergence is at least two for any α R . The iterates y k belong to B x 0 , 2 3 + R η 0 ¯ , the iterates x k + 1 and x * belong to B x 0 , R η 0 ¯ , and x * is the only solution in B x 0 , 2 3 ρ β R η 0 D . Moreover, a priori error estimate is given by
x k x * g α a 0 μ k σ 2 k 1 η 0 1 1 σ 2 k μ .
Proof of Theorem 1.
From earlier results, it was established that the sequence x k is well defined. Now, we establish that x k is a Cauchy sequence. Using the fact that g α is increasing and that a j a k j k , we have g α a j g α a k . Applying the last statement of Lemma 5, we obtain
x k + m x k i = k k + m 1 x i + 1 x i i = k k + m 1 g α a i η i g α a 0 i = k k + m 1 η i g α a 0 μ k σ 2 k 1 η 0 1 σ 2 k μ m 1 σ 2 k μ ,
such that x k is a Cauchy sequence and therefore has a limit x * . Taking m , the a priori error estimate is
x k x * g α a 0 μ k σ 2 k 1 η 0 1 1 σ 2 k μ .
In (23), we take k = 0 and the following is obtained:
x 0 x * g α a 0 μ 0 σ 2 0 1 η 0 1 1 σ 2 0 μ = g α a 0 η 0 1 1 σ μ = R η 0 .
Thus, x * B x 0 , R η 0 ¯ . Moreover, x * is a solution of P x = 0 because
P x k P x 0 + P x k P x 0 P x 0 + x 0 x k P x k d x P x 0 + ρ x 0 x k d x P x 0 + ρ x k x 0 .
P x k is bounded (because Γ x k exists in all steps of the scheme) and using item (iv) of Lemma 5, we obtain Γ x k P x k 0 ; then, it can be stated that
P x k = P x k Γ x k P x k P x k Γ x k P x k P x k η k 0 .
Since operator P is continuous in D, we obtain
lim k P x k = P lim k x k = P x * = 0 .
Hence, x * is a solution of P x = 0 .
Let B x 0 , 2 3 ρ β R η 0 be the ball centered in x 0 with radius 2 3 ρ β R η 0 . For the uniqueness proof, let us suppose that y * B x 0 , 2 3 ρ β R η 0 D is another solution of P x = 0 . Then,
0 = P y * P x * = x * y * P v d v = 0 1 P x * + t y * x * y * x * d t ,
where v = x * + t y * x * and d v = y * x * d t .
Let us denote the operator 0 1 P x * + t y * x * d t as Q . It is easy to prove that Q 1 exists, given that
Γ x 0 Q I = Γ x 0 Q P x 0 Γ x 0 Q P x 0 Γ x 0 0 1 P x * + t y * x * P x 0 d t β ρ 0 1 x * + t y * x * x 0 d t β ρ 0 1 x * + t y * t x * + t x 0 t x 0 x 0 d t β ρ 0 1 1 t x * x 0 + t y * x 0 d t β ρ x * x 0 t t 2 2 0 1 + y * x 0 t 2 2 0 1 β ρ 1 2 R η + 1 2 2 3 β ρ R η = β ρ 2 R η + 2 3 β ρ R η = β ρ 2 2 3 β ρ = 1 3 < 1 .
Since Γ x 0 Q I < 1 , the Banach Lemma can be applied and the operator Q has an inverse. Taking Q y * x * = 0 and applying Q 1 , we determine that y * x * = 0 and, consequently, y * = x * . Hence, the solution is unique. □

5. Numerical Examples

In this section, we will apply the theoretical results to applied problems, some of which have already been cited in earlier studies.
Example 1
(see [17,19]). Consider the nonlinear integral equation P x = 0 , where
P x θ = x θ 1 + 1 2 0 1 θ c o s x t d t ,
with θ 0 , 1 and x D = B 0 , 2 X . This is a Chandrasekhar integral equation. These equations represent a category of integral equations used to tackle problems related to radiative transfer theory in a plane-parallel atmosphere. Additionally, these equations are applicable in other areas of research, such as traffic modeling, queuing theory, neutron transport, and the kinetic theory of gases. Let X = C 0 , 1 , the space of continuous functions defined on 0 , 1 with the norm
x = m a x θ 0 , 1 x θ .
The first and second derivatives of P are, respectively,
P x y θ = y θ 1 2 θ 0 1 s i n x t y t d t
and
P x y z θ = 1 2 θ 0 1 c o s x t y t z t d t ,
for y , z D .
The second derivative verifies
P x 1 2 = ρ , x D
and using the mean value theorem,
P x P y = P x x y
with
P x y z ϕ θ = 1 2 θ 0 1 s i n x t y t z t ϕ t d t , y , z , ϕ D .
Taking the norm in (24),
P x P y = P x x y P x x y
we consider the Lipschitz condition
P x P y = 1 2 x y , for x , y D
Thus, ϑ = 1 2 .
Choosing an initial estimate of the solution, x 0 t = 1.55 , we obtain
P x 0 = 1 2 0 1 θ c o s x 0 t d t 1 2 θ 0 1 c o s x 0 t d t 1 2 c o s 1.55
and
I P x 0 = 1 y θ + 1 2 0 1 θ s i n x 0 t d t 1 2 θ 0 1 s i n x 0 t d t 1 2 s i n 1.55 < 1 .
Therefore, by the Banach Lemma, Γ x 0 exists and
Γ x 0 1 1 I P x 0 = 2 2 s i n 1.55 = 1.99956 = β 0 .
Thus,
Γ x 0 P x 0 Γ x 0 P x 0 c o s 1.55 2 2 2 s i n 1.55 = c o s 1.55 2 s i n 1.55 = 0.02079 = η 0 , a 0 = ρ β 0 η 0 = 0.02078 < 3 4 , b 0 = ϑ β 0 η 0 2 = 4.32144 × 10 4 .
The auxiliary functions and recurrence relations of the scheme for some chosen values of parameter α are shown in Table 1 and Table 2.
Next, let us discretize the integral equation using Simpson’s quadrature, with the aim of transforming it into a large finite-dimensional problem. Let us denote the nodes as t i = i h for i = 0 , 1 , , n and the weights as p j = h 3 1 , 4 , 2 , , 2 , 4 , 1 R n + 1 , where h = 1 n is the step size and n is an even number of subintervals. Expressing x i = x t i , we obtain the (nonlinear) system of equations as follows:
x i 1 + t i 2 j = 0 n p j c o s x j = 0 ; i = 0 , 1 , , n .
Table 3 displays the results of a comparative study between a selected member of the family of methods (1) and three other iterative methods, including the Newton [1], Chun [28], and Jarratt [29] methods. The solution obtained by the schemes is x * = 1 , 0.9966 , , 0.6669 , 0.6634 T for n = 100 , where the number of iterations (iter) required to converge to the solution is presented, as well as the execution time (ex-time) in seconds required for convergence to the solution, which is determined as the average over 10 consecutive runs for each scheme. The stopping criterion is x k + 1 x k + f ( x k + 1 ) < ϵ , where x k + 1 x k represents the error estimate between two consecutive iterations, f ( x k + 1 ) denotes the residual error, and the error tolerance is set to ϵ = 10 10 . The approximated computational order of convergence (ACOC) (see [30]) quantifies the rate at which successive iterates approach the solution, providing an empirical estimate of the method’s order of convergence. It is employed to verify the validity of the theoretical convergence order p.
Example 2.
Consider the system of equations of size n = 100 with the following expression:
x i c o s 2 x i x 1 x 2 x 3 x 4 = 0 ; i = 1 , 2 , , n
with x * = ( 0.5149 , 0.5149 , , 0.5149 ) T and x i D = 1 , 1 X with the norm
F x = m a x i F i x .
The first derivative of P is
P x = 1 + 2 s i n 2 x i x 1 x 2 x 3 x 4 , i = j s i n 2 x i x 1 x 2 x 3 x 4 , i j , j 1 , 2 , 3 , 4 0 , i j , j 5 .
Choosing an initial estimate of the solution, x 0 = 0.25 , 0.25 , 0.25 , 0.25 T and denoting S = x 1 + x 2 + x 3 + x 4 , we obtain
I P x 0 = 2.397 > 1 .
Therefore, the system fails to meet the conditions established in Banach’s Lemma. For this example, the results obtained for n = 100 are presented in Table 4.
This iterative scheme is not limited to systems with standard algebraic or differential structures; rather, it extends naturally to a broader class of nonlinear operator equations, including those that include coefficients involving domain integrals, such as terms of the form f Ω x 2 , provided that certain conditions are met. These include that the operator is well defined in a suitable Banach space, the existence and continuity of its Fréchet derivative, and the satisfaction of regularity conditions such as the Lipschitz continuity. Integral terms are common in nonlinear and functional analysis, and their presence does not rule out the use of iterative methods, especially when the operator remains differentiable and bounded. Therefore, with appropriate analytical justification, such operators are compatible with standard semilocal and local convergence theories.

6. Conclusions

In this paper, we have studied the semilocal convergence of a family of iterative schemes in Banach spaces. The analysis is conducted by applying the Lipschitz condition to the second derivative. Using recurrence relations, the semilocal convergence theory for the iterative scheme is established. The key results are summarized in Theorem 1. Moreover, the existence and uniqueness domain of the solution is obtained, and it has been proven that the sequence x k converges to the solution. The R-order of convergence is at least two. Finally, numerical experiments were conducted to further validate our theoretical findings. Example 1, a Chandrasekhar integral equation, satisfies the conditions established in Theorem 1.
Future research based on these results will aim to extend the Banach Lemma to situations where the system of equations does not meet the conditions required by the lemma.

Author Contributions

Conceptualization, A.L. and E.M.; methodology, A.L. and E.M.; software, A.L.; validation, E.M.; formal analysis, A.L. and E.M.; writing—original draft, A.L.; writing—review and editing, E.M.; visualization, A.L.; supervision, E.M. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by Ayuda a Primeros Proyectos de Investigación (PAID-06-23), Vicerrectorado de Investigación de la Universitat Politècnica de València (UPV).

Data Availability Statement

Data are contained within the article.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Traub, J. Iterative Methods for the Solution of Equations, 2nd ed.; Chelsea Publishing Company: New York, NY, USA, 1982; pp. 11–12. [Google Scholar]
  2. Kantorovitch, L.V. Functional analysis and applied mathematics. Usp. Mat. Nauk. 1948, 3, 89–185. [Google Scholar]
  3. Polyak, B.T. Newton-Kantorovich method and its global convergence. J. Math. Sci. 2006, 133, 1513–1523. [Google Scholar] [CrossRef]
  4. Kantorovitch, L.V. The method of successive approximation for functional equations. Acta Math. 1939, 71, 63–97. [Google Scholar] [CrossRef]
  5. Kantorovitch, L.V. On Newton’s method for functional equations (Russian). Dokl. Akad. Nauk SSSR 1948, 59, 1237–1240. [Google Scholar]
  6. Kantorovitch, L.V. The majorant principle and Newton’s method (Russian). Dokl. Akad. Nauk SSSR 1948, 76, 17–20. [Google Scholar]
  7. Mysovskikh, I. On convergence of Newton’s method (Russian). Trudy Mat. Inst. Steklov. 1949, 28, 145–147. [Google Scholar]
  8. Ortega, J.M.; Rheinboldt, W.C. Iterative Solution of Nonlinear Equations in Several Variables; Academic Press: New York, NY, USA, 1970. [Google Scholar] [CrossRef]
  9. Rall, L.B. Computational Solution of Nonlinear Operator Equations; Robert E. Krieger: New York, NY, USA, 1979. [Google Scholar]
  10. Candela, V.; Marquina, A. Recurrence relations for rational cubic methods II: The Chebyshev method. Computing 1991, 12, 119–128. [Google Scholar] [CrossRef]
  11. Argyros, I.K.; Chen, D. Results on the Chebyshev method in Banach spaces. Proyecciones Antofagasta 1993, 45, 355–367. [Google Scholar] [CrossRef]
  12. Candela, V.; Marquina, A. Recurrence relations for rational cubic methods I: The Halley method. Computing 1990, 44, 169–184. [Google Scholar] [CrossRef]
  13. Kantorovitch, L.V.; Akilov, G.P. Functional Analysis; Pergamon Press Ltd.: Oxford, UK, 1982. [Google Scholar]
  14. Tapia, R.A. The Kantorovich theorem for Newton’s method. Am. Math. Mon. 1971, 78, 389–392. [Google Scholar] [CrossRef]
  15. Gutierrez, J.M.; Hernández, M.A. A family of Chebyshev-Halley type methods in Banach spaces. Bull. Aust. Math. Soc. 1997, 55, 113–130. [Google Scholar] [CrossRef]
  16. Hernández, M.A. Reduced recurrence relations for the Chebyshev method. J. Optim. Theory Appl. 1998, 98, 385–397. [Google Scholar] [CrossRef]
  17. Chen, L.; Gu, C.; Ma, Y. Semilocal Convergence for a Fifth-Order Newton’s Method Using Recurrence Relations in Banach Spaces. J. Appl. Math. 2011, 786306. [Google Scholar] [CrossRef]
  18. Wang, X.; Kou, J.; Gu, C. Semilocal convergence of a sixth-order Jarratt method in Banach spaces. Numer. Algorithms 2011, 57, 441–456. [Google Scholar] [CrossRef]
  19. Hueso, J.L.; Martinez, E. Semilocal convergence of a family of iterative methods in Banach spaces. Numer. Algorithms 2011, 67, 365–384. [Google Scholar] [CrossRef]
  20. Jaiswal, J.P. Semilocal convergence of a computationally efficient eighth-order method in Banach spaces under w-continuity condition. Iran. J. Sci. Technol. Trans. A Sci. 2018, 42, 819–826. [Google Scholar] [CrossRef]
  21. Cordero, A.; Maimó, J.G.; Martínez, E.; Torregrosa, J.R.; Vassileva, M.P. Semilocal Convergence of the Extension of Chun’s Method. Axioms 2021, 10, 161. [Google Scholar] [CrossRef]
  22. Argyros, C.; Argyros, I.; Shakhno, S.; Yarmola, H. On the Semi-Local Convergence of a Jarratt-Type Family Schemes for Solving Equations. Foundations 2022, 2, 234–241. [Google Scholar] [CrossRef]
  23. Wang, X.; Yang, Y.; Qin, Y. Semilocal convergence analysis of an eighth order iterative method for solving nonlinear systems. AIMS Math. 2023, 8, 22371–22384. [Google Scholar] [CrossRef]
  24. Cordero, A.; Ledesma, A.; Torregrosa, J.R.; Maimó, J.G. Design and dynamical behavior of a fourth order family of iterative methods for solving nonlinear equations. AIMS Math. 2024, 9, 8564–8593. [Google Scholar] [CrossRef]
  25. Martínez, E.; Ledesma, A. Local Convergence Study for an Iterative Scheme with a High Order of Convergence. Algorithms 2024, 17, 481. [Google Scholar] [CrossRef]
  26. Lang, S. Real and Functional Analysis, 3rd ed.; Springer: New York, NY, USA, 1993; pp. 346–350. [Google Scholar]
  27. Taylor, A.; Lay, D. Introduction to Functional Analysis, 2nd ed.; Robert E. Krieger Publishing Company, Inc.: Malabar, FL, USA, 1980; pp. 188–195. [Google Scholar]
  28. Chun, C. Construction of Newton-like iterative methods for solving nonlinear equations. Numer. Math. 2006, 104, 297–315. [Google Scholar] [CrossRef]
  29. Jarratt, P. Some fourth order multipoint iterative methods for solving equations. Math. Comput. 1966, 20, 434–437. [Google Scholar] [CrossRef]
  30. Cordero, A.; Torregrosa, J. Variants of Newton’s method using fifth-order quadrature formulas. Appl. Math. Comput. 2007, 190, 686–698. [Google Scholar] [CrossRef]
Table 1. Numerical results for Example 1 with starting condition x 0 = 1.55 .
Table 1. Numerical results for Example 1 with starting condition x 0 = 1.55 .
α = 0.05 α = 0.03 α = 0 α = 0.01 α = 0.03 α = 0.05
Convergence radius 0.19569 0.15481 0.13534 0.15402 0.21179 0.33590
Uniqueness radius 0.48498 0.52586 0.54533 0.52666 0.46888 0.34477
Table 2. Recurrence relations for α = 0.05 , 0 , 0.05 in Example 1.
Table 2. Recurrence relations for α = 0.05 , 0 , 0.05 in Example 1.
α k a k b k n k
0 0.02079 4.32144 × 10 4 0.02079
1 0.01850 3.42481 × 10 4 0.01807
0.05 2 0.01466 2.15106 × 10 4 0.01398
3 0.00921 8.48558 × 10 5 0.00857
4 0.00363 1.32051 × 10 5 0.00330
0 0.02079 4.32144 × 10 4 0.02079
1 0.01729 2.98918 × 10 4 0.01690
02 0.01196 1.43021 × 10 4 0.01142
3 0.00572 3.27412 × 10 5 0.00534
4 0.00131 1.71587 × 10 6 0.00119
0 0.02079 4.32144 × 10 4 0.02079
1 0.01967 3.87049 × 10 4 0.01919
0.05 2 0.01762 3.10484 × 10 4 0.01676
3 0.01413 1.99797 × 10 4 0.01311
4 0.00910 8.27341 × 10 5 0.00823
Table 3. Numerical performance of iterative methods for nonlinear equations for Example 1.
Table 3. Numerical performance of iterative methods for nonlinear equations for Example 1.
Method x k + 1 x k f ( x k + 1 ) IterACOCEx-Time
Newton 1.6009 × 10 18 2.7006 × 10 38 5 2.0000 186.6108
Method (1)α=0 3.7590 × 10 14 3.0992 × 10 14 3 3.9180 200.6128
Chun 1.2825 × 10 36 1.0292 × 10 36 4 4.0050 252.7789
Jarratt 5.5763 × 10 13 4.5976 × 10 13 3 3.9893 193.0262
Table 4. Numerical performance of iterative methods for nonlinear equations for Example 2.
Table 4. Numerical performance of iterative methods for nonlinear equations for Example 2.
Method x k + 1 x k f ( x k + 1 ) IterACOCEx-Time
Newton 5.0513 × 10 13 2.6278 × 10 26 5 2.0000 2.2428
Method (1)α=0 2.8382 × 10 42 7.7043 × 10 42 4 3.9992 3.2802
Chun 1.0218 × 10 30 2.7738 × 10 30 4 3.9922 3.1338
Jarratt 2.5793 × 10 44 7.0013 × 10 44 4 3.9994 3.4073
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Martínez, E.; Ledesma, A. Semilocal Convergence Domain of a Chandrasekhar Integral Equation. Symmetry 2025, 17, 767. https://doi.org/10.3390/sym17050767

AMA Style

Martínez E, Ledesma A. Semilocal Convergence Domain of a Chandrasekhar Integral Equation. Symmetry. 2025; 17(5):767. https://doi.org/10.3390/sym17050767

Chicago/Turabian Style

Martínez, Eulalia, and Arleen Ledesma. 2025. "Semilocal Convergence Domain of a Chandrasekhar Integral Equation" Symmetry 17, no. 5: 767. https://doi.org/10.3390/sym17050767

APA Style

Martínez, E., & Ledesma, A. (2025). Semilocal Convergence Domain of a Chandrasekhar Integral Equation. Symmetry, 17(5), 767. https://doi.org/10.3390/sym17050767

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop