AbstractA new self‐tuning implicit pole‐assignment algorithm is presented which, through the use of a pole compression factor and different RLS model and control structures, overcomes stability and convergence problems encountered in previously available algorithms. Computational requirements of the technique are much reduced when compared to explicit pole‐assignment schemes, whereas the inherent robustness of the strategy is ret
展开▼
