Next Article in Journal
Rules for Fractional-Dynamic Generalizations: Difficulties of Constructing Fractional Dynamic Models
Next Article in Special Issue
The Modified Inertial Iterative Algorithm for Solving Split Variational Inclusion Problem for Multi-Valued Quasi Nonexpansive Mappings with Some Applications
Previous Article in Journal
Generalizations of Several Inequalities Related to Multivariate Geometric Means
Previous Article in Special Issue
On the Semilocal Convergence of the Multi–Point Variant of Jarratt Method: Unbounded Third Derivative Case
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

How to Obtain Global Convergence Domains via Newton’s Method for Nonlinear Integral Equations

by
José Antonio Ezquerro
* and
Miguel Ángel Hernández-Verón
Department of Mathematics and Computation, University of La Rioja, Calle Madre de Dios, 53, 26006 Logrono, Spain
*
Author to whom correspondence should be addressed.
Mathematics 2019, 7(6), 553; https://doi.org/10.3390/math7060553
Submission received: 3 May 2019 / Revised: 12 June 2019 / Accepted: 14 June 2019 / Published: 17 June 2019
(This article belongs to the Special Issue Iterative Methods for Solving Nonlinear Equations and Systems)

Abstract

:
We use the theoretical significance of Newton’s method to draw conclusions about the existence and uniqueness of solution of a particular type of nonlinear integral equations of Fredholm. In addition, we obtain a domain of global convergence for Newton’s method.

1. Introduction

Integral equations are very common in physics and engineering, since a lot of problems of these disciplines can be reduced to solve an integral equation. In general, we cannot solve integral equations exactly and are forced to obtain approximate solutions. For this, different numerical methods can be used. So, for example, iterative schemes based on the homotopy analysis method in [1], adapted Newton-Kantorovich schemes in [2] and schemes based on a combination of the Newton-Kantorovich method and quadrature methods in [3]. Besides, techniques based on using iterative methods are also interesting, since the theoretical significance of the methods allows drawing conclusions about the existence and uniqueness of solution of the equations. The use of an iterative method allows approximating a solution and, by analysing the convergence, proving the existence of solution, locating a solution and even separating such solution from other possible solutions by means of results of uniqueness. The theory of fixed point plays an important role in the development of iterative methods for approximating, in general, a solution of an equation and, in particular, for approximating a solution of an integral equation.
In this work, we pay attention to the study of nonlinear Fredholm integral equations with nonlinear Nemytskii operators of type
x ( s ) = ( s ) + λ a b K ( s , t ) H ( x ) ( t ) d t , s [ a , b ] , λ R ,
where ( s ) C [ a , b ] , kernel K ( s , t ) of integral equation is a known function in [ a , b ] × [ a , b ] , H is a Nemytskii operator [4] given by H : Ω C [ a , b ] C [ a , b ] , such that H ( x ) ( t ) = H ( x ( t ) ) and H : R R is a derivable real function, and x ( s ) C [ a , b ] is the unknown function to find.
It is common to use the Banach Fixed Point Theorem [5,6,7] to prove the existence of a unique fixed point of an operator and approximate it by the method of successive approximations. Moreover, global convergence for the method is obtained in the full space. For this, we use that the operator involved is a contraction.
Our main aim of this work is to do a study of integral Equation (1) from Newton’s method,
x n + 1 = x n [ F ( x n ) ] 1 F ( x n ) , n 0 , with x 0 given ,
that has quadratic convergence, superior to the convergence of the method of successive approximations, which is linear. This study is similar to that of the Fixed Point Theorem for the method of successive approximations. In addition, we obtain a domain of global convergence, B ( x ˜ , R ) = { x C [ a , b ] : x x ˜ < R } , with x ˜ C [ a , b ] , for Newton’s method. Also, we obtain a result of uniqueness of solution that separate the approximate solution from other possible solutions. To carry out this study, we develop a technique based on the use of auxiliary points, which allows obtaining domains of global convergence, locating solutions of (1) and domains of uniqueness of these solutions.
On the other hand, if H ( x ) = x , integral Equation (1) is linear and well-known, it is a Fredholm integral equation of the second kind, which is connected with the eigenvalue problem represented by the homogeneous equation
x ( s ) = λ a b K ( s , t ) x ( t ) d t , s [ a , b ] ,
and has non-trivial solutions x ( s ) 0 for the characteristic values or eigenvalues λ (the latter term is sometimes reserved to the reciprocals ν = 1 / λ ) of kernel K ( s , t ) and every non-trivial solution of (1) is called characteristic function or eigenfunction corresponding to characteristic value λ . If Equation (1) is nonlinear, our results allow doing a study of the equation based on the values of parameter λ , which is another important aim of our work.

2. Global Convergence and Uniqueness of Solution

If we are interested in proving the convergence of an iteration, we can usually follow three ways to do it: local convergence, semilocal convergence and global convergence. First, from some conditions on the operator involved, if we require conditions to the solution x * , we establish a local analysis of convergence and obtain a ball of convergence of the iteration, which, from the initial approximation x 0 lying in the ball, shows the accessibility to x * . Second, from some conditions on the operator involved, if we require conditions to the initial iterate x 0 , we establish a semilocal analysis of convergence and obtain a domain of parameters, which corresponds to the conditions required to the initial iterate, so that the convergence of iteration is guaranteed to x * . Third, from some conditions on the operator involved, the convergence of iteration to x * in a domain, and independently of the initial approximation x 0 , is established and global convergence is called. Observe that the three studies require conditions on the operator involved and requirement of conditions to the solution, to the initial approximation, or to none of these, is what determines the way of analysis.
The local analysis of the convergence has the disadvantage that it requires conditions on the solution and this is unknown. The global analysis of convergence, as a consequence of the absence of conditions on the initial approximations and the solution, is very specific for the operators involved.
In this paper, we focus our attention on the analysis of the global convergence of Newton’s method and, as a consequence, we obtain domains of global convergence for nonlinear integral Equation (1) and also locate a solution. For this, we obtain a ball of convergence, by using an auxiliary point, that contains a solution and guarantees the convergence of Newton’s method from any point of the ball.
Solving Equation (1) is equivalent to solving the equation F ( x ) = 0 , where F : Ω C [ a , b ] C [ a , b ] and
[ F ( x ) ] ( s ) = x ( s ) ( s ) λ a b K ( s , t ) H ( x ) ( t ) d t , s [ a , b ] , λ R , n N .
Then,
[ F ( x ) y ] ( s ) = y ( s ) λ a b K ( s , t ) [ H ( x ) y ] ( t ) d t = λ a b K ( s , t ) H ( x ( t ) ) y ( t ) d t .
As a consequence,
F ( x ) F ( y ) K x y ,
where K = | λ | S L , L is such that H ( x ) H ( y ) L x y , for all x , y Ω , and S = a b K ( s , t ) d t .
From the Banach lemma on invertible operators, it follows
Γ ˜ = [ F ( x ˜ ) ] 1 1 1 | λ | S H ( x ˜ ) = β , Γ ˜ F ( x ˜ ) x ˜ u + | λ | S H ( x ˜ ) 1 | λ | S H ( x ˜ ) = η .
provided that
| λ | S H ( x ˜ ) < 1 .
Next, we give some properties that are used later.
Lemma 1.
For operator (2), we have:
(a) 
Γ ˜ F ( x ) = Γ ˜ F ( x ˜ ) + ( x x ˜ ) + 0 1 Γ ˜ F ( x ˜ + t ( x x ˜ ) ) F ( x ˜ ) ( x x ˜ ) d t , with x Ω .
(b) 
F ( x n ) = 0 1 F ( x n 1 + t ( x n x n 1 ) ) F ( x n 1 ) ( x n x n 1 ) d t , with x n 1 , x n Ω .
As a consequence of item (b) of Lemma 1, it follows, for x n 1 , x n Ω ,
F ( x n ) K 2 x n x n 1 2 .
From the last result, and taking into account the parameters obtained previously, we analyze the first iteration of Newton’s method, what leads us to the convergence of the method.
If x 0 B ( x ˜ , R ) , then
Γ 0 = [ F ( x 0 ) ] 1 β 1 K β R = α , Γ 0 F ( x ˜ ) 1 1 K β R .
provided that
K β R < 1 .
Moreover, from item (a) of Lemma 1, it follows
x 1 x 0 Γ 0 F ( x ˜ ) Γ ˜ F ( x 0 ) < η + R + K β R 2 / 2 1 K β R = δ ,
and, from item (b) of Lemma 1, we have
x 1 x ˜ = Γ 0 F ( x 0 ) + F ( x 0 ) ( x ˜ x 0 ) Γ 0 F ( x ˜ ) Γ ˜ F ( x ˜ ) + K β R 2 / 2 1 K β R 2 η + K β R 2 2 ( 1 K β R ) ,
so that x 1 B ( x ˜ , R ) , provided that
2 η + K β R 2 2 ( 1 K β R ) R .
Observe now that condition (5) holds if
K β η 1 / 6 and R [ R , R + ] ,
where R = 1 1 6 K β η 3 K β and R + = 1 + 1 6 K β η 3 K β are the two real positive roots of quadratic equation
2 η 2 R + 3 K β R 2 = 0 .
After that, if we assume that
x n x n 1 < γ 2 n 2 x n 1 x n 2 ,
x n x ˜ < 2 η + K β R 2 2 ( 1 K β R ) R ,
where γ = K α δ / 2 , for all n 2 , and provided that condition (5) holds, it follows in the same way that
x n + 1 x n < γ 2 n 1 x n x n 1 , x n + 1 x ˜ < 2 η + K β R 2 2 ( 1 K β R ) R ,
so that (6) and (7) are true for all positive integers n by mathematical induction.
In addition, γ < 1 if
3 ( K β R ) 2 10 ( K β R ) + 2 ( 2 K β η ) > 0 ,
which is satisfied provided that
K β η 1 / 6 and R < 5 13 + 6 K β η 3 K β .
As a consequence, condition (4) holds. More precisely, we can establish the following result.
Lemma 2.
There always exists R > 0 , such that inequalities (4), (5) and (8) hold, if
(a) 
K β η 0 . 1547 and R R , 5 13 + 6 K β η 3 K β ,
(b) 
K β η [ 0 . 1547 , 1 / 6 ) and R [ R , R + ] ,
where R = 1 1 6 K β η 3 K β and R + = 1 + 1 6 K β η 3 K β .
Proof. 
First, we prove item (a) of Lemma 2. Observe that R < 5 13 + 6 K β η 3 K β , since K β η 0 . 1547 , so that R , 5 13 + 6 K β η 3 K β . Moreover, as K β η 0 . 1547 , we have 3 ( K β η ) 2 + 6 ( K β η ) 1 0 and, as a consequence, R + > 5 13 + 6 K β η 3 K β and R R , 5 13 + 6 K β η 3 K β [ R , R + ] , so that (5) and (8) hold.
Second, if K β η [ 0 . 1547 , 1 / 6 ) , then 3 ( K β η ) 2 + 6 ( K β η ) 1 0 and R + < 5 13 + 6 K β η 3 K β , so that R [ R , R + ] . Then, (5) and (8) hold.
Third, in both cases, K β R < 1 follows immediately, since R < 5 13 + 6 K β η 3 K β in items (a) and (b) of Lemma 2. □

2.1. Convergence

Now, we can establish the following result.
Theorem 1.
Suppose that K β η 1 / 6 and consider R > 0 satisfying item (a) or item (b) of Lemma 2 and such that B ( x ˜ , R ) Ω . If condition (3) holds, then Newtons’s method is well-defined and converges to a solution x * of F ( x ) = 0 in B ( x ˜ , R ) ¯ from every point x 0 B ( x ˜ , R ) .
Proof. 
From (6) and γ < 1 , we have x n + 1 x n < x n x n 1 , for all n N , so that sequence { x n + 1 x n } is strictly decreasing for all n N and, therefore, sequence { x n } is convergent. If x * = lim n x n , then F ( x * ) = 0 , by the continuity of F and F ( x n ) 0 when n . □
From Theorem 1, the convergence of Newton’s method to a solution of equation F ( x ) = 0 is guaranteed. Moreover, the best ball of location of the solution is B ( x ˜ , R ) and the biggest ball of convergence is B ( x ˜ , R + ) or B x ˜ , 5 13 + 6 K β η 3 K β , depending on the value of K β η is: K β η 0 . 1547 for the former and K β η [ 0 . 1547 , 1 / 6 ) for the latter.

2.2. Uniqueness of Solution

For uniqueness of solution, we establish the following result, where uniqueness of solution is proved in B ( x ˜ , R ) ¯ .
Theorem 2.
Under conditions of Theorem 1, solution x * of F ( x ) = 0 is unique in B ( x ˜ , R ) ¯ .
Proof. 
Assume that w * is another solution of F ( x ) = 0 in B ( x ˜ , R ) ¯ such that w * x * . If operator Q = 0 1 F ( w * + t ( x * w * ) ) d t is invertible, we have x * = w * , since Q ( w * x * ) = F ( w * ) F ( x * ) . Then, as
I Γ ˜ Q Γ ˜ 0 1 F ( x ˜ ) F ( w * + t ( x * w * ) ) d t β K 0 1 x ˜ ( w * + t ( x * w * ) ) d t = β K R < 1 ,
it follows that Q is invertible by the Banach lemma on invertible operators and uniqueness follows immediately. □
Notice that, from Theorems 1 and 3, the best ball of location of a solution of (1) is B ( x ˜ , R ) and the best ball of uniqueness of solution and the biggest ball of convergence is B x ˜ , 5 13 + 6 K β η 3 K β or B ( x ˜ , R + ) , depending on the value of K β η lies.
Once given the uniqueness of solution in the domain of existence of solution B ( x ˜ , R ) , we enlarge such domain from the following theorem.
Theorem 3.
Under conditions of Theorem 1, we have that the solution x * is unique in the domain B ( x ˜ , ϱ ) Ω , where ϱ = 2 K β R .
Proof. 
Assume that w * is another solution of F ( x ) = 0 in B ( x ˜ , ϱ ) Ω such that w * x * . Then, from (9), it follows
I Γ ˜ Q < β K 0 1 ( ( 1 t ) ϱ + t R ) d t = 1 .
and Q is again invertible by the Banach lemma on invertible operators.
Note that ϱ > 0 , since β K R < 1 , and uniqueness of solution is obtained in the ball of global convergence given in Theorem 1, since ϱ = 2 K β R 5 13 + 6 K β η 3 K β , R + .

3. Example

Now, we apply the last result to the following nonlinear integral equation:
x ( s ) = s 3 + 18 25 0 1 s 3 t 3 x ( t ) 2 d t , s [ 0 , 1 ] .
For Equation (10), we have λ = 18 / 25 and S = 0 1 s 3 t 3 d t = 1 / 4 with the max-norm. As H ( x ˜ ) ( t ) = x ˜ ( t ) 2 , then L = 2 . If we choose x ˜ ( s ) = s 3 , then condition (3) holds, since | λ | S H ( x ˜ ) = 9 / 25 < 1 . Moreover, β = 25 / 16 and η = 9 / 32 and K = | λ | S L = 9 / 25 , so that K β η = 0 . 1582 [ R , R + ] , where R = 0 . 4590 and R + = 0 . 7261 . Therefore, from Theorem 1, the convergence of Newton’s method to a solution of Equation (10) is guaranteed and the best ball of location of the solution is B ( s 3 , 0 . 4590 ) and the biggest ball of convergence is B ( s 3 , 0 . 7261 ) . Furthermore, from Theorem 3, it follows that the domain of uniqueness of solution is B ( s 3 , 3 . 0965 ) .
Next, we approximate a solution of Equation (10) by Newton’s method. After four iterations with stopping criterion x n x n 1 < 10 18 , n N , we obtain solution shown in Table 1, where errors x * x n and sequence F ( x n ) are also shown. Observe from the last sequence that solution shown in Table 1 is a good approximation of the solution of Equation (10). Finally, we observe in Figure 1 that solution shown in Table 1 lies within the domain of location of solution found above.

4. Study of the Integral Equation from Parameter λ

Next, we study the integral Equation (1) from the values of parameter λ .
First, we observe that K β η 1 / 6 if
6 | λ | S L x ˜ + | λ | S H ( x ˜ ) 1 | λ | S H ( x ˜ ) 2
and condition (3) holds.
Now, we analyze condition (11). Observe that (11) is satisfied if
  • H ( x ˜ ) 2 < 6 L H ( x ˜ ) and | λ | [ 0 , μ + ] , where
    μ + = ( 3 L x ˜ + H ( x ˜ ) ) + Δ S ( 6 L H ( x ˜ ) H ( x ˜ ) 2 )
    and Δ = 3 L ( 3 L x ˜ 2 + 2 x ˜ H ( x ˜ ) + 2 H ( x ˜ ) ) .
  • H ( x ˜ ) 2 > 6 L H ( x ˜ ) and | λ | [ 0 , μ + ] [ μ , + ) , where
    μ = ( 3 L x ˜ + H ( x ˜ ) ) Δ S ( 6 L H ( x ˜ ) H ( x ˜ ) 2 ) .
  • H ( x ˜ ) 2 = 6 L H ( x ˜ ) and | λ | 1 2 S ( 3 L x ˜ + H ( x ˜ ) ) .
Second, once x ˜ is fixed, we have two chances: K β η 0 . 1547 or K β η [ 0 . 1547 , 1 / 6 ) . If first holds, then R R , 5 13 + 6 K β η 3 K β and, if second does, then R [ R , R + ] .
Finally, as condition (3) is satisfied, then Newtons’s method is well-defined and converges to a solution x * of F ( x ) = 0 in B ( x ˜ , R ) ¯ from every point x 0 B ( x ˜ , R ) by Theorem 1.

5. Application

Now, we apply the last study to the following particular Davis-type integral Equation [8]:
x ( s ) = s + λ 0 1 G ( s , t ) x ( t ) 2 d t , λ R , s [ 0 , 1 ] ,
where the kernel of (12) is a Green’s function defined as follows:
G ( s , t ) = ( 1 s ) t , t s , s ( 1 t ) , s t .
One can show that the function x ( s ) that satisfied Equation (12) is any solution of the differential equation
x ( s ) + λ x ( s ) 2 = 0 ,
that also satisfies the two-point boundary condition: x ( 0 ) = 0 , x ( 1 ) = 1 .
For Equation (12), we have S = 0 1 G ( s , t ) d t = 1 / 8 with the max-norm and H ( x ˜ ) ( t ) = x ˜ ( t ) 2 . Therefore, L = 2 and condition (3) is reduced to | λ | < 4 / x ˜ . In addition,
H ( x ˜ ) 2 = 4 x ˜ 2 < 12 x ˜ 2 = 6 L H ( x ˜ )
and, as a consequence,
| λ | μ + = ( 6 x ˜ s + 2 x ˜ ) + 12 3 x ˜ s 2 + 2 x ˜ s x ˜ + x ˜ 2 x ˜ 2 .
After that, we choose x ˜ ( s ) = s and hence μ + = 2 ( 1 + 3 ) = 1 . 4641 , so that | λ | 1 . 4641 , that satisfies condition (3). In this case, from Theorem 1, we can guarantee the convergence of Newton’s method to a solution of Equation (12) with λ such that | λ | 1 . 4641 Moreover, once λ is fixed, depending on the value of K β η , we can obtain the best ball of location of solution and the biggest ball of convergence.
Observe that we cannot apply Newton’s method directly, since we do not know the inverse operator that is involved in the algorithm of Newton’s method. Then, we use a process of discretization to transform (12) into a finite dimensional problem. For this, we use a Gauss–Legendre quadrature formula to approximate the integral of (12),
0 1 ϕ ( t ) d t j = 1 m w j ϕ ( t j ) ,
where the m nodes t j and weights w j are known.
Next, we denote the approximations x ( t i ) by x i , with i = 1 , 2 , , m , so that (12) is equivalent to the nonlinear system given by
x j = t j + λ k = 1 m a j k x k 2 , k = 1 , 2 , , m ,
where
a j k = w k ( 1 t j ) t k , k j , w k ( 1 t k ) t j , k > j .
After that, we write system (13) compactly in matrix form as
F ( x ) x v λ A y = 0 , F : R m R m ,
where
x = x 1 , x 2 , , x m t , v = t 1 , t 2 , , t m t , A = a j k j , k = 1 m , y = x 1 2 , x 2 2 , , x m 2 t .
Choose m = 8 , λ = 7 / 5 , x ˜ = v and hence K = 0 . 2471 , β = 1 . 2179 , η = 0 . 0665 and K β η = 0 . 0200 As K β η < 0 . 1547 , it follows, from Theorem 1, that the best ball of location of solution is B ( v , 0 . 0686 ) ¯ and the biggest ball of convergence is B ( v , 1 . 5259 ) .
If the starting point for Newton’s method is x 0 = v , the method converges to the solution x * = ( x 1 * , x 2 * , , x 8 * ) t of system (14), which is shown in Table 2, after four iterations with stopping criterion x n x n 1 < 10 18 , n N .
Moreover, errors x * x n and sequence { F ( x n ) } are shown in Table 3. Observe then that vector shown in Table 2 is a good approximation of a solution of (14).
Furthermore, as a solution of (12) satisfies x ( 0 ) = 0 and x ( 1 ) = 1 , if values of Table 2 are interpolated, an approximated solution is obtained, which is painted in Figure 2. Notice that this approximated solution lies in the domain of location of solution B ( v , 0 . 0686 ) ¯ which is obtained from Theorem 1.

6. Conclusions

Following the idea of the Fixed Point Theorem for the method of successive approximations, we do an analysis for Newton’s method, use the theoretical significance of the method to prove the existence and uniqueness of solution of a particular type of nonlinear integral equations of Fredholm and, in addition, obtain a domain of global convergence for the method that allows locating a solution and separating it from other possible solutions. For this, we use a technique based on using auxiliary points. Moreover, we present a study of the nonlinear equations which is based on the real parameter involved in the equation.

Author Contributions

The contributions of the two authors have been similar. Both authors have worked together to develop the present manuscript.

Funding

This research was partially supported by Ministerio de Ciencia, Innovación y Universidades under grant PGC2018-095896-B-C21.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Awawdeh, F.; Adawi, A.; Al-Shara, S. A numerical method for solving nonlinear integral equations. Int. Math. Forum 2009, 4, 805–817. [Google Scholar]
  2. Nadir, M.; Khirani, A. Adapted Newton-Kantorovich method for nonlinear integral equations. J. Math. Stat. 2016, 12, 176–181. [Google Scholar] [CrossRef]
  3. Saberi-Nadja, J.; Heidari, M. Solving nonlinear integral equations in the Urysohn form by Newton-Kantorovich-quadrature method. Comput. Math. Appl. 2010, 60, 2018–2065. [Google Scholar]
  4. Matkowski, J. Functional Equations and Nemytskii Operators. Funkc. Ekvacioj 1982, 25, 127–132. [Google Scholar]
  5. Berinde, V. Iterative Approximation of Fixed Point; Springer: New York, NY, USA, 2005. [Google Scholar]
  6. Ragusa, M.A. Local Hölder regularity for solutions of elliptic systems. Duke Math. J. 2002, 13, 385–397. [Google Scholar] [CrossRef]
  7. Wang, H.; Zhang, L.; Wang, X. Fixed point theorems for a class of nonlinear sum-type operators and application in a fractional differential equation. Bound. Value Probl. 2018, 2018, 140. [Google Scholar] [CrossRef]
  8. Davis, H.T. Introduction to Nonlinear Differential and Integral Equations; Dover: New York, NY, USA, 1962. [Google Scholar]
Figure 1. Approximated solution x * ( s ) of (10) and domain of location of solution.
Figure 1. Approximated solution x * ( s ) of (10) and domain of location of solution.
Mathematics 07 00553 g001
Figure 2. Solution x * of system (14) and domain of location of solution.
Figure 2. Solution x * of system (14) and domain of location of solution.
Mathematics 07 00553 g002
Table 1. Approximated solution x * ( s ) of (10), absolute errors and { F ( x n ) } .
Table 1. Approximated solution x * ( s ) of (10), absolute errors and { F ( x n ) } .
n x n ( s ) x * x n F ( x n )
0 s 3 8 . 4715 × 10 2 7 . 2 × 10 2
1 ( 1 . 0841121495327102 ) s 3 6 . 0365 × 10 4 5 . 0938 × 10 4
2 ( 1 . 0847157717628998 ) s 3 3 . 1090 × 10 8 2 . 6233 × 10 8
3 ( 1 . 0847158028530592 ) s 3 8 . 2478 × 10 17 6 . 9595 × 10 17
4 ( 1 . 0847158028530593 ) s 3
Table 2. Numerical solution x * of system (14) with λ = 7 / 5 .
Table 2. Numerical solution x * of system (14) with λ = 7 / 5 .
i x i * i x i *
10.02267000…50.65888692…
20.11607746…60.82291926…
30.27057507…70.93276524…
40.46275932…80.98797444…
Table 3. Absolute errors and { F ( x n ) } .
Table 3. Absolute errors and { F ( x n ) } .
n x * x n F ( x n )
0 6 . 7169 × 10 2 9 . 6624 × 10 1
1 6 . 4734 × 10 4 5 . 3956 × 10 4
2 6 . 0570 × 10 8 5 . 0516 × 10 8
3 5 . 4063 × 10 16 4 . 5077 × 10 16

Share and Cite

MDPI and ACS Style

Ezquerro, J.A.; Hernández-Verón, M.Á. How to Obtain Global Convergence Domains via Newton’s Method for Nonlinear Integral Equations. Mathematics 2019, 7, 553. https://doi.org/10.3390/math7060553

AMA Style

Ezquerro JA, Hernández-Verón MÁ. How to Obtain Global Convergence Domains via Newton’s Method for Nonlinear Integral Equations. Mathematics. 2019; 7(6):553. https://doi.org/10.3390/math7060553

Chicago/Turabian Style

Ezquerro, José Antonio, and Miguel Ángel Hernández-Verón. 2019. "How to Obtain Global Convergence Domains via Newton’s Method for Nonlinear Integral Equations" Mathematics 7, no. 6: 553. https://doi.org/10.3390/math7060553

APA Style

Ezquerro, J. A., & Hernández-Verón, M. Á. (2019). How to Obtain Global Convergence Domains via Newton’s Method for Nonlinear Integral Equations. Mathematics, 7(6), 553. https://doi.org/10.3390/math7060553

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