Preferred Language
Articles
/
rXiIh6ABuRolNscL1fDy
Generalization of Prolla's Theorem in Approximation
...Show More Authors

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.

Scopus Crossref
View Publication
Publication Date
Fri Jun 01 2007
Journal Name
Journal Of Al-nahrain University Science
ON THE GREEDY RADIAL BASIS FUNCTION NEURAL NETWORKS FOR APPROXIMATION MULTIDIMENSIONAL FUNCTIONS
...Show More Authors

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]).

View Publication Preview PDF
Crossref (1)
Crossref
Publication Date
Sun Aug 01 2021
Journal Name
International Journal Of Mechanical Engineering And Robotics Research
Adaptive Approximation-Based Feedback Linearization Control for a Nonlinear Smart Thin Plate
...Show More Authors

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
View Publication Preview PDF
Crossref (2)
Crossref
Publication Date
Tue May 01 2018
Journal Name
2018 2nd Ieee Advanced Information Management,communicates,electronic And Automation Control Conference (imcec)
Hybrid Regressor and Approximation-Based Adaptive Control of Robotic Manipulators with Contact-Free Motion
...Show More Authors

View Publication
Scopus (19)
Crossref (13)
Scopus Crossref
Publication Date
Tue Sep 01 2020
Journal Name
Baghdad Science Journal
Best Multiplier Approximation of Unbounded Periodic Functions in L_(p,∅_n ) (B),B=[0,2π] Using Discrete Linear Positive Operators
...Show More Authors

The purpose of this paper is to find the best multiplier approximation of unbounded functions in    –space by using some discrete linear positive operators. Also we will estimate the degree of the best multiplier approximation in term of modulus of continuity and the averaged modulus.

View Publication Preview PDF
Scopus (3)
Crossref (2)
Scopus Clarivate Crossref
Publication Date
Tue Aug 06 2013
Journal Name
Robotica
Function approximation technique-based adaptive virtual decomposition control for a serial-chain manipulator
...Show More Authors
SUMMARY<p>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</p> ... Show More
View Publication
Scopus (27)
Crossref (21)
Scopus Clarivate Crossref
Publication Date
Wed Jul 02 2025
Journal Name
Advances In Nonlinear Variational Inequalities
Suggesting Approximation and Exact Algorithms to Solve New Tri-Criteria Machine Scheduling Problems
...Show More Authors

This study presents the multi criteria single-machine model. The machine scheduling problem (MSP) for ntasks on a single machine involves minimizing a function of three criteria: total completion time (C_j),maximum earliest (E_max), and tardiness (〖ΣT〗_j), This is an NP-hard issue. Within this work's theoretical section, we present the mathematical formulation of The presented topic thenhighlights the usefulness of the dominance rule (DR), which may be used to develop effective solutions. Whilein the practical part, one of the important exact methods; The proposed MSP tricriteria are solved by applyingthe Branch and Bound (BAB) method, which finds a set of efficient solutions for 1//F(ΣC_j ,ΣT_j ,E_max) upto n=100 jobs. The BAB appro

... Show More
Publication Date
Sat Jan 01 2022
Journal Name
The 2nd Universitas Lampung International Conference On Science, Technology, And Environment (ulicoste) 2021
Investigation of the vibrational spectral and electronic properties for ZnxBe7-xO7 wurtzoid via DFT approximation
...Show More Authors

View Publication
Scopus (1)
Scopus Crossref
Publication Date
Tue Jan 10 2017
Journal Name
International Journal Of Dynamics And Control
On local approximation-based adaptive control with applications to robotic manipulators and biped robots
...Show More Authors

View Publication
Scopus (10)
Crossref (7)
Scopus Crossref
Publication Date
Thu Dec 01 2022
Journal Name
Baghdad Science Journal
The Approximation of Weighted Hölder Functions by Fourier-Jacobi Polynomials to the Singular Sturm-Liouville Operator
...Show More Authors

      In this work, a weighted H lder function that approximates a Jacobi polynomial which solves the second order singular Sturm-Liouville equation is discussed. This is generally equivalent to the Jacobean translations and the moduli of smoothness. This paper aims to focus on improving methods of approximation and finding the upper and lower estimates for the degree of approximation in weighted H lder spaces by modifying the modulus of continuity and smoothness. Moreover, some properties for the moduli of smoothness with direct and inverse results are considered.

View Publication Preview PDF
Scopus (7)
Crossref (3)
Scopus Clarivate Crossref
Publication Date
Fri Oct 12 2018
Journal Name
International Journal Of Dynamics And Control
Decentralized adaptive partitioned approximation control of high degrees-of-freedom robotic manipulators considering three actuator control modes
...Show More Authors

View Publication
Scopus (11)
Crossref (9)
Scopus Crossref