Symbolic recipes for polynomial system solving
This chapter of the book edited by \textit{A. M. Cohen}, \textit{H. Cuypers} and \textit{H. Sterk}: ``Some tapas of computer algebra (1999; Zbl 0924.13021) has the purpose of showing how to use algorithms and the methodology provided by computer algebra in order to find the solutions of an algebraic system of equations with a finite number of complex solutions. The chapter is divided into four sections. In the first one some mathematical prerequisites are given, and some basic methods are shown to solve polynomial systems by using Gröbner bases. The second one shows how polynomial system solving can be reduced to a linear algebra problem. The third section deals with the special case of polynomial systems where the number of equations is equal to the number of indeterminates. In the last section the authors consider very briefly numerical approximation techniques where the coordinates of the solutions are represented as eigenvalues of some endomorphisms introduced in the third section. For the entire collection see [Zbl 0924.13021].
- Isotopic triangulation of a real algebraic surface
- Solving symbolic equations with PRESS
- Some tapas of computer algebra
- Deciding Hopf bifurcations by quantifier elimination in a software-component architecture
- Towards faster real algebraic numbers
- Solving the equality-constrained minimization problem of polynomial functions
- Determination of the limits for multivariate rational functions
- Solving over-determined systems by the subresultant method (with an appendix by Marc Chardin)
- Rational univariate reduction via toric resultants
- scientific article; zbMATH DE number 645800 (Why is no real title available?)
- Simultaneous triangularization of commuting matrices for the solution of polynomial equations
- scientific article; zbMATH DE number 1827070 (Why is no real title available?)
- Stickelberger and the Eigenvalue Theorem
- Solving equations via algebras
- Squarefree decomposition of univariate polynomials depending on a parameter. Application to the integration of parametric rational functions
- Multivariate polynomial system solving using intersections of eigenspaces.
- Gröbner bases and wavelet design
- The invertibility of rational univariate representations
- Elimination ideal and bivariate resultant over finite fields
- Decomposing the radicals of polynomial ideals by rational univariate representations
- Bivariate polynomial reduction and elimination ideal over finite fields
- Irredundant decomposition of the radicals of polynomial ideals based on rational univariate representations
- On the computation of an arrangement of quadrics in 3D
- Introduction to the solution of polynomial systems
This page was built for publication: Symbolic recipes for polynomial system solving
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4238959)
