The aim of this paper, is to study different iteration algorithms types two steps called, modified SP, Ishikawa, Picard-S iteration and M-iteration, which is faster than of others by using like contraction mappings. On the other hand, the M-iteration is better than of modified SP, Ishikawa and Picard-S iterations. Also, we support our analytic proof with a numerical example.
This paper is concerned with the study of the fixed points of set-valued contractions on ordered metric spaces. The first part of the paper deals with the existence of fixed points for these mappings where the contraction condition is assumed for comparable variables. A coupled fixed point theorem is also established in the second part.
In this paper, we shall introduce a new kind of Perfect (or proper) Mappings, namely ω-Perfect Mappings, which are strictly weaker than perfect mappings. And the following are the main results: (a) Let f : X→Y be ω-perfect mapping of a space X onto a space Y, then X is compact (Lindeloff), if Y is so. (b) Let f : X→Y be ω-perfect mapping of a regular space X onto a space Y. then X is paracompact (strongly paracompact), if Y is so paracompact (strongly paracompact). (c) Let X be a compact space and Y be a p*-space then the projection p : X×Y→Y is a ω-perfect mapping. Hence, X×Y is compact (paracompact, strongly paracompact) if and only if Y is so.
In this paper, we will introduce and study the concept of nano perfect mappings by using the definition of nano continuous mapping and nano closed mapping, study the relationship between them, and discuss them with many related theories and results. The k-space and its relationship with nano-perfect mapping are also defined.
In this work, we introduce Fibonacci– Halpern iterative scheme ( FH scheme) in partial ordered Banach space (POB space) for monotone total asymptotically non-expansive mapping (, MTAN mapping) that defined on weakly compact convex subset. We also discuss the results of weak and strong convergence for this scheme.
Throughout this work, compactness condition of m-th iterate of the mapping for some natural m is necessary to ensure strong convergence, while Opial's condition has been employed to show weak convergence. Stability of FH scheme is also studied. A numerical comparison is provided by an example to show that FH scheme is faster than Mann and Halpern iterative
... Show MoreIn this paper,the homtopy perturbation method (HPM) was applied to obtain the approximate solutions of the fractional order integro-differential equations . The fractional order derivatives and fractional order integral are described in the Caputo and Riemann-Liouville sense respectively. We can easily obtain the solution from convergent the infinite series of HPM . A theorem for convergence and error estimates of the HPM for solving fractional order integro-differential equations was given. Moreover, numerical results show that our theoretical analysis are accurate and the HPM can be considered as a powerful method for solving fractional order integro-diffrential equations.
... Show MoreIn this article, results have been shown via using a general quasi contraction multi-valued mapping in Cat(0) space. These results are used to prove the convergence of two iteration algorithms to a fixed point and the equivalence of convergence. We also demonstrate an appropriate conditions to ensure that one is faster than others.
The population density of the insect on Alorat and fruits located in the lower part of the tree more than the middle part of the plant and insect in one place and demonstrates that there is a nest there were conducted laboratory and field studies on citrus Hsasahanwaa and the Alvdaúaa distribution of cortical insect yellow ....
In this paper, the homotopy perturbation method (HPM) is presented for treating a linear system of second-kind mixed Volterra-Fredholm integral equations. The method is based on constructing the series whose summation is the solution of the considered system. Convergence of constructed series is discussed and its proof is given; also, the error estimation is obtained. Algorithm is suggested and applied on several examples and the results are computed by using MATLAB (R2015a). To show the accuracy of the results and the effectiveness of the method, the approximate solutions of some examples are compared with the exact solution by computing the absolute errors.
In this work, we introduce a new kind of perfect mappings, namely j-perfect mappings and j-ω-perfect mappings. Furthermore we devoted to study the relationship between j-perfect mappings and j-ω-perfect mappings. Finally, certain theorems and characterization concerning these concepts are studied; j = , δ, α, pre, b, β