Abstract
In this study, we developed a new faster iterative scheme for approximate fixed points. This technique was applied to discuss some convergence and stability results for almost contraction mapping in a Banach space and for Suzuki generalized nonexpansive mapping in a uniformly convex Banach space. Moreover, some numerical experiments were investigated to illustrate the behavior and efficacy of our iterative scheme. The proposed method converges faster than symmetrical iterations of the S algorithm, Thakur algorithm and algorithm. Eventually, as an application, the nonlinear Volterra integral equation with delay was solved using the suggested method.
Keywords:
fixed-point methodology; convergence result; stability analysis; Volterra integral equation; delay term MSC:
47H10; 47H09; 54H25
1. Introduction
Many problems in mathematics and other fields of science can be modeled into an equation with a suitable operator. The existence of the solution to this equation equates to the existence of the fixed point (FP) of the appropriate operator. Due to the large number of recent, valuable studies that include the FP method, these points have become the mainstay for nonlinear analysis due to the ease and smoothness of this method, in addition to the numerous and exciting applications in economics, biology, chemistry, game theory, engineering, physics, etc. [1,2,3,4,5,6].
A very important branch is the involvement of FPs in approximation by symmetrical algorithms. Numerous problems such as convex feasibility problems, convex optimization problems, monotone variational inequalities and image restoration problems can be thought of as FP problems of nonexpansive mappings; hence, approximating them has a range of specialized applications.
In this paper, the symbols , , , , ⇀, ⟶ and refer to the Banach space, a nonempty closed convex subset (CCS) of an the set of nonnegative real numbers, the set of natural numbers, weak convergence, strong convergence and the set of all FPs (the point so that an equation is true).
There are two main categories that can be used to group the main concepts of FP theory. Finding the prerequisites and requirements necessary for an operator to own fixed points is the first step. Another option is to locate these fixed points using certain schematic methods. The first category is known formally as the existence part, while the second category is known as the computation or approximation part. Studying the behaviors of FPs, such as stability and data dependence, is an essential but less well-known topic of FP theory.
The class of weak contractions that appropriately covers the class of Zamfirescu operators [7] was supplied by Berinde in [8]. Similarly, many authors also refer to this class of mappings as almost contraction mappings (ACMs).
Definition 1.
A mapping is called ACM if the following inequality is true:
where and
In 2003, ACM (1) was generalized by Imoru and Olantiwo [9] by replacing the constant with a strictly increasing continuous function with as follows:
Definition 2.
A mapping is called contractive-like if there exist a constant and a strictly increasing continuous function with such that
The analysis of the performance and behavior of algorithms that make significant contributions to real-world applications is one of the key trends in FP techniques. Therefore, in order to enhance the functionality and convergence behavior of algorithms for nonexpansive mappings, several authors tended to develop numerous symmetrical iterative schemes for approximating FPs, for example, Mann [10], Ishikawa [11], Noor [12], Argawal et al. [13], Abbas and Nazir [14] and HR [15,16].
Let and be sequences in ; the following procedures are known as the S algorithm [13], Picard-S algorithm [17], Thakur algorithm [18] and algorithm [19]:
Analytically and numerically, for contractive-like mappings, the authors showed that the iterative technique (6) converges faster than those of Karakaya et al. [20] and Thakur et al. [18], respectively. Consequently, Iteration (6) converges faster than (3), (4) and (5).
On the other hand, nonlinear integral Equations (NIEs) are used to explain mathematical models that derive from mathematical physics, engineering, economics, biology, etc. In particular, NIEs are produced by boundary value problems and mathematical modeling of the spatiotemporal dynamics of the epidemic. Recently, many authors have used iterative methods to solve NIEs; for instance, see [21,22,23,24,25,26]. The efficiency and effectiveness of iterative methods are determined by several factors, the most important of which are speed, stability and reliability. Many researchers and writers have studied these factors using the fixed-point method. For more details, see [27,28].
Continuing on the same approach, in this paper, we introduce the convergence and stability results for ACMs and Suzuki generalized nonexpansive mappings (SGNMs) in a BS and a uniformly convex Banach space (UCBS) in the following faster iterative scheme:
where and are sequences in Some numerical examples are given to illustrate that the considered iteration converges faster than the iterations of the S algorithm, Thakur algorithm and algorithm with appropriate parameters. Ultimately, the proposed method is implicated in finding the solution to a nonlinear Volterra integral equation with delay.
2. Preliminary Work
In this section, we provide some definitions and lemmas that will be helpful in the sequel.
Definition 3.
A mapping is called an SGNM if
Definition 4.
A BS Ω is called a uniformly convex if for each there exists , such that for satisfying , and we have
Definition 5.
A BS Ω is considered to satisfy Opial’s condition if for any sequence in Ω such that implies
for all where .
Definition 6.
Assume that is a bounded sequence in For , we set
The asymptotic radius and center of relative to Ω are described as
The asymptotic center of relative to Ω is defined by
Clearly, contains one single point in a UCBS.
Definition 7.
([29]). Let and { be nonnegative real sequences converging to σ and κ, respectively. If there exist such that , then we have the following possibilities:
- If then converges to σ faster than does to
- If then the two sequences have the same rate of convergence.
Definition 8.
([30]). A mapping is said to be satisfy Condition if the inequality
is true, for all where
Proposition 1
([31]). For a self-mapping we have
- ℑ is an SGNM if ℑ is nonexpansive.
- ℑ is a quasi-nonexpansive mapping if ℑ is an SGNM with a nonempty FP set.
- If ℑ is an SGNM, then the inequality below holds
Lemma 1.
([31]). Assume that Θ is any subset of a BS which satisfies Opial’s condition. Let be an SGNM. If and then is demiclosed at zero and .
Lemma 2.
([31]). If is an SGNM, then it owns a FP provided that Θ is a weakly compact convex subset of a BS
Lemma 3.
([29]). Let and be nonnegative real sequences such that
if and then
Lemma 4.
([32]). Let and be nonnegative real sequences such that
if and then
Lemma 5.
([33]). Let Ω be a UCBS and be a sequence such that for all Assume that and are two sequences in Ω such that for some
Then
3. Rate of Convergence
In this part, we demonstrate analytically that for ACMs, our iterative method (7) converges faster than the iterative method in (6) in the sense of Berinde [29].
Theorem 1.
Let Θ be a nonempty CCS of a BS Ω and be a ACM with If is the iterative sequence given by (7) with and . Then
Proof.
Let using (7), one has
As and for all then Thus, (11) takes the form
From (12), we deduce that
It follows from (13) that
From the definition of and , we have Since for all the inequality (14) can be written as
Letting in (15), we get , i.e.,
For uniqueness. Let such that hence
which is a contradiction, that is, □
Theorem 2.
4. Convergence Results
In this section, we provide some convergence results of our iteration scheme (7) for the SGNM in the setting of UCBSs. First, we prove the following lemmas:
Lemma 6.
Let Θ be a nonempty CCS of a BS Ω and be an SGNM with If is the iterative sequence proposed by (7), then exists, for each
Proof.
Let and By Proposition 1, we have
From (7), one has
Lemma 7.
Let be a nonempty CCS of a UCBs Ω and be an SGNM If is the iterative sequence given by (7), then if and only if is bounded and
Proof.
Let and Due to Lemma 6, is bounded and exists. Set
Based on Proposition 1 one can write
Hence,
As from (22), we get
which leads to
Applying (20), we have
Conversely, let be a bounded and Consider then by Proposition 1 and Definition 6, we have
which implies that Since is a uniformly convex and has exactly one point, then we have □
Theorem 3.
Let be a sequence iterated by (7) and let Θ and ℑ be defined as in Lemma 7. Then, if Λ satisfies Opial’s condition and .
Proof.
Assume that due to Lemma 6, exists.
Next, we show that has a weak sequential limit in In this regard, consider with and for all From Lemma 7, we get Using Lemma 1 and since is demiclosed at 0, we have which implies that Similarly
Now, if then by Opial’s condition, we get
which is a contradiction; hence, and □
Theorem 4.
Let be a sequence iterated by (7). Furthermore, let be a nonempty CCS of a UCBS Ω and be an SGNM. Then,
Proof.
Due to Lemma 2 and 7, and Since is compact, then there exists a subsequence so that for any
From Proposition 1 one has
Letting we get that is, From Lemma 6, we conclude that exists for each therefore □
Theorem 5.
Let be a sequence iterated by (7) and let Θ and ℑ be defined as in Lemma 7. Then, if and only if where
Proof.
It is clear that the necessary condition is satisfied. Let
For Lemma 6, exists for each which leads to exists. Hence
Now, we claim that is a Cauchy sequence in Since for every there exists such that
Therefore
Thus, is a Cauchy sequence in Since is closed, then there exists such that As Therefore, and this completes the proof. □
5. Stability Results
In 1987, Harder [34] rigorously examined the idea of stability of an FP iteration process in her Ph.D. thesis as follows:
Definition 9.
Let be a self-mapping and be a FP iteration so that converges to For arbitrary sequence in define
Then, the FP iteration method is called ℑ-stable if the assertion below holds
Several writers have lately examined the idea of stability in Definition 9 for various classes of contraction mappings; for example, see [35]. Since the sequence is arbitrarily chosen, Berinde pointed out in [1] that the concept of stability in Definition 9 is not precise. To overcome this restriction, the same author noted that if were approximate sequences of , then the definition would make sense. As a result, any iterative process will be weakly stable if it is stable, but the converse is not true in general.
Definition 10.
([1]). A sequence is called an approximate sequence of if for any there is so that
Definition 11.
([1]). Let be an iterative process defined for as
where is a given mapping. Suppose that converges to a FP of ℑ and for any approximate sequence of
then, Equation (25) is called weakly stable with respect to or weakly ℑ-stable.
The following theorem demonstrates the stability of our iteration approach (7).
Theorem 6.
Proof.
Let be a chosen sequence and be a sequence generating by (7) such that with as Consider
To prove ℑ is stable, it is sufficient to show that
Since , then Therefore, all assumptions of Lemma 3 hold, consequently , i.e., .
Conversely, let then
passing , we obtain This finishes the proof. □
The following example supports Theorem 6.
Example 1.
Assume that and is a BS equipped with the usual norm. Define a mapping by Clearly, 0 is a unique FP of ℑ and ℑ fulfills (7) with and
Next, we show that the proposed algorithm (7) is ℑ-stable. In this regard, assume that and then by (7), one has
Put Clearly, for each and Due to Lemma 3, It is easy to see that
Now, consider for each , we have
which implies that Hence, the two sequences and are equivalent.
Finally, assume that is the sequence associated with the iterative sequence then, we have
Hence, the proposed algorithm (7) is ℑ-stable.
6. Numerical Examples
In this section, we provide illustrative examples to assess the convergence of iteration (7) in comparison to some of the most popular iterative schemes in the literature.
Example 2.
Assume that and where is a subset of Ω equipped with the norm Define a mapping by
It is clear that ℑ owns a unique FP; it is . Now, we shall show that ℑ is a contractive-like mapping and, hence, an ACM. In this regard, we define the function by Obviously, ξ is a strictly increasing continuous function with If we have
and
Analogously, if one has
and
After that, we discuss the cases below:
Based on the above cases, we conclude that condition (7) is satisfied. Hence, ℑ is a contractive-like mapping.
Example 3.
Assume that is a BS equipped with the usual norm and Define a mapping by
To prove that ℑ does not satisfy Condition (C), we take and then
But
Hence, ℑ does not satisfy Condition (C).
Now, to show that ℑ is an SGNM, we consider following cases:
- (I)
- If we get
- (II)
- If and we obtain
- (III)
- If and we have
- If we can write
Hence, ℑ is an SGNM and has a unique FP 3.
Numerically, by using MATLAB R2015a, we show that our iterative scheme (7) converges faster than both iterations (5) and (6) as follows:
Let , , and be a mapping described as
Remark 1.
The two main metrics used to evaluate the efficiency and success of the iterative process are time and the number of repetitions. saves time and effort when strong convergence is easily attained with the fewest repetitions in various optimization and variational inequality problems. The tables and figures above make it clear that our strategy is effective, and our algorithm acts properly when compared to other more sober iterations in this direction.
7. Solving a Nonlinear Integral Equation with Delay
In this section, we apply iteration (7) to determine the existence of the solution to the following nonlinear Volterra equation with delay:
with the condition
where and . Clearly, the space is a BS, where the norm is described as and is the set of all continuous functions defined on
Th following theorem is the main result in this part:
Theorem 7.
Suppose that Θ is a nonempty CCS of a BS ℶ and is a sequence generated by (7) with Let be an operator described as
with Assume that the following statements are true:
- the functions and are continuous;
- there exists a constant so thatfor all and
- for each
Proof.
First, we prove that ℑ has a FP by using the Banach contraction principle. Recall that
Next, for each we can write
Since we conclude that the operator ℑ has a unique FP because it is a contraction. Hence, the problem (28) with (29) has a unique solution
Finally, we show that For each one has
Hence,
8. Conclusion and Open Discussions
The FPs of contractive-like mappings were approximated in this work using a four-step iterative method. It has been shown analytically that for contractive-like mappings, the new iterative technique converges faster than the iterative approaches (6). Furthermore, we have demonstrated numerically that our iterative method converges faster than numerous well-known iterative schemes, such as (5) and (6) for ACMs. Similarly, the stability result of the iterative scheme (7) was also obtained. Moreover, some weak and strong convergence results are proved for SGNMs in UCBSs. Further, illustrative examples were investigated to support our results. The considered iteration was applied to determine the existence of a solution to a nonlinear Volterra integral equation. Ultimately, we identified the following as potential future work:
- The variational inequality problem can be solved using our iteration (1) if we define the mapping ℑ in a Hilbert space endowed with an inner product space. This problem can be described as: find such thatwhere is a nonlinear mapping. In several disciplines, including engineering mechanics, transportation, economics and mathematical programming, variational inequalities are a crucial and indispensable modeling tool; see [36,37] for more details.
- Our methodology can be extended to include gradient and extra-gradient projection techniques, which are crucial for locating saddle points and resolving a variety of optimization-related issues; see [38].
- We can accelerate the convergence of the proposed algorithm by adding shrinking projection and CQ terms. These methods stimulate algorithms and improve their performance to obtain strong convergence; for more details, see [39,40,41,42].
- If we consider the mapping ℑ as an -inverse strongly monotone and the inertial term is added to our algorithm, then we have the inertial proximal point algorithm. This algorithm is used in many applications such as monotone variational inequalities, image restoration problems, convex optimization problems and split convex feasibility problems, see [43,44]. For more accuracy, these problems can be expressed as mathematical models such as machine learning and the linear inverse problem.
- In addition, second-order differential equations and fractional differential equations, which Green’s function can be used to transform into integral equations, can be solved using our approach. Therefore, they are simple to treat and resolve using the same method as in Section 7.
Author Contributions
H.A.H. contributed to conceptualization and writing the theoretical results; D.A.K. contributed to conceptualization, writing and editing. All authors have read and agreed to the published version of the manuscript.
Funding
This research received no external funding.
Data Availability Statement
The data used to support the findings of this study are available from the corresponding author upon request.
Conflicts of Interest
The authors declare no conflict of interest.
Abbreviations
| FPs | Fixed points |
| BSs | Banach spaces |
| CCS | Closed convex subset |
| ⇀ | Weak convergence |
| ⟶ | Strong convergence |
| ACMs | Almost contraction mappings |
| NIEs | Nonlinear integral equations |
| SGNMs | Suzuki generalized nonexpansive mappings |
| UCBSs | Uniformly convex Banach spaces |
References
- Berinde, V. Iterative Approximation of Fixed Points; Springer: Berlin/Heidelberg, Germany, 2007. [Google Scholar]
- Karapınar, E.; Abdeljawad, T.; Jarad, F. Applying new fixed point theorems on fractional and ordinary differential equations. Adv.Differ. Equ. 2019, 2019, 1–25. [Google Scholar] [CrossRef]
- Khan, S.H. A Picard-Mann hybrid iterative process. Fixed Point Theory Appl. 2013, 2013, 1–10. [Google Scholar] [CrossRef]
- Phuengrattana, W.; Suantai, S. On the rate of convergence of Mann, Ishikawa, Noor and SP-iterations for continuous functions on an arbitrary interval. J. Comput. Appl. Math. 2011, 235, 3006–3014. [Google Scholar] [CrossRef]
- Karahan, I.; Ozdemir, M. A general iterative method for approximation of fixed points and their applications. Adv. Fixed Point Theory 2013, 3, 510–526. [Google Scholar]
- Chugh, R.; Kumar, V.; Kumar, S. Strong convergence of a new three step iterative scheme in Banach spaces. Am. J. Comp. Math. 2012, 2, 345–357. [Google Scholar] [CrossRef]
- Zamfirescu, T. Fixed point theorems in metric spaces. Arch. Math. 1972, 23, 292–298. [Google Scholar] [CrossRef]
- Berinde, V. On the approximation of fixed points of weak contractive mapping. Carpath. J. Math. 2003, 19, 7–22. [Google Scholar]
- Imoru, C.O.; Olantiwo, M.O. On the stability of Picard and Mann iteration processes. Carpath. J. Math. 2003, 19, 155–160. [Google Scholar]
- Mann, W.R. Mean value methods in iteration. Proc. Am. Math. Soc. 1953, 4, 506–510. [Google Scholar] [CrossRef]
- Ishikawa, S. Fixed points by a new iteration method. Proc. Am. Math. Soc. 1974, 44, 147–150. [Google Scholar] [CrossRef]
- Noor, M.A. New approximation schemes for general variational inequalities. J. Math. Anal. Appl. 2000, 251, 217–229. [Google Scholar] [CrossRef]
- Agarwal, R.P.; Regan, D.O.; Sahu, D.R. Iterative construction of fixed points of nearly asymptotically nonexpansive mappings. J. Nonlinear Convex Anal. 2007, 8, 61–79. [Google Scholar]
- Abbas, M.; Nazir, T. A new faster iteration process applied to constrained minimization and feasibility problems. Math. Vesn. 2014, 66, 223–234. [Google Scholar]
- Hammad, H.A.; Rehman, H.U.; De la Sen, M. A novel four-step iterative scheme for approximating the fixed point with a supportive application. Inf. Sci. Lett. 2021, 10, 333–339. [Google Scholar]
- Hammad, H.A.; Rehman, H.U.; De la Sen, M. A New four-step iterative procedure for approximating fixed points with Application to 2D Volterra integral equations. Mathematics 2022, 10, 4257. [Google Scholar] [CrossRef]
- Gursoy, F.; Karakaya, V. A Picard-S hybrid type iteration method for solving a differential equation with retarded argument. arXiv 2014, arXiv:1403.2546v2. [Google Scholar]
- Thakur, B.S.; Thakur, D.; Postolache, M. A new iterative scheme for numerical reckoning fixed points of Suzuki’s generalized nonexpansive mappings. Appl. Math. Comput. 2016, 275, 147–155. [Google Scholar] [CrossRef]
- Ullah, K.; Arshad, M. Numerical reckoning fixed points for Suzuki’s generalized nonexpansive mappings via new iteration process. Filomat 2018, 32, 187–196. [Google Scholar] [CrossRef]
- Karakaya, V.; Atalan, Y.; Dogan, K.; Bouzara, N.E.H. Some fixed point results for a new three steps iteration process in Banach spaces. Fixed Point Theory 2017, 18, 625–640. [Google Scholar] [CrossRef]
- Maleknejad, K.; Torabi, P. Application of fixed point method for solving Volterra-Hammerstein integral equation. U.P.B. Sci. Bull. Ser. A 2012, 74, 45–56. [Google Scholar]
- Hammad, H.A.; Agarwal, P.; Momani, S.; Alsharari, F. Solving a fractional-Order differential equation using rational symmetric contraction mappings. Fractal Fract. 2021, 5, 159. [Google Scholar] [CrossRef]
- Wazwaz, A.M. A reliable treatment for mixed Volterra-Fredholm integral equations. Appl. Math. Comput. 2002, 127, 405–414. [Google Scholar] [CrossRef]
- Atlan, Y.; Karakaya, V. Iterative solution of functional Volterra-Fredholm integral equation with deviating argument. J. Nonlinear Convex Anal. 2017, 18, 675–684. [Google Scholar]
- Hammad, H.A.; Zayed, M. Solving systems of coupled nonlinear Atangana–Baleanu-type fractional differential equations. Bound Value Probl. 2022, 2022, 101. [Google Scholar] [CrossRef]
- Ofem, A.E.; Igbokwe, D.I. An efficient iterative method and its applications to a nonlinear integral equation and a delay differential equation in Banach spaces. Turk. J. Ineq. 2020, 4, 79–107. [Google Scholar]
- Ali, F.; Ali, J. Convergence, stability, and data dependence of a new iterative algorithm with an application. Comput. Appl. Math. 2020, 39, 1–15. [Google Scholar] [CrossRef]
- Hudson, A.; Joshua, O.; Adefemi, A. On modified Picard-S-AK hybrid iterative algorithm for approximating fixed point of Banach contraction map. MathLAB J. 2019, 4, 111–125. [Google Scholar]
- Berinde, V. Picard iteration converges faster than Mann iteration for a class of quasicontractive operators. Fixed Point Theory Appl. 2004, 2, 97–105. [Google Scholar]
- Senter, H.F.; Dotson, W. Approximating fixed points of nonexpansive mapping. Proc. Am. Math. Soc. 1974, 44, 375–380. [Google Scholar] [CrossRef]
- Suzuki, T. Fixed point theorems and convergence theorems for some generalized nonexpansive mappings. J. Math. Anal. Appl. Math. 2008, 340, 1088–1095. [Google Scholar] [CrossRef]
- Soltuz, S.M.; Grosan, T. Data dependence for Ishikawa iteration when dealing with contractive like operators. Fixed Point Theory Appl. 2008, 2008, 242916. [Google Scholar] [CrossRef]
- Schu, J. Weak and strong convergence to fixed points of asymptotically nonexpansive mappings. Bull. Aust. Math. Soc. 1991, 43, 153–159. [Google Scholar] [CrossRef]
- Harder, A.H. Fixed Point Theory and Stability Results for Fixed-Point Iteration Procedures. Ph.D. Thesis, University of Missouri-Rolla, St. Rolla, MO, USA, 1987. [Google Scholar]
- Okeke, G.A.; Abbas, M.; De la Sen, M. Approximation of the fixed point of multivalued quasi-nonexpansive mappings via a faster iterative process with applications. Discret. Dyn. Nat. Soc. 2020, 2020, 8634050. [Google Scholar] [CrossRef]
- Konnov, I.V. Combined Relaxation Methods for Variational Inequalities; Springer: Berlin/Heidelberg, Germany, 2001. [Google Scholar]
- Facchinei, F.; Pang, J.S. Finite-Dimensional Variational Inequalities and Complementarity Problems; Springer Series in Operations Research; Springer: New York, NY, USA, 2003; Volume II. [Google Scholar]
- Korpelevich, G.M. The extragradient method for finding saddle points and other problems. Ekon. Mat. Metod. 1976, 12, 747–756. [Google Scholar]
- Martinez-Yanes, C.; Xu, H.K. Strong convergence of the CQ method for fixed point iteration processes. Nonlinear Anal. 2006, 64, 2400–2411. [Google Scholar] [CrossRef]
- Hammad, H.A.; Rahman, H.; De la Sen, M. Shrinking projection methods for accelerating relaxed inertial Tseng-type algorithm with applications. Math. Probl. Eng. 2020, 2020, 7487383. [Google Scholar] [CrossRef]
- Hammad, H.A.; Cholamjiak, W.; Yambangwai, W.; Dutta, H. A modified shrinking projection methods for numerical reckoning fixed points of G-nonexpansive mappings in Hilbert spaces with graph. Miskolc Math. Notes 2019, 20, 941–956. [Google Scholar] [CrossRef]
- Tuyen, T.M.; Hammad, H.A. Effect of shrinking projection and CQ-methods on two inertial forward-backward algorithms for solving variational inclusion problems. Rend. Circ. Mat. Palermo II Ser. 2021, 70, 1669–1683. [Google Scholar] [CrossRef]
- Bauschke, H.H.; Combettes, P.L. Convex Analysis and Monotone Operator Theory in Hilbert Spaces; Springer: Berlin/Heidelberg, Germany, 2011. [Google Scholar]
- Bauschke, H.H.; Borwein, J.M. On projection algorithms for solving convex feasibility problems. SIAM Rev. 1996, 38, 367–426. [Google Scholar] [CrossRef]
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. |
© 2023 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).