Computing the multiplicity structure in solving polynomial systems

Authors:
Barry H. Dayton;Zhonggang Zeng
Affiliations:
Northeastern Illinois University, Chicago, IL;Northeastern Illinois University, Chicago, IL
Venue:
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Year:
2005

Citing 12
Cited 23

Algorithms for intersecting parametric and algebraic curves II: multiple intersections

Graphical Models and Image Processing
Multivariate polynomial equations with multiple zeros solved by matrix eigenproblems

Numerische Mathematik
Analysis of zero clusters in multivariate polynomial systems

ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
Matrix eigenproblems are at the heart of polynomial system solving

ACM SIGSAM Bulletin
A reordered Schur factorization method for zero-dimensional polynomial systems with multiple roots

ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
Numerical calculation of the multiplicity of a solution to algebraic equations

Mathematics of Computation
On multiple zeros of systems of algebraic equations

ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
SINGULAR — A computer algebra system for polynomial computations

Symbolic computation and automated reasoning
Numerical Decomposition of the Solution Sets of Polynomial Systems into Irreducible Components

SIAM Journal on Numerical Analysis
Numerical Polynomial Algebra

Numerical Polynomial Algebra
The approximate GCD of inexact polynomials

ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
A Rank-Revealing Method with Updating, Downdating, and Applications

SIAM Journal on Matrix Analysis and Applications

Approximate radical of ideals with clusters of roots

Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Newton's method with deflation for isolated singularities of polynomial systems

Theoretical Computer Science
On approximate triangular decompositions in dimension zero

Journal of Symbolic Computation
Numerical algebraic geometry and kinematics

Proceedings of the 2007 international workshop on Symbolic-numeric computation
Numerical local rings and local solution of nonlinear systems

Proceedings of the 2007 international workshop on Symbolic-numeric computation
Numerical primary decomposition

Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
Computing the multiplicity structure from geometric involutive form

Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
A numerical elimination method for polynomial computations

Theoretical Computer Science
ApaTools: a software toolbox for approximate polynomial algebra

ACM Communications in Computer Algebra
Nearest multivariate system with given root multiplicities

Journal of Symbolic Computation
Evaluation techniques for zero-dimensional primary decomposition

Journal of Symbolic Computation
Sweeping algebraic curves for singular solutions

Journal of Computational and Applied Mathematics
Chern numbers of smooth varieties via homotopy continuation and intersection theory

Journal of Symbolic Computation
Deflation and certified isolation of singular zeros of polynomial systems

Proceedings of the 36th international symposium on Symbolic and algebraic computation
Sampling algebraic sets in local intrinsic coordinates

Computers & Mathematics with Applications
Determining singular solutions of polynomial systems via symbolic-numeric reduction to geometric involutive forms

Journal of Symbolic Computation
Computing the multiplicity structure of an isolated singular solution: Case of breadth one

Journal of Symbolic Computation
Numerical calculation of H-bases for positive dimensional varieties

Proceedings of the 2011 International Workshop on Symbolic-Numeric Computation
Computing Isolated Singular Solutions of Polynomial Systems: Case of Breadth One

SIAM Journal on Numerical Analysis
On Fulton's algorithm for computing intersection multiplicities

CASC'12 Proceedings of the 14th international conference on Computer Algebra in Scientific Computing
Approximately singular systems and ill-conditioned polynomial systems

CASC'12 Proceedings of the 14th international conference on Computer Algebra in Scientific Computing
Verified error bounds for isolated singular solutions of polynomial systems: Case of breadth one

Theoretical Computer Science
Algorithm 931: An algorithm and software for computing multiplicity structures at zeros of nonlinear systems

ACM Transactions on Mathematical Software (TOMS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents algorithms for computing the multiplicity structure of a zero to a polynomial system. The zero can be exact or approximate with the system being intrinsic or empirical. As an application, the dual space theory and methodology are utilized to analyze deflation methods in solving polynomial systems, to establish tighter deflation bound, and to derive special case algorithms.