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.
The aim of this paper is to prove some results for equivalence of moduli of smoothnes in approximation theory , we used a"non uniform" modulus of smoothness and the weighted Ditzian –Totik moduli of smoothness in by spline functions ,several results are obtained .For example , it shown that ,for any the inequality , is satisfied ,finally, similar result for chebyshev partition and weighted Ditzian –Totik moduli of smoothness are also obtained.
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 this paper, we give a concept of
The radial wave function R(r) and the radial distribution function P(r) as a function of (r), for the Hydrogen atom was calculated for several atomic state (1s,2s,2p,3s,3p,3d) The results were compared with Hydrogen like atom(He+,Li+2,Be+3).
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}.
this paper give a proof of known conditions for the existence of peridic conincidence points of continuius maps using lindemann theotem on transcendental numbers
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
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 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.
The main purpose of this paper is to study feebly open and feebly closed mappings and we proved several results about that by using some concepts of topological feebly open and feebly closed sets , semi open (- closed ) set , gs-(sg-) closed set and composition of mappings.