Computing the multiplicity structure in solving polynomial systems
From MaRDI portal
Publication:5262751
DOI10.1145/1073884.1073902zbMATH Open1360.65151OpenAlexW2009126887MaRDI QIDQ5262751FDOQ5262751
Authors: Barry H. Dayton, Zhonggang Zeng 
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
Recommendations
Symbolic computation and algebraic computation (68W30) Numerical computation of solutions to systems of equations (65H10)
Cited In (66)
- Numerical approximation of multiple isolated roots of analytical systems
- Numerical computation of the Hilbert function and regularity of a zero dimensional scheme
- Determining singular solutions of polynomial systems via symbolic-numeric reduction to geometric involutive forms
- Numerical decomposition of the rank-deficiency set of a matrix of multivariate polynomials
- Enumerating rigid sphere packings
- Comparison of probabilistic algorithms for analyzing the components of an affine algebraic variety
- On the null spaces of the Macaulay matrix
- Locating the closest singularity in a polynomial homotopy
- Title not available (Why is that?)
- Unification and extension of intersection algorithms in numerical algebraic geometry
- On the multiplicity of isolated roots of sparse polynomial systems
- A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers
- Real solution isolation with multiplicity of zero-dimensional triangular systems
- Computing the multiplicity structure from geometric involutive form
- Computing PUR of zero-dimensional ideals of breadth at most one
- The closedness subspace method for computing the multiplicity structure of a polynomial system
- Regularization and matrix computation in numerical polynomial algebra
- Multiplicity-preserving triangular set decomposition of two polynomials
- Clustering complex zeros of triangular systems of polynomials
- Nearest multivariate system with given root multiplicities
- Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\)
- Multiple zeros of nonlinear systems
- Determining dimension of the solution component that contains a computed zero of a polynomial system
- A heuristic method for certifying isolated zeros of polynomial systems
- Efficient computation of dual space and directional multiplicity of an isolated point
- Isosingular sets and deflation
- Regenerative cascade homotopies for solving polynomial systems
- A new deflation method for verifying the isolated singular zeros of polynomial systems
- On approximate triangular decompositions in dimension zero
- Evaluation techniques for zero-dimensional primary decomposition
- An adaptive homotopy method for computing bifurcations of nonlinear parametric systems
- Inverse multivariate polynomial root-finding: numerical implementations of the affine and projective Buchberger-Möller algorithm
- A numerical elimination method for polynomial computations
- Title not available (Why is that?)
- Binomiality testing and computing sparse polynomials via witness sets
- On deflation and multiplicity structure
- Computing Solutions Uniquely Collapses the Polynomial Hierarchy
- Newton polytopes and witness sets
- Chern numbers of smooth varieties via homotopy continuation and intersection theory
- 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
- Improved two-step Newton's method for computing simple multiple zeros of polynomial systems
- Sweeping algebraic curves for singular solutions
- The equivalent representation of the breadth-one \(D\)-invariant polynomial subspace and its discretization
- Verified error bounds for singular solutions of nonlinear systems
- Witness sets of projections
- Mechanism mobility and a local dimension test
- Multiprojective witness sets and a trace test
- Computers and the Multiplicity of Polynomial Roots
- Eliminating dual spaces
- Foreword. What is numerical algebraic geometry?
- On isolation of simple multiple zeros and clusters of zeros of polynomial systems
- Regeneration homotopies for solving systems of polynomials
- Verified error bounds for isolated singular solutions of polynomial systems: case of breadth one
- Computing the multiplicity structure of an isolated singular solution: case of breadth one
- Numerical calculation of the multiplicity of a solution to algebraic equations
- Sampling algebraic sets in local intrinsic coordinates
- Numerical computation of the genus of an irreducible curve within an algebraic set
- Newton-Anderson at Singular Points
- Two-step Newton's method for deflation-one singular zeros of analytic systems
- Systems of Polynomial Equations, Higher-Order Tensor Decompositions, and Multidimensional Harmonic Retrieval: A Unifying Framework. Part II: The Block Term Decomposition
- Numerical irreducible decomposition over a number field
- Squarefree normal representation of zeros of zero-dimensional polynomial systems
- Isolated singularities, inverse systems and the punctual Hilbert scheme
- Analyzing the dual space of the saturated ideal of a regular set and the local multiplicities of its zeros
- A certified iterative method for isolated singular roots
This page was built for publication: Computing the multiplicity structure in solving polynomial systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5262751)
