Pseudozeros of Multivariate Polynomials (original) (raw)
Related papers
Article electronically published on May 15, 2002 PSEUDOZEROS OF MULTIVARIATE POLYNOMIALS
2008
Zero-dimensional families of polynomial systems
Approximate zero polynomials of polynomial matrices and linear systems
2011
Accelerated Solution of Multivariate Polynomial Systems of Equations
SIAM Journal on Computing, 2003
1986
Computing with semi-algebraic sets: Relaxation techniques and effective boundaries
Journal of Symbolic Computation, 2013
Asymptotic acceleration of solving multivariate polynomial systems of equations
Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98, 1998
Computation of all solutions to a system of polynomial equations
Mathematical Programming, 1983
The complexity and geometry of numerically solving polynomial systems
2012
An algorithm to initialize the searchof solutions of polynomial systems
Computers & Mathematics with Applications, 2005
Optimization of Polynomials on Compact Semialgebraic Sets
SIAM Journal on Optimization, 2005
Hybrid Method for Solving Polynomial Equations
2000
Computing several zeros of polynomial systems: A complexity analysis and Shannon's Entropy
On multiplicities in polynomial system solving
Transactions of the American Mathematical Society, 1996
Parallel computation of real solving bivariate polynomial systems by zero-matching method
Computing Research Repository, 2010
Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations
Advances in Cryptology …, 2000
Chapman & Hall/CRC Applied Algorithms and Data Structures series, 1998
Real solving polynomial equations with semidefinite programming
2008
Numerical decomposition of the rank-deficiency set of a matrix of multivariate polynomials
2010
Computing singular solutions to polynomial systems
Andrew Sommese, Charles Wampler
Advances in Applied Mathematics, 1992
Solutions of Multivariate Polynomial Systems using Macaulay Resultant Expressions
Vol. 152 of Advances in the Astronautical Sciences, 2014
Gröbner duality and multiplicities in polynomial system solving
Proceedings of the 1995 international symposium on Symbolic and algebraic computation - ISSAC '95, 1995
Gröbner bases in Asymptotic Analysis of Perturbed Polynomial Programs
Mathematical Methods of Operations Research, 2006
A numerical-symbolic algorithm for computing the multiplicity of a component of an algebraic set
Journal of Complexity, 2006
A condition number theorem for underdetermined polynomial systems
Mathematics of Computation, 2001
Lower Bounds for a Polynomial on a basic closed semialgebraic set using geometric programming
Solving polynomial optimization problems via the truncated tangency variety and sums of squares
Journal of Pure and Applied Algebra, 2009
On the calculation of the exact number of zeroes of a set of equations
Computing, 1983
Numerical Decomposition of the Solution Sets of Polynomial Systems into Irreducible Components
Andrew Sommese, Charles Wampler
SIAM Journal on Numerical Analysis, 2001
Polynomial Optimization on Some Unbounded Closed Semi-algebraic Sets
Journal of Optimization Theory and Applications, 2019
Pseudospectra of Matrix Polynomials that Are Expressed in Alternative Bases
Mathematics in Computer Science, 2007
An Optimization Framework for Polynomial An Optimization Framework for Polynomial Zerofinders
2020
Almost vanishing polynomials for sets of limited precision points
Journal of Symbolic Computation, 2010