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.
In this paper , we study some approximation properties of the strong difference and study the relation between the strong difference and the weighted modulus of continuity
In this paper, we generalized the principle of Banach contractive to the relative formula and then used this formula to prove that the set valued mapping has a fixed point in a complete partial metric space. We also showed that the set-valued mapping can have a fixed point in a complete partial metric space without satisfying the contraction condition. Additionally, we justified an example for our proof.
Education specialists have differed about determining the best ways to detect the
talented. Since the appearance of the mental and psychological measurement movement, some
scholars adopted intelligence ratios as a criterion to identify the talented and others went to
rely on the degree of academic achievement. Each of these two methods has its own flaws and
mistakes and a large number of talented children were victims of these two methods.
Therefore the need to use other scales for the purpose of detection of talented children
appeared because they provide valuable information which may not be obtained easily
through objective tests and these scales are derived from consecutive studies of gifted andtalented children
In the present study, the cluster concept was adopted to find points parallel to the cumulative points of any subset in topology cluster proximity spaces. The takeoff set term was given by the researcher to the set of all points. Also, an opposite definition was found for it, which is the follower set. The relation between them was found and their most important properties were highlighted. Through these two sets, new sets were built that are called, f_σ-set ,f_tσ-set ,t_fσ-set ,bushy set, scant set .
Soft closure spaces are a new structure that was introduced very recently. These new spaces are based on the notion of soft closure operators. This work aims to provide applications of soft closure operators. We introduce the concept of soft continuous mappings and soft closed (resp. open) mappings, support them with examples, and investigate some of their properties.
This paper consist some new generalizations of some definitions such: j-ω-closure converge to a point, j-ω-closure directed toward a set, almost j-ω-converges to a set, almost j-ω-cluster point, a set j-ω-H-closed relative, j-ω-closure continuous mappings, j-ω-weakly continuous mappings, j-ω-compact mappings, j-ω-rigid a set, almost j-ω-closed mappings and j-ω-perfect mappings. Also, we prove several results concerning it, where j Î{q, δ,a, pre, b, b}.
In 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 virtual decomposition control (VDC) is an efficient tool suitable to deal with the full-dynamics-based control problem of complex robots. However, the regressor-based adaptive control used by VDC to control every subsystem and to estimate the unknown parameters demands specific knowledge about the system physics. Therefore, in this paper, we focus on reorganizing the equation of the VDC for a serial chain manipulator using the adaptive function approximation technique (FAT) without needing specific system physics. The dynamic matrices of the dynamic equation of every subsystem (e.g. link and joint) are approximated by orthogonal functions due to the minimum approximation errors produced. The contr
In this paper, some basic notions and facts in the b-modular space similar to those in the modular spaces as a type of generalization are given. For example, concepts of convergence, best approximate, uniformly convexity etc. And then, two results about relation between semi compactness and approximation are proved which are used to prove a theorem on the existence of best approximation for a semi-compact subset of b-modular space.
in this article, we present a definition of k-generalized map independent of non-expansive map and give infinite families of non-expansive and k-generalized maps new iterative algorithms. Such algorithms are also studied in the Hilbert spaces as the potential to exist for asymptotic common fixed point.