On Improving the Robustness of the Single Scan Polynomial Tracking
- Publisher: Department of Automatic Control and Systems Engineering
This report presents some recent work accomplished for the improvement in the robustness of polynomial tracking algorithms. The single scan problem is stated and solved in linear algebra paradigm and the resulting solution has been found to be identical to the one developed in a previous report using the finite differences and Taylor's series approach. To improve the robustness of the single scan algorithm, an averaging version has been derived. The improvement is achieved by sampling more frequently than the order of the field generating function.
views in local repository
downloads in local repository
The information is available from the following content providers: