The aim of this article, we define new iterative methods called three-step type in which Jungck resolvent CR-iteration and resolvent Jungck SP-iteration are discussed and study rate convergence and strong convergence in Banach space to reach the fixed point which is differentially solve of nonlinear equations. The studies also expanded around it to find the best solution for nonlinear operator equations in addition to the varying inequalities in Hilbert spaces and Banach spaces, as well as the use of these iterative methods to approximate the difference between algorithms and their images, where we examined the necessary conditions that guarantee the unity and existence of the solid point. Finally, the results show that resolvent CR-iteration is faster than resolvent Jungck SP-iteration using Jungck resolvent estimation.
Based on the needs of the scientific community, researchers tended to find new iterative schemes or develop previous iterative schemes that would help researchers reach the fixed point with fewer steps and with stability, will be define in this paper the multi_implicit four-step iterative (MIFSI) which is development to four-step implicit fixed point iterative, to develop the aforementioned iterative scheme, we will use a finite set of projective functions ,nonexpansive function and finite set from a new functions called generalized quasi like contractive which is an amalgamation of quasi contractive function and contractive like function , by the last function and a set of sequential organized steps, we will be able to prove the existen
... Show MoreIn this paper , an efficient new procedure is proposed to modify third –order iterative method obtained by Rostom and Fuad [Saeed. R. K. and Khthr. F.W. New third –order iterative method for solving nonlinear equations. J. Appl. Sci .7(2011): 916-921] , using three steps based on Newton equation , finite difference method and linear interpolation. Analysis of convergence is given to show the efficiency and the performance of the new method for solving nonlinear equations. The efficiency of the new method is demonstrated by numerical examples.
Throughout this paper, a generic iteration algorithm for a finite family of total asymptotically quasi-nonexpansive maps in uniformly convex Banach space is suggested. As well as weak / strong convergence theorems of this algorithm to a common fixed point are established. Finally, illustrative numerical example by using Matlab is presented.
To obtain the approximate solution to Riccati matrix differential equations, a new variational iteration approach was proposed, which is suggested to improve the accuracy and increase the convergence rate of the approximate solutons to the exact solution. This technique was found to give very accurate results in a few number of iterations. In this paper, the modified approaches were derived to give modified solutions of proposed and used and the convergence analysis to the exact solution of the derived sequence of approximate solutions is also stated and proved. Two examples were also solved, which shows the reliability and applicability of the proposed approach.
Density functional theory (DFT) calculations were used to evaluate the capability of Glutamine (Gln) and its derivative chemicals as inhibitors for the anti-corrosive behavior of iron. The current work is devoted to scrutinizing reactivity descriptors (both local and global) of Gln, two states of neutral and protonated. Also, the change of Gln upon the incorporation into dipeptides was investigated. Since the number of reaction centers has increased, an enhancement in dipeptides’ inhibitory effect was observed. Thus, the adsorption of small-scale peptides and glutamine amino acids on Fe surfaces (1 1 1) was performed, and characteristics such as adsorption energies and the configuration with the highest stability and lowest energy were ca
... Show MoreIn this article, we introduced a new concept of mappings called δZA - Quasi contractive mapping and we study the K*- iteration process for approximation of fixed points, and we proved that this iteration process is faster than the existing leading iteration processes like Noor iteration process, CR -iteration process, SP and Karahan Two- step iteration process for 𝛿𝒵𝒜 − quasi contraction mappings. We supported our analytic proof by a numerical example.
The focus of this paper is the presentation of a new type of mapping called projection Jungck zn- Suzuki generalized and also defining new algorithms of various types (one-step and two-step algorithms) (projection Jungck-normal N algorithm, projection Jungck-Picard algorithm, projection Jungck-Krasnoselskii algorithm, and projection Jungck-Thianwan algorithm). The convergence of these algorithms has been studied, and it was discovered that they all converge to a fixed point. Furthermore, using the previous three conditions for the lemma, we demonstrated that the difference between any two sequences is zero. These algorithms' stability was demonstrated using projection Jungck Suzuki generalized mapping. In contrast, the rate of convergenc
... Show MoreThe research aims to know The Effect Of Flexible Grouping Strategy and Three Step Interview strategy on achievement of the history material among student of the first literary class, The Researcher used the experimental design of the two experimental groups and the control group and with post test, researcher group (a) represent the experimental group taught according the Flexible Grouping Strategy , and Division (c) to represent the second experimental group which studied according Three Step Interview strategy and Division (b ) to represent the control group taught in the traditional method, the number of students (99) students of (33) female students in each division. T
... Show MoreThe goal of this study is to provide a new explicit iterative process method approach for solving maximal monotone(M.M )operators in Hilbert spaces utilizing a finite family of different types of mappings as( nonexpansive mappings,resolvent mappings and projection mappings. The findings given in this research strengthen and extend key previous findings in the literature. Then, utilizing various structural conditions in Hilbert space and variational inequality problems, we examine the strong convergence to nearest point projection for these explicit iterative process methods Under the presence of two important conditions for convergence, namely closure and convexity. The findings reported in this research strengthen and extend
... Show More