Computing the multiplicity structure in solving polynomial systems
From MaRDI portal
Publication:5262751
DOI10.1145/1073884.1073902zbMath1360.65151OpenAlexW2009126887MaRDI QIDQ5262751
Zhonggang Zeng, Barry H. Dayton
Publication date: 16 July 2015
Published in: Proceedings of the 2005 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1073884.1073902
Symbolic computation and algebraic computation (68W30) Numerical computation of solutions to systems of equations (65H10)
Related Items (57)
Computing PUR of zero-dimensional ideals of breadth at most one ⋮ A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers ⋮ On deflation and multiplicity structure ⋮ A heuristic method for certifying isolated zeros of polynomial systems ⋮ Efficient computation of dual space and directional multiplicity of an isolated point ⋮ A numerical elimination method for polynomial computations ⋮ Comparison of probabilistic algorithms for analyzing the components of an affine algebraic variety ⋮ Binomiality testing and computing sparse polynomials via witness sets ⋮ Numerical irreducible decomposition over a number field ⋮ Improved two-step Newton's method for computing simple multiple zeros of polynomial systems ⋮ Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\) ⋮ Isosingular sets and deflation ⋮ Inverse multivariate polynomial root-finding: numerical implementations of the affine and projective Buchberger-Möller algorithm ⋮ Chern numbers of smooth varieties via homotopy continuation and intersection theory ⋮ Verified error bounds for isolated singular solutions of polynomial systems: case of breadth one ⋮ Witness sets of projections ⋮ A certified iterative method for isolated singular roots ⋮ On the null spaces of the Macaulay matrix ⋮ Analyzing the dual space of the saturated ideal of a regular set and the local multiplicities of its zeros ⋮ The equivalent representation of the breadth-one \(D\)-invariant polynomial subspace and its discretization ⋮ Computing the multiplicity structure of an isolated singular solution: case of breadth one ⋮ Multiprojective witness sets and a trace test ⋮ Newton-Anderson at Singular Points ⋮ Two-step Newton's method for deflation-one singular zeros of analytic systems ⋮ Sampling algebraic sets in local intrinsic coordinates ⋮ Squarefree normal representation of zeros of zero-dimensional polynomial systems ⋮ Mechanism mobility and a local dimension test ⋮ Numerical approximation of multiple isolated roots of analytical systems ⋮ Regenerative cascade homotopies for solving polynomial systems ⋮ Newton polytopes and witness sets ⋮ Unification and extension of intersection algorithms in numerical algebraic geometry ⋮ Foreword. What is numerical algebraic geometry? ⋮ Eliminating dual spaces ⋮ A new deflation method for verifying the isolated singular zeros of polynomial systems ⋮ On approximate triangular decompositions in dimension zero ⋮ Numerical Decomposition of the Rank-Deficiency Set of a Matrix of Multivariate Polynomials ⋮ Regularization and Matrix Computation in Numerical Polynomial Algebra ⋮ Numerical computation of the genus of an irreducible curve within an algebraic set ⋮ Real solution isolation with multiplicity of zero-dimensional triangular systems ⋮ Sweeping algebraic curves for singular solutions ⋮ Newton's method with deflation for isolated singularities of polynomial systems ⋮ A numerical-symbolic algorithm for computing the multiplicity of a component of an algebraic set ⋮ Clustering complex zeros of triangular systems of polynomials ⋮ On isolation of simple multiple zeros and clusters of zeros of polynomial systems ⋮ Enumerating Rigid Sphere Packings ⋮ Regeneration homotopies for solving systems of polynomials ⋮ Nearest multivariate system with given root multiplicities ⋮ Verified error bounds for singular solutions of nonlinear systems ⋮ An adaptive homotopy method for computing bifurcations of nonlinear parametric systems ⋮ Multiple zeros of nonlinear systems ⋮ Evaluation techniques for zero-dimensional primary decomposition ⋮ Determining singular solutions of polynomial systems via symbolic-numeric reduction to geometric involutive forms ⋮ Systems of Polynomial Equations, Higher-Order Tensor Decompositions, and Multidimensional Harmonic Retrieval: A Unifying Framework. Part II: The Block Term Decomposition ⋮ On the multiplicity of isolated roots of sparse polynomial systems ⋮ Multiplicity-preserving triangular set decomposition of two polynomials ⋮ Numerical Computation of the Hilbert Function and Regularity of a Zero Dimensional Scheme ⋮ Locating the closest singularity in a polynomial homotopy
This page was built for publication: Computing the multiplicity structure in solving polynomial systems
