Page 1

Displaying 1 – 5 of 5

Showing per page

Discrete-time symmetric polynomial equations with complex coefficients

Didier Henrion, Jan Ježek, Michael Šebek (2002)

Kybernetika

Discrete-time symmetric polynomial equations with complex coefficients are studied in the scalar and matrix case. New theoretical results are derived and several algorithms are proposed and evaluated. Polynomial reduction algorithms are first described to study theoretical properties of the equations. Sylvester matrix algorithms are then developed to solve numerically the equations. The algorithms are implemented in the Polynomial Toolbox for Matlab.

Currently displaying 1 – 5 of 5

Page 1