In this paper we obtain some statistical approximation results for a general class of maxproduct operators including the paused linear positive operators.
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.
Let
In This paper, we have been approximated Grűnwald-Letnikov Derivative of a function having m continuous derivatives by Bernstein Chlodowsky polynomials with proving its best approximation. As well as we have been solved Bagley-Torvik equation and Fokker–Planck equation where the derivative is in Grűnwald-Letnikov sense.
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]).
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 aim of this paper is to approximate multidimensional functions by using the type of Feedforward neural networks (FFNNs) which is called Greedy radial basis function neural networks (GRBFNNs). Also, we introduce a modification to the greedy algorithm which is used to train the greedy radial basis function neural networks. An error bound are introduced in Sobolev space. Finally, a comparison was made between the three algorithms (modified greedy algorithm, Backpropagation algorithm and the result is published in [16]).
This paper proposes feedback linearization control (FBLC) based on function approximation technique (FAT) to regulate the vibrational motion of a smart thin plate considering the effect of axial stretching. The FBLC includes designing a nonlinear control law for the stabilization of the target dynamic system while the closedloop dynamics are linear with ensured stability. The objective of the FAT is to estimate the cubic nonlinear restoring force vector using the linear parameterization of weighting and orthogonal basis function matrices. Orthogonal Chebyshev polynomials are used as strong approximators for adaptive schemes. The proposed control architecture is applied to a thin plate with a large deflection that stimulates the axial loadin
... Show More