An algorithm to construct matricial solutions of a polynomial system of equations (Q1895831): Difference between revisions

The paper is concerned with solving a multidimensional polynomial system of equations using a matricial algorithm. The equations are first linearized and then a separation of the variables is made. Each variable is replaced by an appropriate matrix which can be interpreted as a generalization of the accompanying matrices formalism. Finally, the initial problem is reduced to an eigenvalue problem. For linearization of the equations it is proved that any polynomial of degree \(n\) with \(p\) variables can be written as the \(n\)th power of a single matrix. Then the polynomial is linearized using matrices that turn out to be a representation of generalized Clifford algebras. Proposition 2.2 states the general solution of the multidimensional polynomial system as a set of matrices. The method presented here can also be used to analyze the compatibility of a system having more equations than unknowns.