The aim of this paper is to propose a new faster iterative scheme (called AA-iteration) to approximate the fixed point of (b,η)-enriched contraction mapping in the framework of Banach spaces. It is also proved that our iteration is stable and converges faster than many iterations existing in the literature. For validity of our proposed scheme, we presented some numerical examples. Further, we proved some strong and weak convergence results for b-enriched nonexpansive mapping in the uniformly convex Banach space. Finally, we approximate the solution of delay fractional differential equations using AA -iterative scheme.The authors are very grateful to the Basque Government for their support through Grant no. IT1207-19
AbstractWe introduce a general computational fixed-point method to prove existence of periodic solut...
We introduce a general computational fixed-point method to prove existence of periodic solutions of ...
[EN] In this paper, we propose a new iteration process which is faster than the leading S [J. Nonlin...
The aim of this paper is to propose a new faster iterative scheme (called AA-iteration) to approxima...
In this article, we develop a faster iteration method, called the A∗∗ iteration method, for approxim...
Abstract In this paper, we prove that a three-step iteration process is stable for contractive-like ...
Fixed point theory is a branch of mathematics that studies solutions that remain unchanged under a g...
We connect the F iteration process with the class of generalized α-nonexpansive mappings. Under some...
We approximate the fixed points of contraction mappings using the Picard–Krasnoselskii hybrid iterat...
This paper presents a new iterative algorithm for approximating the fixed points of multivalued gene...
This paper presents a new iterative algorithm for approximating the fixed points of multivalued gene...
summary:In this paper, we establish sufficient conditions for the existence of solutions for nonline...
In this work we prove that $M$-iteration process converges strongly faster than $S$-iteration and Pi...
AbstractWe discuss iterative methods of the form xn: = μ0Φ(xx − 1) + μ1xn − 1 + … + μkxn − k (n = k,...
This article deals with an iterative method which is a new formulation of Adomian decomposition meth...
AbstractWe introduce a general computational fixed-point method to prove existence of periodic solut...
We introduce a general computational fixed-point method to prove existence of periodic solutions of ...
[EN] In this paper, we propose a new iteration process which is faster than the leading S [J. Nonlin...
The aim of this paper is to propose a new faster iterative scheme (called AA-iteration) to approxima...
In this article, we develop a faster iteration method, called the A∗∗ iteration method, for approxim...
Abstract In this paper, we prove that a three-step iteration process is stable for contractive-like ...
Fixed point theory is a branch of mathematics that studies solutions that remain unchanged under a g...
We connect the F iteration process with the class of generalized α-nonexpansive mappings. Under some...
We approximate the fixed points of contraction mappings using the Picard–Krasnoselskii hybrid iterat...
This paper presents a new iterative algorithm for approximating the fixed points of multivalued gene...
This paper presents a new iterative algorithm for approximating the fixed points of multivalued gene...
summary:In this paper, we establish sufficient conditions for the existence of solutions for nonline...
In this work we prove that $M$-iteration process converges strongly faster than $S$-iteration and Pi...
AbstractWe discuss iterative methods of the form xn: = μ0Φ(xx − 1) + μ1xn − 1 + … + μkxn − k (n = k,...
This article deals with an iterative method which is a new formulation of Adomian decomposition meth...
AbstractWe introduce a general computational fixed-point method to prove existence of periodic solut...
We introduce a general computational fixed-point method to prove existence of periodic solutions of ...
[EN] In this paper, we propose a new iteration process which is faster than the leading S [J. Nonlin...