Solving systems of polynomial equations
- 1 March 1994
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computer Graphics and Applications
- Vol. 14 (2) , 46-55
- https://doi.org/10.1109/38.267470
Abstract
Geometric and solid modelling deal with the representation and manipulation of physical objects. Currently most geometric objects are formulated in terms of polynomial equations, thereby reducing many application problems to manipulating polynomial systems. Solving systems of polynomial equations is a fundamental problem in these geometric computations. The author presents an algorithm for solving polynomial equations. The combination of multipolynomial resultants and matrix computations underlies this efficient, robust and accurate algorithm.Keywords
This publication has 16 references indexed in Scilit:
- Multigraded Resultants of Sylvester TypeJournal of Algebra, 1994
- MultiPolynomial Resultant AlgorithmsJournal of Symbolic Computation, 1993
- An efficient algorithm for the sparse mixed resultantPublished by Springer Nature ,1993
- A NEW APPROACH FOR SURFACE INTERSECTIONInternational Journal of Computational Geometry & Applications, 1991
- Curve intersection using Bézier clippingComputer-Aided Design, 1990
- An Elimination Algorithm for the Computation of All Zeros of a System of Multivariate Polynomial EquationsPublished by Springer Nature ,1988
- Ray tracing parametric patchesACM SIGGRAPH Computer Graphics, 1982
- Simultaneous iteration for computing invariant subspaces of non-Hermitian matricesNumerische Mathematik, 1976
- The evaluation of the zeros of ill-conditioned polynomials. Part INumerische Mathematik, 1959
- Some Formulae in EliminationProceedings of the London Mathematical Society, 1902