Solving polynomial systems via symbolic-numeric reduction to geometric involutive form
Authors:
- 1 March 2009
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 44 (3) , 280-291
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Determination of approximate symmetries of differential equations2005
- Cartan involutiveness = Mumford regularity2003
- Geometric completion of differential systems using numeric-symbolic continuationACM SIGSAM Bulletin, 2002
- Differential Elimination–Completion Algorithms for DAE and PDAEStudies in Applied Mathematics, 2001
- Fast algorithm for solving the Hankel/Toeplitz Structured Total Least Squares problemNumerical Algorithms, 2000
- H-bases for polynomial interpolation and system solvingAdvances in Computational Mathematics, 2000
- Involutive bases of polynomial idealsMathematics and Computers in Simulation, 1998
- Multivariate polynomial equations with multiple zeros solved by matrix eigenproblemsNumerische Mathematik, 1995
- An Elimination Algorithm for the Computation of All Zeros of a System of Multivariate Polynomial Equations1988
- On E. Cartan's Prolongation Theorem of Exterior Differential SystemsAmerican Journal of Mathematics, 1957