Maybe it's better if I add a bit of explanation. I'm not very experienced with Maple, nor a great mathematician, so after all I may be making things very complicated for myself.

I'm examining dynamic systems for identifiability. I do that by writing up matrices for a state space description and then I calculate transfer functions. Then I use the coefficients in the polynomials in these transfer functions to see if the parameters in the state space model can be identified.

Thanks again,

- John

Hy Markiyan,

Thank you very much! If only it had benn polynomials, it would have been perfect. But I rather have systems like

solve gives me the solution.

In some of my systems, there are too many variables, and I could have an element like z=z in the solution. What I'd like to know is basically if that is the case. I can assume that all my parameters, x,y,z,... are positve so far.

I appreciate your help very much. Thanks again!

- John

Hy Markiyan,

Thank you very much! If only it had benn polynomials, it would have been perfect. But I rather have systems like

solve gives me the solution.

In some of my systems, there are too many variables, and I could have an element like z=z in the solution. What I'd like to know is basically if that is the case. I can assume that all my parameters, x,y,z,... are positve so far.

I appreciate your help very much. Thanks again!

- John