LAUSR

Abstract Firstly it will be shown that, using the concept of monomial orderings, the classical 1D theory for linear systems generalizes in a very natural way to (autonomous) Attasi nD-systems, giving the Attasi-Hankel matrix, the Attasi transfer function and Attasi state-space realizations. Secondly we will explain how one can associate an Attasi system to any set of polynomial equations having a finite number of solutions and how Attasi realization theory can be used to (1) describe a commutative matrix solution to the set of polynomial equations (this generalizes the Cayley-Hamilton theorem) and (2) find the (scalar) solutions to the set of polynomial equations by computing the joint eigenvalues and eigenvectors of the commuting matrices. Some remarks will be made about how the (discrete time) Attasi system equations can be solved recursively and how that can be used in large-scale eigensolvers. Using the associated Attasi system to a set of polynomial equations also helps to understand various different approaches to polynomial equation solving and multivariate polynomial and rational function minimization.