Identifiability and identification of linear distributed systems under approximation

Considers the identification problem of a linear distributed parameter system under approximation. The author first gives a brief review of the main properties of general orthogonal polynomials and afterwards approximates the infinite dimensional system into a lumped model. Then the author investigates the identifiability problem under approximation. The identification problem is discussed and conditions are given ensuring the local uniqueness of the solution. The estimation of the parameters are obtained using the Gauss-Newton algorithm. Finally an example is given to illustrate the theory