Solving over-determined systems by the subresultant method (with an appendix by Marc Chardin)
Author:
- Agnes SzantoASAgnes Szanto
- 1 January 2008
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 43 (1) , 46-74
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Subresultants and generic monomial basesJournal of Symbolic Computation, 2005
- On the irreducibility of multivariate subresultantsComptes Rendus Mathematique, 2004
- Fast Algorithms for Zero-Dimensional Polynomial Systems using DualityApplicable Algebra in Engineering, Communication and Computing, 2003
- Hybrid Sparse Resultant Matrices for Bivariate PolynomialsJournal of Symbolic Computation, 2002
- Symbolic and Numeric Methods for Exploiting Structure in Constructing Resultant MatricesJournal of Symbolic Computation, 2002
- Explicit formulas for the multivariate resultantJournal of Pure and Applied Algebra, 2001
- Hilbert Functions, Residual Intersections, and Residually S2 IdealsCompositio Mathematica, 2001
- Multivariate subresultantsJournal of Pure and Applied Algebra, 1995
- The singular value decomposition for polynomial systems1995
- Subresultants and Reduced Polynomial Remainder SequencesJournal of the ACM, 1967