The principal factor in the proofs of many so-called intersection results and associated best approximation theorems—such as the famed Brouwer fixed-point theorem) is Knaster-Kuratowski-Mazurkiewicz theorem (KKM), which was extended from Rl to Hausdorff vector spaces by Ky Fan. This kind of theory necessitates introducing some form of abstract convex structure on a topological space. In both pure and applied mathematics, the theory of approximation plays a central role. The connection between best approximation and fixed-point theory provides a powerful tool for analyzing the nonlinear maps, the convergence of iterative processes, and the solving of variational problems. This paper is dedicated to presenting a new extension of the well-known Prolla’s theorem in the field of invariant approximation from a normed space to a kind of metric space. First, we will introduce the basic concepts of vector metric spaces, define the best approximation, and describe its relationship to fixed points. Second, we will substantiate the best approximation theorem using the state of KKM-map (where the convex combination of any finite elements in Θ⊂Π entirely belonged to the union of their images under the KKM-map,N,N:Θ→2Π). This theoretical construction has been applied to specific cases that were previously discussed as the best approximations in earlier papers.
This research includes the application of non-parametric methods in estimating the conditional survival function represented in a method (Turnbull) and (Generalization Turnbull's) using data for Interval censored of breast cancer and two types of treatment, Chemotherapy and radiation therapy and age is continuous variable, The algorithm of estimators was applied through using (MATLAB) and then the use average Mean Square Error (MSE) as amusement to the estimates and the results showed (generalization of Turnbull's) In estimating the conditional survival function and for both treatments ,The estimated survival of the patients does not show very large differences
... Show MoreIn this paper, a simple fast lossless image compression method is introduced for compressing medical images, it is based on integrates multiresolution coding along with polynomial approximation of linear based to decompose image signal followed by efficient coding. The test results indicate that the suggested method can lead to promising performance due to flexibility in overcoming the limitations or restrictions of the model order length and extra overhead information required compared to traditional predictive coding techniques.
The regressor-based adaptive control is useful for controlling robotic systems with uncertain parameters but with known structure of robot dynamics. Unmodeled dynamics could lead to instability problems unless modification of control law is used. In addition, exact calculation of regressor for robots with more than 6 degrees of freedom is hard to be calculated, and the task could be more complex for robots. Whereas the adaptive approximation control is a powerful tool for controlling robotic systems with unmodeled dynamics. The local (partitioned) approximation-based adaptive control includes representation of the uncertain matrices and vectors in the robot model as finite combinations of basis functions. Update laws for the weighting matri
... Show MoreThe 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 dependence of the energy losses or the stopping power for the ion contribution in D- T hot plasma fuels upon the corresponding energies and the related penetrating factorare arrive by using by a theoretical approximation models. In this work we reach a compatible agreement between our results and the corresponding experimental results.
The theory of general topology view for continuous mappings is general version and is applied for topological graph theory. Separation axioms can be regard as tools for distinguishing objects in information systems. Rough theory is one of map the topology to uncertainty. The aim of this work is to presented graph, continuity, separation properties and rough set to put a new approaches for uncertainty. For the introduce of various levels of approximations, we introduce several levels of continuity and separation axioms on graphs in Gm-closure approximation spaces.
The aim of this paper is to approximate multidimensional functions f∈C(R^s) by developing a new type of Feedforward neural networks (FFNS) which we called it Greedy ridge function neural networks (GRGFNNS). Also, we introduce a modification to the greedy algorithm which is used to train the greedy ridge function neural networks. An error bound are introduced in Sobolov space. Finally, a comparison was made between the three algorithms (modified greedy algorithm, Backpropagation algorithm and the result in [1]).