Using symmetries in the eigenvalue method for polynomial systems

DOI10.1016/J.JSC.2008.11.009MaRDI QIDQ731929zbMATH OpenOpenAlexFDO

Authors Karin Gatermann, Ilias S. Kotsireas, Robert M. Corless

Publication date 9 October 2009

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jsc.2008.11.009

eigenvalue method solving polynomial systems symmetries

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Computational aspects in algebraic geometry (14Q99)

Review text

Let \(I\subset \mathbb{C}[x_1, \dots, x_n]\) be a zero--dimensional ideal. For \(f\in\mathbb{C}[x_1, \dots, x_n]\) denote by \(m_f\) the matrix defined by the multiplication with \(f\) in the algebra \(\mathbb{C}[x_1, \dots, x_n]/I\) and \(h_f\) its minimal polynomial. It is known that the roots of \(h_f=0\) coincide with the eigenvalues of \(m_f\) resp. the values of \(f\) on \(V(I)\). Using this fact one can compute the eigenvalues numerically and find the points in \(V(I)\), i.e. the solutions of the polynomial equations defining \(I\). This so-called eigenvalue method is studied and adapted to the case that the system of polynomial equations has symmetries. It is proved that the corresponding matrices occuring in this situation have a special block diagonal structure. An algorithm is given to exploit this result in an efficient way.

Recommendations

Cites work

Cited in

(7)

Describes a project that uses

Uses Software

This page was built for publication: Using symmetries in the eigenvalue method for polynomial systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q731929)