BACK to VOLUME 38 NO.2
BACK to VOLUME 38 NO.2
Abstract:
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 {\sc Matlab}.
AMS: 93B;
BACK to VOLUME 38 NO.2