| Popis: |
Some classical methods to test a priori identifiability of linear systems are reviewed in order to make the related algebraic equations suitable to be solved by exploiting Computer Algebra techniques. Some experiences in applying Groebner Basis are reported, and it is shown that suitable reduction of equations, utilizing the topological properties of the associated graph, seems the more efficient tool for finding the solution. Moreover a linearisation procedure is illustrated that reduces the number of non linear equations in such a way all the resolution methods increase in efficiency. |
