laguerre function has many advantages such as good approximation capability for different systems, low computational complexity and the facility of on-line parameter identification. therefore, it is widely adopted for complex industrial process control. in this work, laguerre function based adaptive model predictive control algorithm (ampc) was implemented to control continuous stirred tank rea...

this paper presents a stable new algorithm for force/position control in robot manipulators. in this algorithm, position vectors are measured by sensors and then used in the control law. since using force sensor has some issues such as high costs and technical problems, an approach is presented to overcome these issues. in this respect, force sensor is replaced by an adaptive fuzzy estimator to...

in this article, a numerical approximation to the solution of the newell-whitehead equation (nwe) and cauchy problem of ill-posed non-linear diffusion equation have been studied. the presented scheme is obtained by using the derivative of the cubic b-spline quasi-interpolation (bsqi) to approximate the spatial derivative of the dependent variable and first order forward difference to approximat...

in this paper, an iterative method is proposed for solving the matrix inverse problem $ax=b$ for hermitian-generalized hamiltonian matrices with a submatrix constraint. by this iterative method, for any initial matrix $a_0$, a solution $a^*$ can be obtained in finite iteration steps in the absence of roundoff errors, and the solution with least norm can be obtained by choosing a special kind of...

We explore opportunities for parameterising constant factor approximation algorithms for vertex cover. We provide a simple algorithm that works on any approximation ratio of the form 2l+1 l+1 and has complexity that outperforms an algorithm by Bourgeois et al. derived from a sophisticated exact parameterised algorithm. In particular, for l = 1 (factor 1.5 approximation) our algorithm runs in ti...

Since the Bin Packing Problem (BPP) is one of the main NP-hard problems, a lot of approximation algorithms have been suggested for it. It has been proven that the best algorithm for BPP has the approximation ratio of and the time order of ( ), unless = . In the current paper, a linear approximation algorithm is presented. The suggested algorithm not only has the best possible theoretical factor...