Javascript must be enabled for the correct page display

Worst case system identification

Hoekstra, J.R. (1993) Worst case system identification. Master's Thesis / Essay, Mathematics.

Wis_DRS_1993_JRHoekstra.pdf - Published Version

Download (13MB) | Preview


In this paper we are looking at an identification process. That means there exists a certain plant of which we don't know much. We would like to know more about this plant, so it will be possible to control it. For building a good controller we need the transfer function of the plant. The algorithm provided in this paper give an approximation of this transfer function. The approximation is build up as follows. We begin with n starting points (inputs for our unknown system) wnich are uniformly spread over the complex unit circle: Zk = ei Ok , Ok = 27rkjn for k = 0, .. . , n - 1. Measuring the output we collect n point samples of this system: Eo, .. . , En - t . Using linear interpolation we get a piecewise linear function which contains our n point samples. We design a continuous function willch is an approximation of our piecewise linear function, we do so by using Fourier series. This continuous function on the complex unit circle is now extended to the complex unit disk. This extension is used as an approximation of ollr unknown transfer function .

Item Type: Thesis (Master's Thesis / Essay)
Degree programme: Mathematics
Thesis type: Master's Thesis / Essay
Language: English
Date Deposited: 15 Feb 2018 07:28
Last Modified: 15 Feb 2018 07:28

Actions (login required)

View Item View Item